/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 -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/mult-dist.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-05 23:59:58,348 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-05 23:59:58,350 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-05 23:59:58,390 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-05 23:59:58,391 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-05 23:59:58,393 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-05 23:59:58,396 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-05 23:59:58,400 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-05 23:59:58,404 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-05 23:59:58,409 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-05 23:59:58,410 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-05 23:59:58,412 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-05 23:59:58,412 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-05 23:59:58,414 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-05 23:59:58,415 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-05 23:59:58,418 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-05 23:59:58,419 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-05 23:59:58,420 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-05 23:59:58,422 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-05 23:59:58,427 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-05 23:59:58,430 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-05 23:59:58,431 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-05 23:59:58,432 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-05 23:59:58,433 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-05 23:59:58,440 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-05 23:59:58,440 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-05 23:59:58,441 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-05 23:59:58,442 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-05 23:59:58,443 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-05 23:59:58,444 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-05 23:59:58,444 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-05 23:59:58,446 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-05 23:59:58,447 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-05 23:59:58,448 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-05 23:59:58,448 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-05 23:59:58,449 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-05 23:59:58,449 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-05 23:59:58,449 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-05 23:59:58,450 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-05 23:59:58,450 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-05 23:59:58,451 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-05 23:59:58,455 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-05 23:59:58,489 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-05 23:59:58,490 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-05 23:59:58,492 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-05 23:59:58,492 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-05 23:59:58,492 INFO L138 SettingsManager]: * Use SBE=true [2022-12-05 23:59:58,493 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-05 23:59:58,493 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-05 23:59:58,493 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-05 23:59:58,493 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-05 23:59:58,493 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-05 23:59:58,494 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-05 23:59:58,494 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-05 23:59:58,494 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-05 23:59:58,494 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-05 23:59:58,495 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-05 23:59:58,495 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-05 23:59:58,495 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-05 23:59:58,495 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-05 23:59:58,495 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-05 23:59:58,495 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-05 23:59:58,495 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-05 23:59:58,496 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-05 23:59:58,496 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-05 23:59:58,496 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-05 23:59:58,496 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-05 23:59:58,496 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-05 23:59:58,496 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-05 23:59:58,496 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-05 23:59:58,497 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 [2022-12-05 23:59:58,829 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-05 23:59:58,847 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-05 23:59:58,850 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-05 23:59:58,851 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-05 23:59:58,851 INFO L275 PluginConnector]: CDTParser initialized [2022-12-05 23:59:58,852 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/mult-dist.wvr.c [2022-12-05 23:59:59,868 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 00:00:00,096 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 00:00:00,097 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/mult-dist.wvr.c [2022-12-06 00:00:00,108 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4803f9430/bad0b490e0db4e54b59c46f4f994d535/FLAGd0391afd7 [2022-12-06 00:00:00,123 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4803f9430/bad0b490e0db4e54b59c46f4f994d535 [2022-12-06 00:00:00,125 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 00:00:00,126 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 00:00:00,129 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 00:00:00,129 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 00:00:00,131 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 00:00:00,132 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 12:00:00" (1/1) ... [2022-12-06 00:00:00,133 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f2f03d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:00:00, skipping insertion in model container [2022-12-06 00:00:00,133 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 12:00:00" (1/1) ... [2022-12-06 00:00:00,138 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 00:00:00,163 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 00:00:00,353 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/mult-dist.wvr.c[2116,2129] [2022-12-06 00:00:00,360 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 00:00:00,370 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 00:00:00,402 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/mult-dist.wvr.c[2116,2129] [2022-12-06 00:00:00,403 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 00:00:00,417 INFO L208 MainTranslator]: Completed translation [2022-12-06 00:00:00,417 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:00:00 WrapperNode [2022-12-06 00:00:00,417 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 00:00:00,418 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 00:00:00,419 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 00:00:00,420 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 00:00:00,426 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:00:00" (1/1) ... [2022-12-06 00:00:00,440 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:00:00" (1/1) ... [2022-12-06 00:00:00,463 INFO L138 Inliner]: procedures = 22, calls = 25, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 70 [2022-12-06 00:00:00,464 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 00:00:00,465 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 00:00:00,465 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 00:00:00,466 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 00:00:00,473 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:00:00" (1/1) ... [2022-12-06 00:00:00,473 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:00:00" (1/1) ... [2022-12-06 00:00:00,478 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:00:00" (1/1) ... [2022-12-06 00:00:00,478 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:00:00" (1/1) ... [2022-12-06 00:00:00,493 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:00:00" (1/1) ... [2022-12-06 00:00:00,496 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:00:00" (1/1) ... [2022-12-06 00:00:00,497 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:00:00" (1/1) ... [2022-12-06 00:00:00,498 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:00:00" (1/1) ... [2022-12-06 00:00:00,499 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 00:00:00,500 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 00:00:00,500 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 00:00:00,500 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 00:00:00,501 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:00:00" (1/1) ... [2022-12-06 00:00:00,510 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 00:00:00,522 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:00:00,535 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-06 00:00:00,552 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-06 00:00:00,578 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 00:00:00,578 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-06 00:00:00,580 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-06 00:00:00,580 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-06 00:00:00,580 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-06 00:00:00,580 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-12-06 00:00:00,580 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-12-06 00:00:00,580 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 00:00:00,580 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 00:00:00,581 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 00:00:00,581 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 00:00:00,581 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 00:00:00,581 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-06 00:00:00,582 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 00:00:00,583 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-06 00:00:00,689 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 00:00:00,691 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 00:00:00,915 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 00:00:00,922 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 00:00:00,923 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2022-12-06 00:00:00,925 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 12:00:00 BoogieIcfgContainer [2022-12-06 00:00:00,925 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 00:00:00,934 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 00:00:00,934 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 00:00:00,937 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 00:00:00,937 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 12:00:00" (1/3) ... [2022-12-06 00:00:00,938 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60d4bdf6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 12:00:00, skipping insertion in model container [2022-12-06 00:00:00,938 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:00:00" (2/3) ... [2022-12-06 00:00:00,938 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60d4bdf6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 12:00:00, skipping insertion in model container [2022-12-06 00:00:00,938 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 12:00:00" (3/3) ... [2022-12-06 00:00:00,939 INFO L112 eAbstractionObserver]: Analyzing ICFG mult-dist.wvr.c [2022-12-06 00:00:00,955 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 00:00:00,956 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-06 00:00:00,956 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 00:00:01,034 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-12-06 00:00:01,063 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 105 places, 102 transitions, 228 flow [2022-12-06 00:00:01,120 INFO L130 PetriNetUnfolder]: 7/99 cut-off events. [2022-12-06 00:00:01,120 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 00:00:01,125 INFO L83 FinitePrefix]: Finished finitePrefix Result has 112 conditions, 99 events. 7/99 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 69 event pairs, 0 based on Foata normal form. 0/91 useless extension candidates. Maximal degree in co-relation 63. Up to 2 conditions per place. [2022-12-06 00:00:01,125 INFO L82 GeneralOperation]: Start removeDead. Operand has 105 places, 102 transitions, 228 flow [2022-12-06 00:00:01,128 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 92 places, 89 transitions, 196 flow [2022-12-06 00:00:01,129 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:00:01,143 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 92 places, 89 transitions, 196 flow [2022-12-06 00:00:01,147 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 92 places, 89 transitions, 196 flow [2022-12-06 00:00:01,172 INFO L130 PetriNetUnfolder]: 7/89 cut-off events. [2022-12-06 00:00:01,172 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 00:00:01,173 INFO L83 FinitePrefix]: Finished finitePrefix Result has 102 conditions, 89 events. 7/89 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 72 event pairs, 0 based on Foata normal form. 0/82 useless extension candidates. Maximal degree in co-relation 63. Up to 2 conditions per place. [2022-12-06 00:00:01,176 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 92 places, 89 transitions, 196 flow [2022-12-06 00:00:01,176 INFO L188 LiptonReduction]: Number of co-enabled transitions 1320 [2022-12-06 00:00:04,046 INFO L203 LiptonReduction]: Total number of compositions: 67 [2022-12-06 00:00:04,061 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 00:00:04,066 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;@426d9684, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 00:00:04,067 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-12-06 00:00:04,073 INFO L130 PetriNetUnfolder]: 3/21 cut-off events. [2022-12-06 00:00:04,073 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 00:00:04,074 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:00:04,074 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:00:04,075 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-06 00:00:04,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:00:04,079 INFO L85 PathProgramCache]: Analyzing trace with hash 1839579012, now seen corresponding path program 1 times [2022-12-06 00:00:04,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:00:04,087 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102865154] [2022-12-06 00:00:04,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:00:04,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:00:04,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:00:04,691 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-06 00:00:04,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:00:04,692 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102865154] [2022-12-06 00:00:04,693 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1102865154] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:00:04,693 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:00:04,693 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 00:00:04,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10537805] [2022-12-06 00:00:04,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:00:04,702 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 00:00:04,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:00:04,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 00:00:04,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 00:00:04,728 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 22 [2022-12-06 00:00:04,729 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 22 transitions, 62 flow. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:00:04,729 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:00:04,730 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 22 [2022-12-06 00:00:04,730 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:00:04,870 INFO L130 PetriNetUnfolder]: 359/506 cut-off events. [2022-12-06 00:00:04,870 INFO L131 PetriNetUnfolder]: For 50/50 co-relation queries the response was YES. [2022-12-06 00:00:04,875 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1064 conditions, 506 events. 359/506 cut-off events. For 50/50 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 1613 event pairs, 39 based on Foata normal form. 1/305 useless extension candidates. Maximal degree in co-relation 803. Up to 421 conditions per place. [2022-12-06 00:00:04,881 INFO L137 encePairwiseOnDemand]: 17/22 looper letters, 30 selfloop transitions, 4 changer transitions 1/38 dead transitions. [2022-12-06 00:00:04,881 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 38 transitions, 179 flow [2022-12-06 00:00:04,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 00:00:04,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 00:00:04,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 45 transitions. [2022-12-06 00:00:04,894 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6818181818181818 [2022-12-06 00:00:04,895 INFO L175 Difference]: Start difference. First operand has 29 places, 22 transitions, 62 flow. Second operand 3 states and 45 transitions. [2022-12-06 00:00:04,896 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 38 transitions, 179 flow [2022-12-06 00:00:04,900 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 38 transitions, 157 flow, removed 0 selfloop flow, removed 6 redundant places. [2022-12-06 00:00:04,903 INFO L231 Difference]: Finished difference. Result has 26 places, 25 transitions, 76 flow [2022-12-06 00:00:04,904 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=76, PETRI_PLACES=26, PETRI_TRANSITIONS=25} [2022-12-06 00:00:04,908 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, -3 predicate places. [2022-12-06 00:00:04,908 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:00:04,909 INFO L89 Accepts]: Start accepts. Operand has 26 places, 25 transitions, 76 flow [2022-12-06 00:00:04,911 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:00:04,911 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:00:04,911 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 26 places, 25 transitions, 76 flow [2022-12-06 00:00:04,913 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 26 places, 25 transitions, 76 flow [2022-12-06 00:00:04,919 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([269] thread3EXIT-->L77-2: Formula: (and (= v_thread3Thread1of1ForFork0_thidvar3_4 0) (= v_thread3Thread1of1ForFork0_thidvar1_4 0) (= v_thread3Thread1of1ForFork0_thidvar2_4 0) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem15#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread3Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem15#1=|v_ULTIMATE.start_main_#t~mem15#1_5|, thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem15#1=|v_ULTIMATE.start_main_#t~mem15#1_5|, thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4} AuxVars[] AssignedVars[][23], [25#L77-2true, 108#true, Black: 110#(and (= ~x_2~0 0) (= ~x_3~0 0) (= ~x_1~0 0))]) [2022-12-06 00:00:04,920 INFO L382 tUnfolder$Statistics]: this new event has 19 ancestors and is not cut-off event [2022-12-06 00:00:04,920 INFO L385 tUnfolder$Statistics]: existing Event has 19 ancestors and is not cut-off event [2022-12-06 00:00:04,920 INFO L385 tUnfolder$Statistics]: existing Event has 20 ancestors and is not cut-off event [2022-12-06 00:00:04,920 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is not cut-off event [2022-12-06 00:00:04,925 INFO L130 PetriNetUnfolder]: 22/62 cut-off events. [2022-12-06 00:00:04,925 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 00:00:04,925 INFO L83 FinitePrefix]: Finished finitePrefix Result has 97 conditions, 62 events. 22/62 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 135 event pairs, 1 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 64. Up to 26 conditions per place. [2022-12-06 00:00:04,926 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 26 places, 25 transitions, 76 flow [2022-12-06 00:00:04,926 INFO L188 LiptonReduction]: Number of co-enabled transitions 192 [2022-12-06 00:00:04,927 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:00:04,931 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 23 [2022-12-06 00:00:04,931 INFO L495 AbstractCegarLoop]: Abstraction has has 26 places, 25 transitions, 76 flow [2022-12-06 00:00:04,931 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:00:04,931 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:00:04,931 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:00:04,931 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 00:00:04,935 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-06 00:00:04,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:00:04,936 INFO L85 PathProgramCache]: Analyzing trace with hash 1296714879, now seen corresponding path program 1 times [2022-12-06 00:00:04,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:00:04,937 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957926359] [2022-12-06 00:00:04,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:00:04,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:00:05,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:00:05,262 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:00:05,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:00:05,262 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957926359] [2022-12-06 00:00:05,263 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1957926359] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:00:05,263 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:00:05,263 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-06 00:00:05,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234114183] [2022-12-06 00:00:05,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:00:05,264 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 00:00:05,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:00:05,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 00:00:05,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-06 00:00:05,265 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 22 [2022-12-06 00:00:05,265 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 25 transitions, 76 flow. Second operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:00:05,265 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:00:05,266 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 22 [2022-12-06 00:00:05,266 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:00:05,595 INFO L130 PetriNetUnfolder]: 638/974 cut-off events. [2022-12-06 00:00:05,595 INFO L131 PetriNetUnfolder]: For 186/186 co-relation queries the response was YES. [2022-12-06 00:00:05,597 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2341 conditions, 974 events. 638/974 cut-off events. For 186/186 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 3825 event pairs, 158 based on Foata normal form. 18/992 useless extension candidates. Maximal degree in co-relation 657. Up to 394 conditions per place. [2022-12-06 00:00:05,603 INFO L137 encePairwiseOnDemand]: 14/22 looper letters, 71 selfloop transitions, 8 changer transitions 10/89 dead transitions. [2022-12-06 00:00:05,604 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 89 transitions, 434 flow [2022-12-06 00:00:05,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 00:00:05,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 00:00:05,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 82 transitions. [2022-12-06 00:00:05,607 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5324675324675324 [2022-12-06 00:00:05,607 INFO L175 Difference]: Start difference. First operand has 26 places, 25 transitions, 76 flow. Second operand 7 states and 82 transitions. [2022-12-06 00:00:05,607 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 89 transitions, 434 flow [2022-12-06 00:00:05,609 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 89 transitions, 424 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 00:00:05,610 INFO L231 Difference]: Finished difference. Result has 36 places, 31 transitions, 139 flow [2022-12-06 00:00:05,611 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=139, PETRI_PLACES=36, PETRI_TRANSITIONS=31} [2022-12-06 00:00:05,611 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 7 predicate places. [2022-12-06 00:00:05,611 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:00:05,612 INFO L89 Accepts]: Start accepts. Operand has 36 places, 31 transitions, 139 flow [2022-12-06 00:00:05,614 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:00:05,614 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:00:05,615 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 36 places, 31 transitions, 139 flow [2022-12-06 00:00:05,615 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 35 places, 31 transitions, 139 flow [2022-12-06 00:00:05,623 INFO L130 PetriNetUnfolder]: 27/91 cut-off events. [2022-12-06 00:00:05,623 INFO L131 PetriNetUnfolder]: For 25/51 co-relation queries the response was YES. [2022-12-06 00:00:05,624 INFO L83 FinitePrefix]: Finished finitePrefix Result has 194 conditions, 91 events. 27/91 cut-off events. For 25/51 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 312 event pairs, 1 based on Foata normal form. 3/84 useless extension candidates. Maximal degree in co-relation 158. Up to 34 conditions per place. [2022-12-06 00:00:05,625 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 35 places, 31 transitions, 139 flow [2022-12-06 00:00:05,625 INFO L188 LiptonReduction]: Number of co-enabled transitions 278 [2022-12-06 00:00:05,775 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 00:00:05,776 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 165 [2022-12-06 00:00:05,777 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 27 transitions, 117 flow [2022-12-06 00:00:05,777 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:00:05,777 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:00:05,777 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:00:05,777 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 00:00:05,777 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-06 00:00:05,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:00:05,778 INFO L85 PathProgramCache]: Analyzing trace with hash -941425541, now seen corresponding path program 1 times [2022-12-06 00:00:05,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:00:05,778 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767476859] [2022-12-06 00:00:05,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:00:05,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:00:05,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:00:05,942 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:00:05,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:00:05,942 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767476859] [2022-12-06 00:00:05,946 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1767476859] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 00:00:05,946 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [536080676] [2022-12-06 00:00:05,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:00:05,947 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:00:05,947 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:00:05,962 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 00:00:05,972 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-06 00:00:06,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:00:06,092 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 11 conjunts are in the unsatisfiable core [2022-12-06 00:00:06,096 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 00:00:06,197 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:00:06,197 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 00:00:06,280 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:00:06,286 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [536080676] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-06 00:00:06,287 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-12-06 00:00:06,287 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6, 6] total 7 [2022-12-06 00:00:06,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251179048] [2022-12-06 00:00:06,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:00:06,287 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 00:00:06,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:00:06,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 00:00:06,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-06 00:00:06,288 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 25 [2022-12-06 00:00:06,289 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 27 transitions, 117 flow. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:00:06,289 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:00:06,289 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 25 [2022-12-06 00:00:06,307 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:00:06,608 INFO L130 PetriNetUnfolder]: 665/1029 cut-off events. [2022-12-06 00:00:06,609 INFO L131 PetriNetUnfolder]: For 1397/1405 co-relation queries the response was YES. [2022-12-06 00:00:06,611 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3218 conditions, 1029 events. 665/1029 cut-off events. For 1397/1405 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 4283 event pairs, 149 based on Foata normal form. 7/1023 useless extension candidates. Maximal degree in co-relation 2705. Up to 330 conditions per place. [2022-12-06 00:00:06,616 INFO L137 encePairwiseOnDemand]: 18/25 looper letters, 87 selfloop transitions, 12 changer transitions 0/100 dead transitions. [2022-12-06 00:00:06,616 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 100 transitions, 583 flow [2022-12-06 00:00:06,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 00:00:06,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 00:00:06,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 105 transitions. [2022-12-06 00:00:06,620 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6 [2022-12-06 00:00:06,620 INFO L175 Difference]: Start difference. First operand has 33 places, 27 transitions, 117 flow. Second operand 7 states and 105 transitions. [2022-12-06 00:00:06,620 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 100 transitions, 583 flow [2022-12-06 00:00:06,626 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 100 transitions, 512 flow, removed 34 selfloop flow, removed 4 redundant places. [2022-12-06 00:00:06,628 INFO L231 Difference]: Finished difference. Result has 41 places, 37 transitions, 200 flow [2022-12-06 00:00:06,628 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=200, PETRI_PLACES=41, PETRI_TRANSITIONS=37} [2022-12-06 00:00:06,629 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 12 predicate places. [2022-12-06 00:00:06,630 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:00:06,630 INFO L89 Accepts]: Start accepts. Operand has 41 places, 37 transitions, 200 flow [2022-12-06 00:00:06,631 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:00:06,631 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:00:06,631 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 37 transitions, 200 flow [2022-12-06 00:00:06,632 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 37 transitions, 200 flow [2022-12-06 00:00:06,646 INFO L130 PetriNetUnfolder]: 30/111 cut-off events. [2022-12-06 00:00:06,647 INFO L131 PetriNetUnfolder]: For 78/89 co-relation queries the response was YES. [2022-12-06 00:00:06,647 INFO L83 FinitePrefix]: Finished finitePrefix Result has 276 conditions, 111 events. 30/111 cut-off events. For 78/89 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 435 event pairs, 0 based on Foata normal form. 3/99 useless extension candidates. Maximal degree in co-relation 205. Up to 44 conditions per place. [2022-12-06 00:00:06,648 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 37 transitions, 200 flow [2022-12-06 00:00:06,648 INFO L188 LiptonReduction]: Number of co-enabled transitions 318 [2022-12-06 00:00:06,660 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [251] $Ultimate##0-->L57-5: Formula: (= v_thread3Thread1of1ForFork0_~i~2_1 0) InVars {} OutVars{thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_1} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_~i~2] and [348] $Ultimate##0-->L41-5: Formula: (and (= v_~x_1~0_47 (+ v_~c~0_62 v_~x_1~0_48)) (= v_thread1Thread1of1ForFork1_~i~0_31 1) (< (mod (+ v_thread1Thread1of1ForFork1_~i~0_31 4294967295) 4294967296) (mod v_~a~0_55 4294967296))) InVars {~a~0=v_~a~0_55, ~c~0=v_~c~0_62, ~x_1~0=v_~x_1~0_48} OutVars{~a~0=v_~a~0_55, ~c~0=v_~c~0_62, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_21|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_31, ~x_1~0=v_~x_1~0_47} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_~i~0, ~x_1~0] [2022-12-06 00:00:06,757 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 00:00:06,758 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 128 [2022-12-06 00:00:06,758 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 35 transitions, 192 flow [2022-12-06 00:00:06,759 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:00:06,759 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:00:06,759 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:00:06,768 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-06 00:00:06,964 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:00:06,965 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-06 00:00:06,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:00:06,965 INFO L85 PathProgramCache]: Analyzing trace with hash -1870699834, now seen corresponding path program 1 times [2022-12-06 00:00:06,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:00:06,966 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396648250] [2022-12-06 00:00:06,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:00:06,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:00:07,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:00:07,244 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:00:07,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:00:07,244 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396648250] [2022-12-06 00:00:07,244 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [396648250] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:00:07,244 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:00:07,245 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 00:00:07,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734361422] [2022-12-06 00:00:07,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:00:07,245 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 00:00:07,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:00:07,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 00:00:07,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 00:00:07,246 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 28 [2022-12-06 00:00:07,246 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 35 transitions, 192 flow. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:00:07,246 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:00:07,247 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 28 [2022-12-06 00:00:07,247 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:00:07,999 INFO L130 PetriNetUnfolder]: 719/1153 cut-off events. [2022-12-06 00:00:08,000 INFO L131 PetriNetUnfolder]: For 2152/2152 co-relation queries the response was YES. [2022-12-06 00:00:08,003 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3879 conditions, 1153 events. 719/1153 cut-off events. For 2152/2152 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 5177 event pairs, 123 based on Foata normal form. 28/1164 useless extension candidates. Maximal degree in co-relation 2464. Up to 369 conditions per place. [2022-12-06 00:00:08,009 INFO L137 encePairwiseOnDemand]: 21/28 looper letters, 86 selfloop transitions, 13 changer transitions 4/104 dead transitions. [2022-12-06 00:00:08,009 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 104 transitions, 671 flow [2022-12-06 00:00:08,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 00:00:08,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 00:00:08,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 106 transitions. [2022-12-06 00:00:08,011 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5408163265306123 [2022-12-06 00:00:08,011 INFO L175 Difference]: Start difference. First operand has 40 places, 35 transitions, 192 flow. Second operand 7 states and 106 transitions. [2022-12-06 00:00:08,011 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 104 transitions, 671 flow [2022-12-06 00:00:08,020 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 104 transitions, 643 flow, removed 14 selfloop flow, removed 1 redundant places. [2022-12-06 00:00:08,022 INFO L231 Difference]: Finished difference. Result has 48 places, 45 transitions, 313 flow [2022-12-06 00:00:08,022 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=182, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=313, PETRI_PLACES=48, PETRI_TRANSITIONS=45} [2022-12-06 00:00:08,023 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 19 predicate places. [2022-12-06 00:00:08,023 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:00:08,023 INFO L89 Accepts]: Start accepts. Operand has 48 places, 45 transitions, 313 flow [2022-12-06 00:00:08,024 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:00:08,024 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:00:08,024 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 48 places, 45 transitions, 313 flow [2022-12-06 00:00:08,025 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 48 places, 45 transitions, 313 flow [2022-12-06 00:00:08,038 INFO L130 PetriNetUnfolder]: 37/160 cut-off events. [2022-12-06 00:00:08,038 INFO L131 PetriNetUnfolder]: For 265/271 co-relation queries the response was YES. [2022-12-06 00:00:08,039 INFO L83 FinitePrefix]: Finished finitePrefix Result has 422 conditions, 160 events. 37/160 cut-off events. For 265/271 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 800 event pairs, 0 based on Foata normal form. 3/152 useless extension candidates. Maximal degree in co-relation 319. Up to 56 conditions per place. [2022-12-06 00:00:08,040 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 48 places, 45 transitions, 313 flow [2022-12-06 00:00:08,040 INFO L188 LiptonReduction]: Number of co-enabled transitions 360 [2022-12-06 00:00:08,046 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [330] L49-5-->L49-5: Formula: (and (< (mod v_thread2Thread1of1ForFork2_~i~1_24 4294967296) (mod v_~b~0_37 4294967296)) (= (+ v_~c~0_54 v_~x_2~0_38) v_~x_2~0_37) (= (+ v_thread2Thread1of1ForFork2_~i~1_24 1) v_thread2Thread1of1ForFork2_~i~1_23)) InVars {thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_24, ~c~0=v_~c~0_54, ~b~0=v_~b~0_37, ~x_2~0=v_~x_2~0_38} OutVars{thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_23, thread2Thread1of1ForFork2_#t~post2=|v_thread2Thread1of1ForFork2_#t~post2_17|, ~c~0=v_~c~0_54, ~b~0=v_~b~0_37, ~x_2~0=v_~x_2~0_37} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_~i~1, thread2Thread1of1ForFork2_#t~post2, ~x_2~0] and [346] $Ultimate##0-->thread1EXIT: Formula: (and (= v_thread1Thread1of1ForFork1_~i~0_25 0) (= |v_thread1Thread1of1ForFork1_#res.base_11| 0) (= |v_thread1Thread1of1ForFork1_#res.offset_11| 0) (not (< (mod v_thread1Thread1of1ForFork1_~i~0_25 4294967296) (mod v_~a~0_51 4294967296)))) InVars {~a~0=v_~a~0_51} OutVars{~a~0=v_~a~0_51, thread1Thread1of1ForFork1_#res.base=|v_thread1Thread1of1ForFork1_#res.base_11|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_25, thread1Thread1of1ForFork1_#res.offset=|v_thread1Thread1of1ForFork1_#res.offset_11|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#res.base, thread1Thread1of1ForFork1_~i~0, thread1Thread1of1ForFork1_#res.offset] [2022-12-06 00:00:08,130 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 00:00:08,131 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 108 [2022-12-06 00:00:08,131 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 45 transitions, 325 flow [2022-12-06 00:00:08,131 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:00:08,131 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:00:08,132 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:00:08,132 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 00:00:08,132 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-06 00:00:08,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:00:08,132 INFO L85 PathProgramCache]: Analyzing trace with hash -678848004, now seen corresponding path program 2 times [2022-12-06 00:00:08,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:00:08,133 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600267486] [2022-12-06 00:00:08,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:00:08,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:00:08,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:00:08,265 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:00:08,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:00:08,265 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600267486] [2022-12-06 00:00:08,266 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [600267486] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 00:00:08,266 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [870741151] [2022-12-06 00:00:08,266 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 00:00:08,266 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:00:08,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:00:08,268 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 00:00:08,270 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-06 00:00:08,391 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 00:00:08,392 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 00:00:08,394 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 9 conjunts are in the unsatisfiable core [2022-12-06 00:00:08,395 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 00:00:08,455 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:00:08,455 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 00:00:08,513 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:00:08,516 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [870741151] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-06 00:00:08,517 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-12-06 00:00:08,517 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 5] total 6 [2022-12-06 00:00:08,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501862593] [2022-12-06 00:00:08,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:00:08,518 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:00:08,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:00:08,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:00:08,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-06 00:00:08,519 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 30 [2022-12-06 00:00:08,519 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 45 transitions, 325 flow. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:00:08,519 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:00:08,519 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 30 [2022-12-06 00:00:08,519 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:00:08,741 INFO L130 PetriNetUnfolder]: 766/1222 cut-off events. [2022-12-06 00:00:08,741 INFO L131 PetriNetUnfolder]: For 4013/4119 co-relation queries the response was YES. [2022-12-06 00:00:08,744 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4519 conditions, 1222 events. 766/1222 cut-off events. For 4013/4119 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 5642 event pairs, 140 based on Foata normal form. 34/1224 useless extension candidates. Maximal degree in co-relation 2975. Up to 712 conditions per place. [2022-12-06 00:00:08,750 INFO L137 encePairwiseOnDemand]: 23/30 looper letters, 56 selfloop transitions, 11 changer transitions 2/73 dead transitions. [2022-12-06 00:00:08,751 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 73 transitions, 561 flow [2022-12-06 00:00:08,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:00:08,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:00:08,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:00:08,754 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.575 [2022-12-06 00:00:08,754 INFO L175 Difference]: Start difference. First operand has 49 places, 45 transitions, 325 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:00:08,754 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 73 transitions, 561 flow [2022-12-06 00:00:08,764 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 73 transitions, 547 flow, removed 7 selfloop flow, removed 0 redundant places. [2022-12-06 00:00:08,767 INFO L231 Difference]: Finished difference. Result has 53 places, 46 transitions, 356 flow [2022-12-06 00:00:08,767 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=311, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=356, PETRI_PLACES=53, PETRI_TRANSITIONS=46} [2022-12-06 00:00:08,769 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 24 predicate places. [2022-12-06 00:00:08,769 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:00:08,769 INFO L89 Accepts]: Start accepts. Operand has 53 places, 46 transitions, 356 flow [2022-12-06 00:00:08,770 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:00:08,770 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:00:08,770 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 53 places, 46 transitions, 356 flow [2022-12-06 00:00:08,771 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 52 places, 46 transitions, 356 flow [2022-12-06 00:00:08,785 INFO L130 PetriNetUnfolder]: 42/161 cut-off events. [2022-12-06 00:00:08,786 INFO L131 PetriNetUnfolder]: For 460/476 co-relation queries the response was YES. [2022-12-06 00:00:08,786 INFO L83 FinitePrefix]: Finished finitePrefix Result has 475 conditions, 161 events. 42/161 cut-off events. For 460/476 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 766 event pairs, 0 based on Foata normal form. 5/153 useless extension candidates. Maximal degree in co-relation 377. Up to 65 conditions per place. [2022-12-06 00:00:08,788 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 52 places, 46 transitions, 356 flow [2022-12-06 00:00:08,788 INFO L188 LiptonReduction]: Number of co-enabled transitions 362 [2022-12-06 00:00:08,791 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:00:08,792 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 23 [2022-12-06 00:00:08,792 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 46 transitions, 356 flow [2022-12-06 00:00:08,792 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:00:08,792 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:00:08,793 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:00:08,801 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-12-06 00:00:08,999 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:00:08,999 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-06 00:00:09,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:00:09,000 INFO L85 PathProgramCache]: Analyzing trace with hash 670880502, now seen corresponding path program 1 times [2022-12-06 00:00:09,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:00:09,000 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854431387] [2022-12-06 00:00:09,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:00:09,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:00:09,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:00:09,379 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-06 00:00:09,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:00:09,379 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854431387] [2022-12-06 00:00:09,379 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [854431387] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:00:09,379 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:00:09,380 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 00:00:09,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482908208] [2022-12-06 00:00:09,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:00:09,380 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 00:00:09,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:00:09,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 00:00:09,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 00:00:09,381 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 29 [2022-12-06 00:00:09,381 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 46 transitions, 356 flow. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:00:09,381 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:00:09,382 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 29 [2022-12-06 00:00:09,382 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:00:09,848 INFO L130 PetriNetUnfolder]: 841/1382 cut-off events. [2022-12-06 00:00:09,848 INFO L131 PetriNetUnfolder]: For 5643/5721 co-relation queries the response was YES. [2022-12-06 00:00:09,850 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5126 conditions, 1382 events. 841/1382 cut-off events. For 5643/5721 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 6563 event pairs, 236 based on Foata normal form. 47/1413 useless extension candidates. Maximal degree in co-relation 3223. Up to 741 conditions per place. [2022-12-06 00:00:09,857 INFO L137 encePairwiseOnDemand]: 21/29 looper letters, 78 selfloop transitions, 13 changer transitions 7/101 dead transitions. [2022-12-06 00:00:09,857 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 101 transitions, 794 flow [2022-12-06 00:00:09,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 00:00:09,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 00:00:09,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 90 transitions. [2022-12-06 00:00:09,859 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5172413793103449 [2022-12-06 00:00:09,859 INFO L175 Difference]: Start difference. First operand has 52 places, 46 transitions, 356 flow. Second operand 6 states and 90 transitions. [2022-12-06 00:00:09,859 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 101 transitions, 794 flow [2022-12-06 00:00:09,875 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 101 transitions, 749 flow, removed 17 selfloop flow, removed 2 redundant places. [2022-12-06 00:00:09,877 INFO L231 Difference]: Finished difference. Result has 57 places, 47 transitions, 374 flow [2022-12-06 00:00:09,877 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=327, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=374, PETRI_PLACES=57, PETRI_TRANSITIONS=47} [2022-12-06 00:00:09,877 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 28 predicate places. [2022-12-06 00:00:09,877 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:00:09,878 INFO L89 Accepts]: Start accepts. Operand has 57 places, 47 transitions, 374 flow [2022-12-06 00:00:09,879 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:00:09,879 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:00:09,879 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 57 places, 47 transitions, 374 flow [2022-12-06 00:00:09,880 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 57 places, 47 transitions, 374 flow [2022-12-06 00:00:09,894 INFO L130 PetriNetUnfolder]: 43/193 cut-off events. [2022-12-06 00:00:09,894 INFO L131 PetriNetUnfolder]: For 495/511 co-relation queries the response was YES. [2022-12-06 00:00:09,894 INFO L83 FinitePrefix]: Finished finitePrefix Result has 555 conditions, 193 events. 43/193 cut-off events. For 495/511 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1050 event pairs, 0 based on Foata normal form. 6/186 useless extension candidates. Maximal degree in co-relation 428. Up to 71 conditions per place. [2022-12-06 00:00:09,896 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 57 places, 47 transitions, 374 flow [2022-12-06 00:00:09,896 INFO L188 LiptonReduction]: Number of co-enabled transitions 360 [2022-12-06 00:00:09,996 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:00:09,997 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 120 [2022-12-06 00:00:09,998 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 47 transitions, 378 flow [2022-12-06 00:00:09,998 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:00:09,998 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:00:09,998 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:00:09,998 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 00:00:09,998 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-06 00:00:09,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:00:09,999 INFO L85 PathProgramCache]: Analyzing trace with hash -721536866, now seen corresponding path program 2 times [2022-12-06 00:00:09,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:00:09,999 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272949035] [2022-12-06 00:00:09,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:00:09,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:00:10,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:00:10,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-06 00:00:10,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:00:10,208 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272949035] [2022-12-06 00:00:10,208 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1272949035] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:00:10,208 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:00:10,208 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 00:00:10,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800976848] [2022-12-06 00:00:10,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:00:10,209 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 00:00:10,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:00:10,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 00:00:10,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-06 00:00:10,209 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 31 [2022-12-06 00:00:10,210 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 47 transitions, 378 flow. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:00:10,210 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:00:10,210 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 31 [2022-12-06 00:00:10,210 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:00:10,542 INFO L130 PetriNetUnfolder]: 757/1225 cut-off events. [2022-12-06 00:00:10,542 INFO L131 PetriNetUnfolder]: For 5342/5381 co-relation queries the response was YES. [2022-12-06 00:00:10,545 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4844 conditions, 1225 events. 757/1225 cut-off events. For 5342/5381 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 5588 event pairs, 212 based on Foata normal form. 30/1241 useless extension candidates. Maximal degree in co-relation 3358. Up to 651 conditions per place. [2022-12-06 00:00:10,551 INFO L137 encePairwiseOnDemand]: 24/31 looper letters, 83 selfloop transitions, 10 changer transitions 3/99 dead transitions. [2022-12-06 00:00:10,552 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 99 transitions, 800 flow [2022-12-06 00:00:10,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 00:00:10,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 00:00:10,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 90 transitions. [2022-12-06 00:00:10,554 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4838709677419355 [2022-12-06 00:00:10,554 INFO L175 Difference]: Start difference. First operand has 57 places, 47 transitions, 378 flow. Second operand 6 states and 90 transitions. [2022-12-06 00:00:10,554 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 99 transitions, 800 flow [2022-12-06 00:00:10,561 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 99 transitions, 775 flow, removed 6 selfloop flow, removed 2 redundant places. [2022-12-06 00:00:10,562 INFO L231 Difference]: Finished difference. Result has 63 places, 49 transitions, 417 flow [2022-12-06 00:00:10,563 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=355, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=417, PETRI_PLACES=63, PETRI_TRANSITIONS=49} [2022-12-06 00:00:10,564 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 34 predicate places. [2022-12-06 00:00:10,564 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:00:10,564 INFO L89 Accepts]: Start accepts. Operand has 63 places, 49 transitions, 417 flow [2022-12-06 00:00:10,567 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:00:10,567 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:00:10,567 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 63 places, 49 transitions, 417 flow [2022-12-06 00:00:10,568 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 63 places, 49 transitions, 417 flow [2022-12-06 00:00:10,582 INFO L130 PetriNetUnfolder]: 37/167 cut-off events. [2022-12-06 00:00:10,583 INFO L131 PetriNetUnfolder]: For 489/506 co-relation queries the response was YES. [2022-12-06 00:00:10,583 INFO L83 FinitePrefix]: Finished finitePrefix Result has 509 conditions, 167 events. 37/167 cut-off events. For 489/506 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 831 event pairs, 0 based on Foata normal form. 7/166 useless extension candidates. Maximal degree in co-relation 400. Up to 61 conditions per place. [2022-12-06 00:00:10,585 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 63 places, 49 transitions, 417 flow [2022-12-06 00:00:10,585 INFO L188 LiptonReduction]: Number of co-enabled transitions 370 [2022-12-06 00:00:10,590 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [342] L49-5-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork2_#res.offset_Out_4| 0) (not (< (mod v_thread2Thread1of1ForFork2_~i~1_In_3 4294967296) (mod v_~b~0_In_1 4294967296))) (= |v_thread2Thread1of1ForFork2_#res.base_Out_4| 0)) InVars {~b~0=v_~b~0_In_1, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_In_3} OutVars{thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_In_3, thread2Thread1of1ForFork2_#res.base=|v_thread2Thread1of1ForFork2_#res.base_Out_4|, ~b~0=v_~b~0_In_1, thread2Thread1of1ForFork2_#res.offset=|v_thread2Thread1of1ForFork2_#res.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res.base, thread2Thread1of1ForFork2_#res.offset] and [346] $Ultimate##0-->thread1EXIT: Formula: (and (= v_thread1Thread1of1ForFork1_~i~0_25 0) (= |v_thread1Thread1of1ForFork1_#res.base_11| 0) (= |v_thread1Thread1of1ForFork1_#res.offset_11| 0) (not (< (mod v_thread1Thread1of1ForFork1_~i~0_25 4294967296) (mod v_~a~0_51 4294967296)))) InVars {~a~0=v_~a~0_51} OutVars{~a~0=v_~a~0_51, thread1Thread1of1ForFork1_#res.base=|v_thread1Thread1of1ForFork1_#res.base_11|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_25, thread1Thread1of1ForFork1_#res.offset=|v_thread1Thread1of1ForFork1_#res.offset_11|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#res.base, thread1Thread1of1ForFork1_~i~0, thread1Thread1of1ForFork1_#res.offset] [2022-12-06 00:00:10,665 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [342] L49-5-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork2_#res.offset_Out_4| 0) (not (< (mod v_thread2Thread1of1ForFork2_~i~1_In_3 4294967296) (mod v_~b~0_In_1 4294967296))) (= |v_thread2Thread1of1ForFork2_#res.base_Out_4| 0)) InVars {~b~0=v_~b~0_In_1, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_In_3} OutVars{thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_In_3, thread2Thread1of1ForFork2_#res.base=|v_thread2Thread1of1ForFork2_#res.base_Out_4|, ~b~0=v_~b~0_In_1, thread2Thread1of1ForFork2_#res.offset=|v_thread2Thread1of1ForFork2_#res.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res.base, thread2Thread1of1ForFork2_#res.offset] and [346] $Ultimate##0-->thread1EXIT: Formula: (and (= v_thread1Thread1of1ForFork1_~i~0_25 0) (= |v_thread1Thread1of1ForFork1_#res.base_11| 0) (= |v_thread1Thread1of1ForFork1_#res.offset_11| 0) (not (< (mod v_thread1Thread1of1ForFork1_~i~0_25 4294967296) (mod v_~a~0_51 4294967296)))) InVars {~a~0=v_~a~0_51} OutVars{~a~0=v_~a~0_51, thread1Thread1of1ForFork1_#res.base=|v_thread1Thread1of1ForFork1_#res.base_11|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_25, thread1Thread1of1ForFork1_#res.offset=|v_thread1Thread1of1ForFork1_#res.offset_11|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#res.base, thread1Thread1of1ForFork1_~i~0, thread1Thread1of1ForFork1_#res.offset] [2022-12-06 00:00:10,740 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [241] $Ultimate##0-->L49-5: Formula: (= v_thread2Thread1of1ForFork2_~i~1_1 0) InVars {} OutVars{thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_1} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_~i~1] and [346] $Ultimate##0-->thread1EXIT: Formula: (and (= v_thread1Thread1of1ForFork1_~i~0_25 0) (= |v_thread1Thread1of1ForFork1_#res.base_11| 0) (= |v_thread1Thread1of1ForFork1_#res.offset_11| 0) (not (< (mod v_thread1Thread1of1ForFork1_~i~0_25 4294967296) (mod v_~a~0_51 4294967296)))) InVars {~a~0=v_~a~0_51} OutVars{~a~0=v_~a~0_51, thread1Thread1of1ForFork1_#res.base=|v_thread1Thread1of1ForFork1_#res.base_11|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_25, thread1Thread1of1ForFork1_#res.offset=|v_thread1Thread1of1ForFork1_#res.offset_11|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#res.base, thread1Thread1of1ForFork1_~i~0, thread1Thread1of1ForFork1_#res.offset] [2022-12-06 00:00:10,880 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [241] $Ultimate##0-->L49-5: Formula: (= v_thread2Thread1of1ForFork2_~i~1_1 0) InVars {} OutVars{thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_1} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_~i~1] and [346] $Ultimate##0-->thread1EXIT: Formula: (and (= v_thread1Thread1of1ForFork1_~i~0_25 0) (= |v_thread1Thread1of1ForFork1_#res.base_11| 0) (= |v_thread1Thread1of1ForFork1_#res.offset_11| 0) (not (< (mod v_thread1Thread1of1ForFork1_~i~0_25 4294967296) (mod v_~a~0_51 4294967296)))) InVars {~a~0=v_~a~0_51} OutVars{~a~0=v_~a~0_51, thread1Thread1of1ForFork1_#res.base=|v_thread1Thread1of1ForFork1_#res.base_11|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_25, thread1Thread1of1ForFork1_#res.offset=|v_thread1Thread1of1ForFork1_#res.offset_11|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#res.base, thread1Thread1of1ForFork1_~i~0, thread1Thread1of1ForFork1_#res.offset] [2022-12-06 00:00:10,935 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 00:00:10,936 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 372 [2022-12-06 00:00:10,936 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 50 transitions, 453 flow [2022-12-06 00:00:10,936 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:00:10,937 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:00:10,937 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:00:10,937 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 00:00:10,937 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-06 00:00:10,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:00:10,937 INFO L85 PathProgramCache]: Analyzing trace with hash -1878822181, now seen corresponding path program 1 times [2022-12-06 00:00:10,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:00:10,938 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859395078] [2022-12-06 00:00:10,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:00:10,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:00:10,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:00:11,153 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-06 00:00:11,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:00:11,153 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859395078] [2022-12-06 00:00:11,157 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [859395078] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:00:11,158 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:00:11,158 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 00:00:11,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009931350] [2022-12-06 00:00:11,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:00:11,158 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 00:00:11,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:00:11,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 00:00:11,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-06 00:00:11,159 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 35 [2022-12-06 00:00:11,159 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 50 transitions, 453 flow. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:00:11,160 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:00:11,160 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 35 [2022-12-06 00:00:11,160 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:00:11,687 INFO L130 PetriNetUnfolder]: 1088/1733 cut-off events. [2022-12-06 00:00:11,687 INFO L131 PetriNetUnfolder]: For 6471/6471 co-relation queries the response was YES. [2022-12-06 00:00:11,691 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6962 conditions, 1733 events. 1088/1733 cut-off events. For 6471/6471 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 8121 event pairs, 444 based on Foata normal form. 6/1739 useless extension candidates. Maximal degree in co-relation 6306. Up to 1252 conditions per place. [2022-12-06 00:00:11,703 INFO L137 encePairwiseOnDemand]: 26/35 looper letters, 90 selfloop transitions, 8 changer transitions 0/98 dead transitions. [2022-12-06 00:00:11,703 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 98 transitions, 860 flow [2022-12-06 00:00:11,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 00:00:11,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 00:00:11,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 82 transitions. [2022-12-06 00:00:11,704 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3904761904761905 [2022-12-06 00:00:11,705 INFO L175 Difference]: Start difference. First operand has 63 places, 50 transitions, 453 flow. Second operand 6 states and 82 transitions. [2022-12-06 00:00:11,705 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 98 transitions, 860 flow [2022-12-06 00:00:11,714 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 98 transitions, 824 flow, removed 11 selfloop flow, removed 2 redundant places. [2022-12-06 00:00:11,717 INFO L231 Difference]: Finished difference. Result has 70 places, 54 transitions, 465 flow [2022-12-06 00:00:11,717 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=395, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=465, PETRI_PLACES=70, PETRI_TRANSITIONS=54} [2022-12-06 00:00:11,719 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 41 predicate places. [2022-12-06 00:00:11,719 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:00:11,719 INFO L89 Accepts]: Start accepts. Operand has 70 places, 54 transitions, 465 flow [2022-12-06 00:00:11,722 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:00:11,722 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:00:11,722 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 70 places, 54 transitions, 465 flow [2022-12-06 00:00:11,723 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 70 places, 54 transitions, 465 flow [2022-12-06 00:00:11,744 INFO L130 PetriNetUnfolder]: 55/242 cut-off events. [2022-12-06 00:00:11,744 INFO L131 PetriNetUnfolder]: For 631/671 co-relation queries the response was YES. [2022-12-06 00:00:11,745 INFO L83 FinitePrefix]: Finished finitePrefix Result has 763 conditions, 242 events. 55/242 cut-off events. For 631/671 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1453 event pairs, 2 based on Foata normal form. 8/232 useless extension candidates. Maximal degree in co-relation 694. Up to 93 conditions per place. [2022-12-06 00:00:11,747 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 70 places, 54 transitions, 465 flow [2022-12-06 00:00:11,747 INFO L188 LiptonReduction]: Number of co-enabled transitions 428 [2022-12-06 00:00:11,753 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [342] L49-5-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork2_#res.offset_Out_4| 0) (not (< (mod v_thread2Thread1of1ForFork2_~i~1_In_3 4294967296) (mod v_~b~0_In_1 4294967296))) (= |v_thread2Thread1of1ForFork2_#res.base_Out_4| 0)) InVars {~b~0=v_~b~0_In_1, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_In_3} OutVars{thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_In_3, thread2Thread1of1ForFork2_#res.base=|v_thread2Thread1of1ForFork2_#res.base_Out_4|, ~b~0=v_~b~0_In_1, thread2Thread1of1ForFork2_#res.offset=|v_thread2Thread1of1ForFork2_#res.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res.base, thread2Thread1of1ForFork2_#res.offset] and [350] $Ultimate##0-->L41-5: Formula: (and (= v_~x_1~0_51 (+ v_~c~0_64 v_~x_1~0_52)) (= v_thread3Thread1of1ForFork0_~i~2_30 0) (< (mod (+ v_thread1Thread1of1ForFork1_~i~0_36 4294967295) 4294967296) (mod v_~a~0_57 4294967296)) (= v_thread1Thread1of1ForFork1_~i~0_36 1)) InVars {~a~0=v_~a~0_57, ~c~0=v_~c~0_64, ~x_1~0=v_~x_1~0_52} OutVars{~a~0=v_~a~0_57, ~c~0=v_~c~0_64, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_23|, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_30, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_36, ~x_1~0=v_~x_1~0_51} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, thread3Thread1of1ForFork0_~i~2, thread1Thread1of1ForFork1_~i~0, ~x_1~0] [2022-12-06 00:00:11,824 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:00:11,824 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 105 [2022-12-06 00:00:11,824 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 53 transitions, 465 flow [2022-12-06 00:00:11,825 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:00:11,825 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:00:11,825 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:00:11,825 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-06 00:00:11,825 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-06 00:00:11,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:00:11,826 INFO L85 PathProgramCache]: Analyzing trace with hash 1808995553, now seen corresponding path program 1 times [2022-12-06 00:00:11,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:00:11,826 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583673226] [2022-12-06 00:00:11,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:00:11,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:00:11,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:00:11,973 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-06 00:00:11,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:00:11,974 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583673226] [2022-12-06 00:00:11,974 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [583673226] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:00:11,974 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:00:11,974 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:00:11,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135377878] [2022-12-06 00:00:11,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:00:11,975 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:00:11,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:00:11,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:00:11,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:00:11,976 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 35 [2022-12-06 00:00:11,976 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 53 transitions, 465 flow. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:00:11,976 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:00:11,976 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 35 [2022-12-06 00:00:11,976 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:00:12,300 INFO L130 PetriNetUnfolder]: 1098/1751 cut-off events. [2022-12-06 00:00:12,300 INFO L131 PetriNetUnfolder]: For 7828/7828 co-relation queries the response was YES. [2022-12-06 00:00:12,306 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7827 conditions, 1751 events. 1098/1751 cut-off events. For 7828/7828 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 8186 event pairs, 570 based on Foata normal form. 8/1759 useless extension candidates. Maximal degree in co-relation 7471. Up to 1478 conditions per place. [2022-12-06 00:00:12,319 INFO L137 encePairwiseOnDemand]: 28/35 looper letters, 59 selfloop transitions, 11 changer transitions 0/70 dead transitions. [2022-12-06 00:00:12,319 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 70 transitions, 687 flow [2022-12-06 00:00:12,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:00:12,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:00:12,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 56 transitions. [2022-12-06 00:00:12,324 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4 [2022-12-06 00:00:12,324 INFO L175 Difference]: Start difference. First operand has 70 places, 53 transitions, 465 flow. Second operand 4 states and 56 transitions. [2022-12-06 00:00:12,324 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 70 transitions, 687 flow [2022-12-06 00:00:12,337 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 70 transitions, 669 flow, removed 7 selfloop flow, removed 1 redundant places. [2022-12-06 00:00:12,338 INFO L231 Difference]: Finished difference. Result has 73 places, 55 transitions, 503 flow [2022-12-06 00:00:12,339 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=447, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=503, PETRI_PLACES=73, PETRI_TRANSITIONS=55} [2022-12-06 00:00:12,339 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 44 predicate places. [2022-12-06 00:00:12,339 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:00:12,339 INFO L89 Accepts]: Start accepts. Operand has 73 places, 55 transitions, 503 flow [2022-12-06 00:00:12,340 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:00:12,340 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:00:12,340 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 73 places, 55 transitions, 503 flow [2022-12-06 00:00:12,341 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 73 places, 55 transitions, 503 flow [2022-12-06 00:00:12,359 INFO L130 PetriNetUnfolder]: 55/244 cut-off events. [2022-12-06 00:00:12,359 INFO L131 PetriNetUnfolder]: For 795/868 co-relation queries the response was YES. [2022-12-06 00:00:12,360 INFO L83 FinitePrefix]: Finished finitePrefix Result has 774 conditions, 244 events. 55/244 cut-off events. For 795/868 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1466 event pairs, 2 based on Foata normal form. 8/232 useless extension candidates. Maximal degree in co-relation 700. Up to 94 conditions per place. [2022-12-06 00:00:12,362 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 73 places, 55 transitions, 503 flow [2022-12-06 00:00:12,362 INFO L188 LiptonReduction]: Number of co-enabled transitions 438 [2022-12-06 00:00:12,414 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [354] $Ultimate##0-->L57-5: Formula: (and (< (mod (+ 4294967295 v_thread3Thread1of1ForFork0_~i~2_38) 4294967296) (mod (+ v_~a~0_65 v_~b~0_53) 4294967296)) (= v_thread3Thread1of1ForFork0_~i~2_38 1) (= v_~x_3~0_49 (+ v_~c~0_70 v_~x_3~0_50))) InVars {~a~0=v_~a~0_65, ~c~0=v_~c~0_70, ~b~0=v_~b~0_53, ~x_3~0=v_~x_3~0_50} OutVars{~a~0=v_~a~0_65, ~c~0=v_~c~0_70, ~b~0=v_~b~0_53, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_38, ~x_3~0=v_~x_3~0_49, thread3Thread1of1ForFork0_#t~post3=|v_thread3Thread1of1ForFork0_#t~post3_19|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_~i~2, ~x_3~0, thread3Thread1of1ForFork0_#t~post3] and [330] L49-5-->L49-5: Formula: (and (< (mod v_thread2Thread1of1ForFork2_~i~1_24 4294967296) (mod v_~b~0_37 4294967296)) (= (+ v_~c~0_54 v_~x_2~0_38) v_~x_2~0_37) (= (+ v_thread2Thread1of1ForFork2_~i~1_24 1) v_thread2Thread1of1ForFork2_~i~1_23)) InVars {thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_24, ~c~0=v_~c~0_54, ~b~0=v_~b~0_37, ~x_2~0=v_~x_2~0_38} OutVars{thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_23, thread2Thread1of1ForFork2_#t~post2=|v_thread2Thread1of1ForFork2_#t~post2_17|, ~c~0=v_~c~0_54, ~b~0=v_~b~0_37, ~x_2~0=v_~x_2~0_37} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_~i~1, thread2Thread1of1ForFork2_#t~post2, ~x_2~0] [2022-12-06 00:00:12,456 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:00:12,457 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 118 [2022-12-06 00:00:12,457 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 54 transitions, 500 flow [2022-12-06 00:00:12,458 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:00:12,458 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:00:12,458 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:00:12,458 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-06 00:00:12,458 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-06 00:00:12,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:00:12,459 INFO L85 PathProgramCache]: Analyzing trace with hash 279195164, now seen corresponding path program 1 times [2022-12-06 00:00:12,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:00:12,459 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011237541] [2022-12-06 00:00:12,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:00:12,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:00:12,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:00:12,633 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-06 00:00:12,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:00:12,633 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011237541] [2022-12-06 00:00:12,633 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2011237541] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:00:12,633 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:00:12,633 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 00:00:12,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690141464] [2022-12-06 00:00:12,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:00:12,634 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 00:00:12,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:00:12,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 00:00:12,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-06 00:00:12,635 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 36 [2022-12-06 00:00:12,636 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 54 transitions, 500 flow. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:00:12,636 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:00:12,636 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 36 [2022-12-06 00:00:12,636 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:00:13,720 INFO L130 PetriNetUnfolder]: 1087/1724 cut-off events. [2022-12-06 00:00:13,720 INFO L131 PetriNetUnfolder]: For 8007/8007 co-relation queries the response was YES. [2022-12-06 00:00:13,725 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7531 conditions, 1724 events. 1087/1724 cut-off events. For 8007/8007 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 7974 event pairs, 482 based on Foata normal form. 2/1726 useless extension candidates. Maximal degree in co-relation 7150. Up to 1256 conditions per place. [2022-12-06 00:00:13,742 INFO L137 encePairwiseOnDemand]: 29/36 looper letters, 68 selfloop transitions, 4 changer transitions 9/81 dead transitions. [2022-12-06 00:00:13,743 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 81 transitions, 792 flow [2022-12-06 00:00:13,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 00:00:13,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 00:00:13,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 66 transitions. [2022-12-06 00:00:13,744 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-06 00:00:13,745 INFO L175 Difference]: Start difference. First operand has 72 places, 54 transitions, 500 flow. Second operand 5 states and 66 transitions. [2022-12-06 00:00:13,745 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 81 transitions, 792 flow [2022-12-06 00:00:13,757 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 81 transitions, 765 flow, removed 9 selfloop flow, removed 2 redundant places. [2022-12-06 00:00:13,761 INFO L231 Difference]: Finished difference. Result has 75 places, 52 transitions, 461 flow [2022-12-06 00:00:13,762 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=475, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=461, PETRI_PLACES=75, PETRI_TRANSITIONS=52} [2022-12-06 00:00:13,762 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 46 predicate places. [2022-12-06 00:00:13,762 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:00:13,762 INFO L89 Accepts]: Start accepts. Operand has 75 places, 52 transitions, 461 flow [2022-12-06 00:00:13,764 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:00:13,764 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:00:13,764 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 75 places, 52 transitions, 461 flow [2022-12-06 00:00:13,765 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 71 places, 52 transitions, 461 flow [2022-12-06 00:00:13,782 INFO L130 PetriNetUnfolder]: 55/229 cut-off events. [2022-12-06 00:00:13,782 INFO L131 PetriNetUnfolder]: For 681/720 co-relation queries the response was YES. [2022-12-06 00:00:13,783 INFO L83 FinitePrefix]: Finished finitePrefix Result has 731 conditions, 229 events. 55/229 cut-off events. For 681/720 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1316 event pairs, 2 based on Foata normal form. 8/220 useless extension candidates. Maximal degree in co-relation 659. Up to 91 conditions per place. [2022-12-06 00:00:13,784 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 71 places, 52 transitions, 461 flow [2022-12-06 00:00:13,785 INFO L188 LiptonReduction]: Number of co-enabled transitions 426 [2022-12-06 00:00:13,785 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:00:13,786 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 24 [2022-12-06 00:00:13,786 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 52 transitions, 461 flow [2022-12-06 00:00:13,787 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:00:13,787 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:00:13,787 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:00:13,787 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-06 00:00:13,787 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-06 00:00:13,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:00:13,788 INFO L85 PathProgramCache]: Analyzing trace with hash 914320107, now seen corresponding path program 1 times [2022-12-06 00:00:13,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:00:13,788 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702829803] [2022-12-06 00:00:13,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:00:13,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:00:13,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:00:13,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-06 00:00:13,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:00:13,956 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702829803] [2022-12-06 00:00:13,956 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1702829803] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:00:13,956 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:00:13,956 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:00:13,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607106072] [2022-12-06 00:00:13,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:00:13,957 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:00:13,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:00:13,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:00:13,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:00:13,957 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 35 [2022-12-06 00:00:13,957 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 52 transitions, 461 flow. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:00:13,958 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:00:13,958 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 35 [2022-12-06 00:00:13,958 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:00:14,238 INFO L130 PetriNetUnfolder]: 1098/1733 cut-off events. [2022-12-06 00:00:14,239 INFO L131 PetriNetUnfolder]: For 7867/7867 co-relation queries the response was YES. [2022-12-06 00:00:14,243 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7681 conditions, 1733 events. 1098/1733 cut-off events. For 7867/7867 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 7953 event pairs, 562 based on Foata normal form. 8/1741 useless extension candidates. Maximal degree in co-relation 7304. Up to 1460 conditions per place. [2022-12-06 00:00:14,250 INFO L137 encePairwiseOnDemand]: 27/35 looper letters, 57 selfloop transitions, 12 changer transitions 0/69 dead transitions. [2022-12-06 00:00:14,250 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 69 transitions, 686 flow [2022-12-06 00:00:14,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:00:14,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:00:14,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 56 transitions. [2022-12-06 00:00:14,252 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4 [2022-12-06 00:00:14,252 INFO L175 Difference]: Start difference. First operand has 71 places, 52 transitions, 461 flow. Second operand 4 states and 56 transitions. [2022-12-06 00:00:14,252 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 69 transitions, 686 flow [2022-12-06 00:00:14,263 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 69 transitions, 652 flow, removed 8 selfloop flow, removed 6 redundant places. [2022-12-06 00:00:14,264 INFO L231 Difference]: Finished difference. Result has 69 places, 54 transitions, 494 flow [2022-12-06 00:00:14,265 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=436, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=494, PETRI_PLACES=69, PETRI_TRANSITIONS=54} [2022-12-06 00:00:14,265 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 40 predicate places. [2022-12-06 00:00:14,265 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:00:14,265 INFO L89 Accepts]: Start accepts. Operand has 69 places, 54 transitions, 494 flow [2022-12-06 00:00:14,266 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:00:14,266 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:00:14,266 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 69 places, 54 transitions, 494 flow [2022-12-06 00:00:14,267 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 69 places, 54 transitions, 494 flow [2022-12-06 00:00:14,284 INFO L130 PetriNetUnfolder]: 56/232 cut-off events. [2022-12-06 00:00:14,284 INFO L131 PetriNetUnfolder]: For 722/755 co-relation queries the response was YES. [2022-12-06 00:00:14,285 INFO L83 FinitePrefix]: Finished finitePrefix Result has 735 conditions, 232 events. 56/232 cut-off events. For 722/755 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1329 event pairs, 2 based on Foata normal form. 8/223 useless extension candidates. Maximal degree in co-relation 664. Up to 93 conditions per place. [2022-12-06 00:00:14,286 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 69 places, 54 transitions, 494 flow [2022-12-06 00:00:14,286 INFO L188 LiptonReduction]: Number of co-enabled transitions 440 [2022-12-06 00:00:14,340 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [364] $Ultimate##0-->L57-5: Formula: (and (< (mod (+ 4294967295 v_thread3Thread1of1ForFork0_~i~2_45) 4294967296) (mod (+ v_~a~0_81 v_~b~0_69) 4294967296)) (= 2 v_thread3Thread1of1ForFork0_~i~2_45) (= (+ v_~x_3~0_56 (* v_~c~0_80 2)) v_~x_3~0_54)) InVars {~a~0=v_~a~0_81, ~c~0=v_~c~0_80, ~b~0=v_~b~0_69, ~x_3~0=v_~x_3~0_56} OutVars{~a~0=v_~a~0_81, ~c~0=v_~c~0_80, ~b~0=v_~b~0_69, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_45, ~x_3~0=v_~x_3~0_54, thread3Thread1of1ForFork0_#t~post3=|v_thread3Thread1of1ForFork0_#t~post3_22|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_~i~2, ~x_3~0, thread3Thread1of1ForFork0_#t~post3] and [330] L49-5-->L49-5: Formula: (and (< (mod v_thread2Thread1of1ForFork2_~i~1_24 4294967296) (mod v_~b~0_37 4294967296)) (= (+ v_~c~0_54 v_~x_2~0_38) v_~x_2~0_37) (= (+ v_thread2Thread1of1ForFork2_~i~1_24 1) v_thread2Thread1of1ForFork2_~i~1_23)) InVars {thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_24, ~c~0=v_~c~0_54, ~b~0=v_~b~0_37, ~x_2~0=v_~x_2~0_38} OutVars{thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_23, thread2Thread1of1ForFork2_#t~post2=|v_thread2Thread1of1ForFork2_#t~post2_17|, ~c~0=v_~c~0_54, ~b~0=v_~b~0_37, ~x_2~0=v_~x_2~0_37} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_~i~1, thread2Thread1of1ForFork2_#t~post2, ~x_2~0] [2022-12-06 00:00:14,387 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:00:14,388 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 123 [2022-12-06 00:00:14,388 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 53 transitions, 491 flow [2022-12-06 00:00:14,388 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:00:14,388 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:00:14,388 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:00:14,388 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-06 00:00:14,388 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-06 00:00:14,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:00:14,389 INFO L85 PathProgramCache]: Analyzing trace with hash -1487690506, now seen corresponding path program 1 times [2022-12-06 00:00:14,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:00:14,389 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392043002] [2022-12-06 00:00:14,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:00:14,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:00:14,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:00:14,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:00:14,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:00:14,579 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392043002] [2022-12-06 00:00:14,579 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1392043002] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:00:14,579 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:00:14,580 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 00:00:14,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280102235] [2022-12-06 00:00:14,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:00:14,580 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:00:14,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:00:14,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:00:14,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:00:14,581 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 36 [2022-12-06 00:00:14,582 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 53 transitions, 491 flow. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:00:14,582 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:00:14,582 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 36 [2022-12-06 00:00:14,582 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:00:14,818 INFO L130 PetriNetUnfolder]: 1017/1622 cut-off events. [2022-12-06 00:00:14,819 INFO L131 PetriNetUnfolder]: For 7550/7615 co-relation queries the response was YES. [2022-12-06 00:00:14,823 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6879 conditions, 1622 events. 1017/1622 cut-off events. For 7550/7615 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 7910 event pairs, 287 based on Foata normal form. 47/1654 useless extension candidates. Maximal degree in co-relation 6516. Up to 1469 conditions per place. [2022-12-06 00:00:14,831 INFO L137 encePairwiseOnDemand]: 27/36 looper letters, 55 selfloop transitions, 12 changer transitions 5/76 dead transitions. [2022-12-06 00:00:14,831 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 76 transitions, 733 flow [2022-12-06 00:00:14,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:00:14,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:00:14,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 67 transitions. [2022-12-06 00:00:14,832 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4652777777777778 [2022-12-06 00:00:14,833 INFO L175 Difference]: Start difference. First operand has 68 places, 53 transitions, 491 flow. Second operand 4 states and 67 transitions. [2022-12-06 00:00:14,833 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 76 transitions, 733 flow [2022-12-06 00:00:14,844 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 76 transitions, 703 flow, removed 10 selfloop flow, removed 2 redundant places. [2022-12-06 00:00:14,845 INFO L231 Difference]: Finished difference. Result has 70 places, 55 transitions, 520 flow [2022-12-06 00:00:14,845 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=465, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=520, PETRI_PLACES=70, PETRI_TRANSITIONS=55} [2022-12-06 00:00:14,846 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 41 predicate places. [2022-12-06 00:00:14,846 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:00:14,846 INFO L89 Accepts]: Start accepts. Operand has 70 places, 55 transitions, 520 flow [2022-12-06 00:00:14,847 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:00:14,847 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:00:14,848 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 70 places, 55 transitions, 520 flow [2022-12-06 00:00:14,848 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 70 places, 55 transitions, 520 flow [2022-12-06 00:00:14,870 INFO L130 PetriNetUnfolder]: 57/237 cut-off events. [2022-12-06 00:00:14,871 INFO L131 PetriNetUnfolder]: For 838/885 co-relation queries the response was YES. [2022-12-06 00:00:14,872 INFO L83 FinitePrefix]: Finished finitePrefix Result has 775 conditions, 237 events. 57/237 cut-off events. For 838/885 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1365 event pairs, 2 based on Foata normal form. 8/225 useless extension candidates. Maximal degree in co-relation 704. Up to 94 conditions per place. [2022-12-06 00:00:14,874 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 70 places, 55 transitions, 520 flow [2022-12-06 00:00:14,874 INFO L188 LiptonReduction]: Number of co-enabled transitions 452 [2022-12-06 00:00:14,890 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [365] $Ultimate##0-->L49-5: Formula: (and (= v_thread3Thread1of1ForFork0_~i~2_49 1) (= (+ v_~c~0_82 v_~x_3~0_61) v_~x_3~0_60) (= v_thread2Thread1of1ForFork2_~i~1_61 (+ v_thread2Thread1of1ForFork2_~i~1_62 1)) (= (+ v_~c~0_82 v_~x_2~0_65) v_~x_2~0_64) (< (mod v_thread2Thread1of1ForFork2_~i~1_62 4294967296) (mod v_~b~0_71 4294967296)) (< (mod (+ 4294967295 v_thread3Thread1of1ForFork0_~i~2_49) 4294967296) (mod (+ v_~a~0_83 v_~b~0_71) 4294967296))) InVars {~a~0=v_~a~0_83, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_62, ~c~0=v_~c~0_82, ~b~0=v_~b~0_71, ~x_2~0=v_~x_2~0_65, ~x_3~0=v_~x_3~0_61} OutVars{~a~0=v_~a~0_83, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_61, thread2Thread1of1ForFork2_#t~post2=|v_thread2Thread1of1ForFork2_#t~post2_28|, ~c~0=v_~c~0_82, ~b~0=v_~b~0_71, ~x_2~0=v_~x_2~0_64, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_49, ~x_3~0=v_~x_3~0_60, thread3Thread1of1ForFork0_#t~post3=|v_thread3Thread1of1ForFork0_#t~post3_26|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_~i~1, thread2Thread1of1ForFork2_#t~post2, ~x_2~0, thread3Thread1of1ForFork0_~i~2, ~x_3~0, thread3Thread1of1ForFork0_#t~post3] and [329] L57-5-->L57-5: Formula: (and (< (mod v_thread3Thread1of1ForFork0_~i~2_26 4294967296) (mod (+ v_~a~0_43 v_~b~0_35) 4294967296)) (= (+ v_thread3Thread1of1ForFork0_~i~2_26 1) v_thread3Thread1of1ForFork0_~i~2_25) (= (+ v_~c~0_52 v_~x_3~0_36) v_~x_3~0_35)) InVars {~a~0=v_~a~0_43, ~c~0=v_~c~0_52, ~b~0=v_~b~0_35, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_26, ~x_3~0=v_~x_3~0_36} OutVars{~a~0=v_~a~0_43, ~c~0=v_~c~0_52, ~b~0=v_~b~0_35, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_25, ~x_3~0=v_~x_3~0_35, thread3Thread1of1ForFork0_#t~post3=|v_thread3Thread1of1ForFork0_#t~post3_13|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_~i~2, ~x_3~0, thread3Thread1of1ForFork0_#t~post3] [2022-12-06 00:00:15,078 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:00:15,082 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 236 [2022-12-06 00:00:15,082 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 54 transitions, 527 flow [2022-12-06 00:00:15,082 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:00:15,082 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:00:15,082 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:00:15,082 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-06 00:00:15,082 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-06 00:00:15,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:00:15,083 INFO L85 PathProgramCache]: Analyzing trace with hash -337733152, now seen corresponding path program 1 times [2022-12-06 00:00:15,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:00:15,083 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278921886] [2022-12-06 00:00:15,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:00:15,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:00:15,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:00:15,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-06 00:00:15,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:00:15,261 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278921886] [2022-12-06 00:00:15,261 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278921886] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:00:15,261 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:00:15,261 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:00:15,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784537224] [2022-12-06 00:00:15,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:00:15,261 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:00:15,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:00:15,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:00:15,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:00:15,262 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 37 [2022-12-06 00:00:15,263 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 54 transitions, 527 flow. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:00:15,263 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:00:15,263 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 37 [2022-12-06 00:00:15,263 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:00:15,798 INFO L130 PetriNetUnfolder]: 1039/1634 cut-off events. [2022-12-06 00:00:15,799 INFO L131 PetriNetUnfolder]: For 8515/8529 co-relation queries the response was YES. [2022-12-06 00:00:15,803 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7050 conditions, 1634 events. 1039/1634 cut-off events. For 8515/8529 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 7580 event pairs, 501 based on Foata normal form. 26/1634 useless extension candidates. Maximal degree in co-relation 6793. Up to 1417 conditions per place. [2022-12-06 00:00:15,810 INFO L137 encePairwiseOnDemand]: 27/37 looper letters, 57 selfloop transitions, 15 changer transitions 0/75 dead transitions. [2022-12-06 00:00:15,811 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 75 transitions, 763 flow [2022-12-06 00:00:15,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 00:00:15,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 00:00:15,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 68 transitions. [2022-12-06 00:00:15,812 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3675675675675676 [2022-12-06 00:00:15,812 INFO L175 Difference]: Start difference. First operand has 69 places, 54 transitions, 527 flow. Second operand 5 states and 68 transitions. [2022-12-06 00:00:15,812 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 75 transitions, 763 flow [2022-12-06 00:00:15,831 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 75 transitions, 702 flow, removed 14 selfloop flow, removed 4 redundant places. [2022-12-06 00:00:15,833 INFO L231 Difference]: Finished difference. Result has 71 places, 55 transitions, 528 flow [2022-12-06 00:00:15,833 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=474, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=528, PETRI_PLACES=71, PETRI_TRANSITIONS=55} [2022-12-06 00:00:15,834 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 42 predicate places. [2022-12-06 00:00:15,834 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:00:15,834 INFO L89 Accepts]: Start accepts. Operand has 71 places, 55 transitions, 528 flow [2022-12-06 00:00:15,835 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:00:15,835 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:00:15,835 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 71 places, 55 transitions, 528 flow [2022-12-06 00:00:15,836 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 71 places, 55 transitions, 528 flow [2022-12-06 00:00:15,852 INFO L130 PetriNetUnfolder]: 58/224 cut-off events. [2022-12-06 00:00:15,853 INFO L131 PetriNetUnfolder]: For 745/779 co-relation queries the response was YES. [2022-12-06 00:00:15,853 INFO L83 FinitePrefix]: Finished finitePrefix Result has 743 conditions, 224 events. 58/224 cut-off events. For 745/779 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1216 event pairs, 2 based on Foata normal form. 8/216 useless extension candidates. Maximal degree in co-relation 681. Up to 93 conditions per place. [2022-12-06 00:00:15,855 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 71 places, 55 transitions, 528 flow [2022-12-06 00:00:15,855 INFO L188 LiptonReduction]: Number of co-enabled transitions 446 [2022-12-06 00:00:15,858 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [368] $Ultimate##0-->L57-5: Formula: (and (= (+ v_~c~0_88 v_~x_2~0_73) v_~x_2~0_72) (= v_thread2Thread1of1ForFork2_~i~1_69 (+ v_thread2Thread1of1ForFork2_~i~1_70 1)) (= 2 v_thread3Thread1of1ForFork0_~i~2_57) (= v_~x_3~0_74 (+ v_~x_3~0_76 (* v_~c~0_88 2))) (< 1 (mod (+ v_~a~0_89 v_~b~0_77) 4294967296)) (< (mod v_thread2Thread1of1ForFork2_~i~1_70 4294967296) (mod v_~b~0_77 4294967296))) InVars {~a~0=v_~a~0_89, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_70, ~c~0=v_~c~0_88, ~b~0=v_~b~0_77, ~x_2~0=v_~x_2~0_73, ~x_3~0=v_~x_3~0_76} OutVars{~a~0=v_~a~0_89, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_69, thread2Thread1of1ForFork2_#t~post2=|v_thread2Thread1of1ForFork2_#t~post2_32|, ~c~0=v_~c~0_88, ~b~0=v_~b~0_77, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_57, ~x_2~0=v_~x_2~0_72, ~x_3~0=v_~x_3~0_74, thread3Thread1of1ForFork0_#t~post3=|v_thread3Thread1of1ForFork0_#t~post3_34|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_~i~1, thread2Thread1of1ForFork2_#t~post2, thread3Thread1of1ForFork0_~i~2, ~x_2~0, ~x_3~0, thread3Thread1of1ForFork0_#t~post3] and [330] L49-5-->L49-5: Formula: (and (< (mod v_thread2Thread1of1ForFork2_~i~1_24 4294967296) (mod v_~b~0_37 4294967296)) (= (+ v_~c~0_54 v_~x_2~0_38) v_~x_2~0_37) (= (+ v_thread2Thread1of1ForFork2_~i~1_24 1) v_thread2Thread1of1ForFork2_~i~1_23)) InVars {thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_24, ~c~0=v_~c~0_54, ~b~0=v_~b~0_37, ~x_2~0=v_~x_2~0_38} OutVars{thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_23, thread2Thread1of1ForFork2_#t~post2=|v_thread2Thread1of1ForFork2_#t~post2_17|, ~c~0=v_~c~0_54, ~b~0=v_~b~0_37, ~x_2~0=v_~x_2~0_37} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_~i~1, thread2Thread1of1ForFork2_#t~post2, ~x_2~0] [2022-12-06 00:00:16,213 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:00:16,214 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 380 [2022-12-06 00:00:16,214 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 55 transitions, 535 flow [2022-12-06 00:00:16,214 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:00:16,214 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:00:16,214 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:00:16,214 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-06 00:00:16,215 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-06 00:00:16,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:00:16,215 INFO L85 PathProgramCache]: Analyzing trace with hash 2062324218, now seen corresponding path program 1 times [2022-12-06 00:00:16,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:00:16,215 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737389946] [2022-12-06 00:00:16,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:00:16,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:00:16,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:00:16,582 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-06 00:00:16,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:00:16,583 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737389946] [2022-12-06 00:00:16,583 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1737389946] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:00:16,583 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:00:16,583 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 00:00:16,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299123225] [2022-12-06 00:00:16,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:00:16,585 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 00:00:16,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:00:16,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 00:00:16,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 00:00:16,586 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 37 [2022-12-06 00:00:16,586 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 55 transitions, 535 flow. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:00:16,586 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:00:16,586 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 37 [2022-12-06 00:00:16,586 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:00:17,046 INFO L130 PetriNetUnfolder]: 1114/1741 cut-off events. [2022-12-06 00:00:17,046 INFO L131 PetriNetUnfolder]: For 7880/7880 co-relation queries the response was YES. [2022-12-06 00:00:17,050 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7484 conditions, 1741 events. 1114/1741 cut-off events. For 7880/7880 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 7895 event pairs, 544 based on Foata normal form. 20/1761 useless extension candidates. Maximal degree in co-relation 7211. Up to 1498 conditions per place. [2022-12-06 00:00:17,058 INFO L137 encePairwiseOnDemand]: 28/37 looper letters, 68 selfloop transitions, 14 changer transitions 0/82 dead transitions. [2022-12-06 00:00:17,058 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 82 transitions, 831 flow [2022-12-06 00:00:17,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 00:00:17,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 00:00:17,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 69 transitions. [2022-12-06 00:00:17,059 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.372972972972973 [2022-12-06 00:00:17,060 INFO L175 Difference]: Start difference. First operand has 71 places, 55 transitions, 535 flow. Second operand 5 states and 69 transitions. [2022-12-06 00:00:17,060 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 82 transitions, 831 flow [2022-12-06 00:00:17,078 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 82 transitions, 777 flow, removed 10 selfloop flow, removed 3 redundant places. [2022-12-06 00:00:17,079 INFO L231 Difference]: Finished difference. Result has 74 places, 58 transitions, 560 flow [2022-12-06 00:00:17,080 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=481, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=560, PETRI_PLACES=74, PETRI_TRANSITIONS=58} [2022-12-06 00:00:17,080 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 45 predicate places. [2022-12-06 00:00:17,080 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:00:17,081 INFO L89 Accepts]: Start accepts. Operand has 74 places, 58 transitions, 560 flow [2022-12-06 00:00:17,082 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:00:17,082 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:00:17,082 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 74 places, 58 transitions, 560 flow [2022-12-06 00:00:17,083 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 74 places, 58 transitions, 560 flow [2022-12-06 00:00:17,102 INFO L130 PetriNetUnfolder]: 72/262 cut-off events. [2022-12-06 00:00:17,102 INFO L131 PetriNetUnfolder]: For 1137/1202 co-relation queries the response was YES. [2022-12-06 00:00:17,103 INFO L83 FinitePrefix]: Finished finitePrefix Result has 933 conditions, 262 events. 72/262 cut-off events. For 1137/1202 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1495 event pairs, 2 based on Foata normal form. 9/248 useless extension candidates. Maximal degree in co-relation 867. Up to 109 conditions per place. [2022-12-06 00:00:17,105 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 74 places, 58 transitions, 560 flow [2022-12-06 00:00:17,105 INFO L188 LiptonReduction]: Number of co-enabled transitions 474 [2022-12-06 00:00:17,112 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [369] $Ultimate##0-->L49-5: Formula: (let ((.cse0 (mod v_~b~0_79 4294967296))) (and (= (+ 2 v_thread2Thread1of1ForFork2_~i~1_75) v_thread2Thread1of1ForFork2_~i~1_73) (= v_thread3Thread1of1ForFork0_~i~2_61 1) (< (mod (+ 4294967295 v_thread3Thread1of1ForFork0_~i~2_61) 4294967296) (mod (+ v_~a~0_91 v_~b~0_79) 4294967296)) (< (mod (+ 4294967295 v_thread2Thread1of1ForFork2_~i~1_73) 4294967296) .cse0) (< (mod v_thread2Thread1of1ForFork2_~i~1_75 4294967296) .cse0) (= v_~x_2~0_76 (+ v_~x_2~0_78 (* v_~c~0_90 2))) (= v_~x_3~0_80 (+ v_~c~0_90 v_~x_3~0_81)))) InVars {~a~0=v_~a~0_91, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_75, ~c~0=v_~c~0_90, ~b~0=v_~b~0_79, ~x_2~0=v_~x_2~0_78, ~x_3~0=v_~x_3~0_81} OutVars{~a~0=v_~a~0_91, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_73, thread2Thread1of1ForFork2_#t~post2=|v_thread2Thread1of1ForFork2_#t~post2_34|, ~c~0=v_~c~0_90, ~b~0=v_~b~0_79, ~x_2~0=v_~x_2~0_76, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_61, ~x_3~0=v_~x_3~0_80, thread3Thread1of1ForFork0_#t~post3=|v_thread3Thread1of1ForFork0_#t~post3_38|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_~i~1, thread2Thread1of1ForFork2_#t~post2, ~x_2~0, thread3Thread1of1ForFork0_~i~2, ~x_3~0, thread3Thread1of1ForFork0_#t~post3] and [329] L57-5-->L57-5: Formula: (and (< (mod v_thread3Thread1of1ForFork0_~i~2_26 4294967296) (mod (+ v_~a~0_43 v_~b~0_35) 4294967296)) (= (+ v_thread3Thread1of1ForFork0_~i~2_26 1) v_thread3Thread1of1ForFork0_~i~2_25) (= (+ v_~c~0_52 v_~x_3~0_36) v_~x_3~0_35)) InVars {~a~0=v_~a~0_43, ~c~0=v_~c~0_52, ~b~0=v_~b~0_35, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_26, ~x_3~0=v_~x_3~0_36} OutVars{~a~0=v_~a~0_43, ~c~0=v_~c~0_52, ~b~0=v_~b~0_35, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_25, ~x_3~0=v_~x_3~0_35, thread3Thread1of1ForFork0_#t~post3=|v_thread3Thread1of1ForFork0_#t~post3_13|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_~i~2, ~x_3~0, thread3Thread1of1ForFork0_#t~post3] [2022-12-06 00:00:17,370 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:00:17,370 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 290 [2022-12-06 00:00:17,370 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 58 transitions, 586 flow [2022-12-06 00:00:17,371 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:00:17,371 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:00:17,371 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:00:17,371 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-06 00:00:17,371 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-06 00:00:17,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:00:17,371 INFO L85 PathProgramCache]: Analyzing trace with hash -1345139397, now seen corresponding path program 1 times [2022-12-06 00:00:17,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:00:17,372 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034819823] [2022-12-06 00:00:17,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:00:17,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:00:17,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:00:17,551 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-06 00:00:17,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:00:17,551 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034819823] [2022-12-06 00:00:17,551 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2034819823] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:00:17,551 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:00:17,552 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 00:00:17,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818393574] [2022-12-06 00:00:17,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:00:17,553 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:00:17,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:00:17,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:00:17,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:00:17,554 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 39 [2022-12-06 00:00:17,554 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 58 transitions, 586 flow. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:00:17,555 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:00:17,555 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 39 [2022-12-06 00:00:17,555 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:00:17,773 INFO L130 PetriNetUnfolder]: 1037/1642 cut-off events. [2022-12-06 00:00:17,774 INFO L131 PetriNetUnfolder]: For 11477/11540 co-relation queries the response was YES. [2022-12-06 00:00:17,778 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7824 conditions, 1642 events. 1037/1642 cut-off events. For 11477/11540 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 7854 event pairs, 345 based on Foata normal form. 45/1672 useless extension candidates. Maximal degree in co-relation 7533. Up to 1485 conditions per place. [2022-12-06 00:00:17,785 INFO L137 encePairwiseOnDemand]: 27/39 looper letters, 57 selfloop transitions, 14 changer transitions 6/81 dead transitions. [2022-12-06 00:00:17,785 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 81 transitions, 854 flow [2022-12-06 00:00:17,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:00:17,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:00:17,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 70 transitions. [2022-12-06 00:00:17,786 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.44871794871794873 [2022-12-06 00:00:17,786 INFO L175 Difference]: Start difference. First operand has 74 places, 58 transitions, 586 flow. Second operand 4 states and 70 transitions. [2022-12-06 00:00:17,786 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 81 transitions, 854 flow [2022-12-06 00:00:17,803 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 81 transitions, 807 flow, removed 11 selfloop flow, removed 2 redundant places. [2022-12-06 00:00:17,805 INFO L231 Difference]: Finished difference. Result has 76 places, 59 transitions, 587 flow [2022-12-06 00:00:17,805 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=539, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=587, PETRI_PLACES=76, PETRI_TRANSITIONS=59} [2022-12-06 00:00:17,805 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 47 predicate places. [2022-12-06 00:00:17,806 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:00:17,806 INFO L89 Accepts]: Start accepts. Operand has 76 places, 59 transitions, 587 flow [2022-12-06 00:00:17,808 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:00:17,808 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:00:17,808 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 76 places, 59 transitions, 587 flow [2022-12-06 00:00:17,809 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 75 places, 59 transitions, 587 flow [2022-12-06 00:00:17,828 INFO L130 PetriNetUnfolder]: 75/268 cut-off events. [2022-12-06 00:00:17,829 INFO L131 PetriNetUnfolder]: For 1425/1514 co-relation queries the response was YES. [2022-12-06 00:00:17,830 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1018 conditions, 268 events. 75/268 cut-off events. For 1425/1514 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1539 event pairs, 2 based on Foata normal form. 9/252 useless extension candidates. Maximal degree in co-relation 951. Up to 112 conditions per place. [2022-12-06 00:00:17,832 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 75 places, 59 transitions, 587 flow [2022-12-06 00:00:17,832 INFO L188 LiptonReduction]: Number of co-enabled transitions 480 [2022-12-06 00:00:17,832 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:00:17,833 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 27 [2022-12-06 00:00:17,833 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 59 transitions, 587 flow [2022-12-06 00:00:17,833 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:00:17,833 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:00:17,833 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:00:17,833 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-06 00:00:17,834 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-06 00:00:17,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:00:17,834 INFO L85 PathProgramCache]: Analyzing trace with hash -1092628300, now seen corresponding path program 1 times [2022-12-06 00:00:17,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:00:17,834 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747910500] [2022-12-06 00:00:17,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:00:17,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:00:17,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:00:17,943 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:00:17,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:00:17,943 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747910500] [2022-12-06 00:00:17,943 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [747910500] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 00:00:17,944 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1262392827] [2022-12-06 00:00:17,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:00:17,944 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:00:17,944 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:00:17,948 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 00:00:17,956 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-06 00:00:18,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:00:18,051 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 9 conjunts are in the unsatisfiable core [2022-12-06 00:00:18,052 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 00:00:18,073 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:00:18,073 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 00:00:18,105 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:00:18,105 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1262392827] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-06 00:00:18,105 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-12-06 00:00:18,105 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4, 4] total 5 [2022-12-06 00:00:18,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248972512] [2022-12-06 00:00:18,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:00:18,106 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 00:00:18,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:00:18,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 00:00:18,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 00:00:18,106 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 38 [2022-12-06 00:00:18,106 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 59 transitions, 587 flow. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:00:18,106 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:00:18,106 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 38 [2022-12-06 00:00:18,107 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:00:18,307 INFO L130 PetriNetUnfolder]: 1023/1603 cut-off events. [2022-12-06 00:00:18,307 INFO L131 PetriNetUnfolder]: For 12200/12264 co-relation queries the response was YES. [2022-12-06 00:00:18,311 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7811 conditions, 1603 events. 1023/1603 cut-off events. For 12200/12264 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 7513 event pairs, 339 based on Foata normal form. 48/1636 useless extension candidates. Maximal degree in co-relation 7622. Up to 1489 conditions per place. [2022-12-06 00:00:18,318 INFO L137 encePairwiseOnDemand]: 28/38 looper letters, 52 selfloop transitions, 11 changer transitions 4/71 dead transitions. [2022-12-06 00:00:18,318 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 71 transitions, 755 flow [2022-12-06 00:00:18,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 00:00:18,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 00:00:18,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 56 transitions. [2022-12-06 00:00:18,319 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.49122807017543857 [2022-12-06 00:00:18,319 INFO L175 Difference]: Start difference. First operand has 75 places, 59 transitions, 587 flow. Second operand 3 states and 56 transitions. [2022-12-06 00:00:18,319 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 71 transitions, 755 flow [2022-12-06 00:00:18,335 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 71 transitions, 713 flow, removed 9 selfloop flow, removed 3 redundant places. [2022-12-06 00:00:18,336 INFO L231 Difference]: Finished difference. Result has 73 places, 58 transitions, 550 flow [2022-12-06 00:00:18,336 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=528, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=550, PETRI_PLACES=73, PETRI_TRANSITIONS=58} [2022-12-06 00:00:18,337 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 44 predicate places. [2022-12-06 00:00:18,337 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:00:18,337 INFO L89 Accepts]: Start accepts. Operand has 73 places, 58 transitions, 550 flow [2022-12-06 00:00:18,338 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:00:18,338 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:00:18,338 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 73 places, 58 transitions, 550 flow [2022-12-06 00:00:18,338 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 73 places, 58 transitions, 550 flow [2022-12-06 00:00:18,357 INFO L130 PetriNetUnfolder]: 75/261 cut-off events. [2022-12-06 00:00:18,357 INFO L131 PetriNetUnfolder]: For 1315/1381 co-relation queries the response was YES. [2022-12-06 00:00:18,358 INFO L83 FinitePrefix]: Finished finitePrefix Result has 969 conditions, 261 events. 75/261 cut-off events. For 1315/1381 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1461 event pairs, 2 based on Foata normal form. 7/244 useless extension candidates. Maximal degree in co-relation 856. Up to 108 conditions per place. [2022-12-06 00:00:18,360 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 73 places, 58 transitions, 550 flow [2022-12-06 00:00:18,360 INFO L188 LiptonReduction]: Number of co-enabled transitions 476 [2022-12-06 00:00:18,361 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:00:18,362 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 25 [2022-12-06 00:00:18,362 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 58 transitions, 550 flow [2022-12-06 00:00:18,362 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:00:18,362 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:00:18,362 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:00:18,374 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-12-06 00:00:18,567 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:00:18,571 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-06 00:00:18,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:00:18,572 INFO L85 PathProgramCache]: Analyzing trace with hash -1846577865, now seen corresponding path program 1 times [2022-12-06 00:00:18,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:00:18,572 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117735464] [2022-12-06 00:00:18,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:00:18,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:00:18,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:00:18,707 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-06 00:00:18,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:00:18,707 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117735464] [2022-12-06 00:00:18,707 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1117735464] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:00:18,707 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:00:18,707 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 00:00:18,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801454429] [2022-12-06 00:00:18,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:00:18,708 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 00:00:18,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:00:18,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 00:00:18,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-06 00:00:18,709 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 37 [2022-12-06 00:00:18,709 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 58 transitions, 550 flow. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:00:18,709 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:00:18,709 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 37 [2022-12-06 00:00:18,709 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:00:19,149 INFO L130 PetriNetUnfolder]: 1093/1718 cut-off events. [2022-12-06 00:00:19,149 INFO L131 PetriNetUnfolder]: For 12494/12507 co-relation queries the response was YES. [2022-12-06 00:00:19,154 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8105 conditions, 1718 events. 1093/1718 cut-off events. For 12494/12507 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 8124 event pairs, 407 based on Foata normal form. 4/1695 useless extension candidates. Maximal degree in co-relation 7366. Up to 1240 conditions per place. [2022-12-06 00:00:19,161 INFO L137 encePairwiseOnDemand]: 28/37 looper letters, 92 selfloop transitions, 8 changer transitions 0/103 dead transitions. [2022-12-06 00:00:19,161 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 103 transitions, 977 flow [2022-12-06 00:00:19,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 00:00:19,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 00:00:19,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 88 transitions. [2022-12-06 00:00:19,162 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3963963963963964 [2022-12-06 00:00:19,162 INFO L175 Difference]: Start difference. First operand has 73 places, 58 transitions, 550 flow. Second operand 6 states and 88 transitions. [2022-12-06 00:00:19,162 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 103 transitions, 977 flow [2022-12-06 00:00:19,180 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 103 transitions, 966 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 00:00:19,182 INFO L231 Difference]: Finished difference. Result has 80 places, 61 transitions, 590 flow [2022-12-06 00:00:19,182 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=539, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=590, PETRI_PLACES=80, PETRI_TRANSITIONS=61} [2022-12-06 00:00:19,183 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 51 predicate places. [2022-12-06 00:00:19,183 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:00:19,183 INFO L89 Accepts]: Start accepts. Operand has 80 places, 61 transitions, 590 flow [2022-12-06 00:00:19,184 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:00:19,184 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:00:19,184 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 80 places, 61 transitions, 590 flow [2022-12-06 00:00:19,185 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 80 places, 61 transitions, 590 flow [2022-12-06 00:00:19,210 INFO L130 PetriNetUnfolder]: 76/273 cut-off events. [2022-12-06 00:00:19,210 INFO L131 PetriNetUnfolder]: For 1325/1402 co-relation queries the response was YES. [2022-12-06 00:00:19,212 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1043 conditions, 273 events. 76/273 cut-off events. For 1325/1402 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1591 event pairs, 2 based on Foata normal form. 7/256 useless extension candidates. Maximal degree in co-relation 942. Up to 112 conditions per place. [2022-12-06 00:00:19,214 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 80 places, 61 transitions, 590 flow [2022-12-06 00:00:19,214 INFO L188 LiptonReduction]: Number of co-enabled transitions 480 [2022-12-06 00:00:19,262 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [342] L49-5-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork2_#res.offset_Out_4| 0) (not (< (mod v_thread2Thread1of1ForFork2_~i~1_In_3 4294967296) (mod v_~b~0_In_1 4294967296))) (= |v_thread2Thread1of1ForFork2_#res.base_Out_4| 0)) InVars {~b~0=v_~b~0_In_1, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_In_3} OutVars{thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_In_3, thread2Thread1of1ForFork2_#res.base=|v_thread2Thread1of1ForFork2_#res.base_Out_4|, ~b~0=v_~b~0_In_1, thread2Thread1of1ForFork2_#res.offset=|v_thread2Thread1of1ForFork2_#res.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res.base, thread2Thread1of1ForFork2_#res.offset] and [351] $Ultimate##0-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork0_#res.offset_14| 0) (not (< (mod v_thread3Thread1of1ForFork0_~i~2_32 4294967296) (mod (+ v_~a~0_59 v_~b~0_47) 4294967296))) (= 0 |v_thread3Thread1of1ForFork0_#res.base_14|) (= v_thread3Thread1of1ForFork0_~i~2_32 0)) InVars {~a~0=v_~a~0_59, ~b~0=v_~b~0_47} OutVars{~a~0=v_~a~0_59, ~b~0=v_~b~0_47, thread3Thread1of1ForFork0_#res.offset=|v_thread3Thread1of1ForFork0_#res.offset_14|, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_32, thread3Thread1of1ForFork0_#res.base=|v_thread3Thread1of1ForFork0_#res.base_14|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#res.offset, thread3Thread1of1ForFork0_~i~2, thread3Thread1of1ForFork0_#res.base] [2022-12-06 00:00:19,341 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 00:00:19,341 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 158 [2022-12-06 00:00:19,342 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 60 transitions, 589 flow [2022-12-06 00:00:19,342 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:00:19,342 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:00:19,342 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:00:19,342 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-12-06 00:00:19,342 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-06 00:00:19,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:00:19,343 INFO L85 PathProgramCache]: Analyzing trace with hash -1236145212, now seen corresponding path program 1 times [2022-12-06 00:00:19,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:00:19,343 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388779104] [2022-12-06 00:00:19,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:00:19,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:00:19,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:00:19,448 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:00:19,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:00:19,448 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388779104] [2022-12-06 00:00:19,448 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1388779104] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:00:19,448 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:00:19,449 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 00:00:19,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235871352] [2022-12-06 00:00:19,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:00:19,449 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 00:00:19,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:00:19,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 00:00:19,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-06 00:00:19,450 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 39 [2022-12-06 00:00:19,450 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 60 transitions, 589 flow. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:00:19,450 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:00:19,450 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 39 [2022-12-06 00:00:19,450 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:00:19,825 INFO L130 PetriNetUnfolder]: 1479/2297 cut-off events. [2022-12-06 00:00:19,825 INFO L131 PetriNetUnfolder]: For 16003/16003 co-relation queries the response was YES. [2022-12-06 00:00:19,833 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11231 conditions, 2297 events. 1479/2297 cut-off events. For 16003/16003 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 10903 event pairs, 492 based on Foata normal form. 4/2301 useless extension candidates. Maximal degree in co-relation 10848. Up to 1353 conditions per place. [2022-12-06 00:00:19,842 INFO L137 encePairwiseOnDemand]: 29/39 looper letters, 103 selfloop transitions, 14 changer transitions 2/119 dead transitions. [2022-12-06 00:00:19,842 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 119 transitions, 1279 flow [2022-12-06 00:00:19,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 00:00:19,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 00:00:19,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 88 transitions. [2022-12-06 00:00:19,843 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4512820512820513 [2022-12-06 00:00:19,844 INFO L175 Difference]: Start difference. First operand has 79 places, 60 transitions, 589 flow. Second operand 5 states and 88 transitions. [2022-12-06 00:00:19,844 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 119 transitions, 1279 flow [2022-12-06 00:00:19,881 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 119 transitions, 1232 flow, removed 10 selfloop flow, removed 3 redundant places. [2022-12-06 00:00:19,882 INFO L231 Difference]: Finished difference. Result has 83 places, 65 transitions, 688 flow [2022-12-06 00:00:19,883 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=571, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=688, PETRI_PLACES=83, PETRI_TRANSITIONS=65} [2022-12-06 00:00:19,883 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 54 predicate places. [2022-12-06 00:00:19,883 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:00:19,883 INFO L89 Accepts]: Start accepts. Operand has 83 places, 65 transitions, 688 flow [2022-12-06 00:00:19,884 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:00:19,884 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:00:19,884 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 83 places, 65 transitions, 688 flow [2022-12-06 00:00:19,885 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 83 places, 65 transitions, 688 flow [2022-12-06 00:00:19,910 INFO L130 PetriNetUnfolder]: 99/340 cut-off events. [2022-12-06 00:00:19,910 INFO L131 PetriNetUnfolder]: For 2130/2214 co-relation queries the response was YES. [2022-12-06 00:00:19,912 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1357 conditions, 340 events. 99/340 cut-off events. For 2130/2214 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 2069 event pairs, 5 based on Foata normal form. 12/328 useless extension candidates. Maximal degree in co-relation 1261. Up to 148 conditions per place. [2022-12-06 00:00:19,914 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 83 places, 65 transitions, 688 flow [2022-12-06 00:00:19,914 INFO L188 LiptonReduction]: Number of co-enabled transitions 542 [2022-12-06 00:00:19,918 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [357] $Ultimate##0-->L49-5: Formula: (and (< (mod (+ 4294967295 v_thread2Thread1of1ForFork2_~i~1_45) 4294967296) (mod v_~b~0_59 4294967296)) (= v_thread2Thread1of1ForFork2_~i~1_45 1) (= v_~x_2~0_60 (+ v_~c~0_76 v_~x_2~0_61))) InVars {~c~0=v_~c~0_76, ~b~0=v_~b~0_59, ~x_2~0=v_~x_2~0_61} OutVars{thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_45, thread2Thread1of1ForFork2_#t~post2=|v_thread2Thread1of1ForFork2_#t~post2_26|, ~c~0=v_~c~0_76, ~b~0=v_~b~0_59, ~x_2~0=v_~x_2~0_60} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_~i~1, thread2Thread1of1ForFork2_#t~post2, ~x_2~0] and [251] $Ultimate##0-->L57-5: Formula: (= v_thread3Thread1of1ForFork0_~i~2_1 0) InVars {} OutVars{thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_1} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_~i~2] [2022-12-06 00:00:19,943 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [375] $Ultimate##0-->L57-5: Formula: (and (= v_thread3Thread1of1ForFork0_~i~2_74 0) (< (mod (+ 4294967295 v_thread2Thread1of1ForFork2_~i~1_98) 4294967296) (mod v_~b~0_89 4294967296)) (= (+ v_~x_2~0_99 v_~c~0_100) v_~x_2~0_98) (= v_thread2Thread1of1ForFork2_~i~1_98 1)) InVars {~c~0=v_~c~0_100, ~b~0=v_~b~0_89, ~x_2~0=v_~x_2~0_99} OutVars{thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_98, thread2Thread1of1ForFork2_#t~post2=|v_thread2Thread1of1ForFork2_#t~post2_48|, ~c~0=v_~c~0_100, ~b~0=v_~b~0_89, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_74, ~x_2~0=v_~x_2~0_98} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_~i~1, thread2Thread1of1ForFork2_#t~post2, thread3Thread1of1ForFork0_~i~2, ~x_2~0] and [330] L49-5-->L49-5: Formula: (and (< (mod v_thread2Thread1of1ForFork2_~i~1_24 4294967296) (mod v_~b~0_37 4294967296)) (= (+ v_~c~0_54 v_~x_2~0_38) v_~x_2~0_37) (= (+ v_thread2Thread1of1ForFork2_~i~1_24 1) v_thread2Thread1of1ForFork2_~i~1_23)) InVars {thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_24, ~c~0=v_~c~0_54, ~b~0=v_~b~0_37, ~x_2~0=v_~x_2~0_38} OutVars{thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_23, thread2Thread1of1ForFork2_#t~post2=|v_thread2Thread1of1ForFork2_#t~post2_17|, ~c~0=v_~c~0_54, ~b~0=v_~b~0_37, ~x_2~0=v_~x_2~0_37} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_~i~1, thread2Thread1of1ForFork2_#t~post2, ~x_2~0] [2022-12-06 00:00:20,065 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 00:00:20,066 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 183 [2022-12-06 00:00:20,066 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 65 transitions, 695 flow [2022-12-06 00:00:20,066 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:00:20,066 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:00:20,067 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:00:20,067 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-12-06 00:00:20,067 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-06 00:00:20,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:00:20,067 INFO L85 PathProgramCache]: Analyzing trace with hash -868885621, now seen corresponding path program 1 times [2022-12-06 00:00:20,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:00:20,067 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638455223] [2022-12-06 00:00:20,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:00:20,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:00:20,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:00:20,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-06 00:00:20,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:00:20,191 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638455223] [2022-12-06 00:00:20,191 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1638455223] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:00:20,191 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:00:20,191 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 00:00:20,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590871942] [2022-12-06 00:00:20,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:00:20,192 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 00:00:20,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:00:20,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 00:00:20,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 00:00:20,192 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 40 [2022-12-06 00:00:20,192 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 65 transitions, 695 flow. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:00:20,193 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:00:20,193 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 40 [2022-12-06 00:00:20,193 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:00:20,544 INFO L130 PetriNetUnfolder]: 1391/2182 cut-off events. [2022-12-06 00:00:20,544 INFO L131 PetriNetUnfolder]: For 19789/19830 co-relation queries the response was YES. [2022-12-06 00:00:20,550 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11275 conditions, 2182 events. 1391/2182 cut-off events. For 19789/19830 co-relation queries the response was YES. Maximal size of possible extension queue 147. Compared 10648 event pairs, 607 based on Foata normal form. 32/2187 useless extension candidates. Maximal degree in co-relation 10904. Up to 1512 conditions per place. [2022-12-06 00:00:20,559 INFO L137 encePairwiseOnDemand]: 32/40 looper letters, 84 selfloop transitions, 9 changer transitions 0/96 dead transitions. [2022-12-06 00:00:20,559 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 96 transitions, 1044 flow [2022-12-06 00:00:20,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 00:00:20,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 00:00:20,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 75 transitions. [2022-12-06 00:00:20,560 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.375 [2022-12-06 00:00:20,560 INFO L175 Difference]: Start difference. First operand has 83 places, 65 transitions, 695 flow. Second operand 5 states and 75 transitions. [2022-12-06 00:00:20,561 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 96 transitions, 1044 flow [2022-12-06 00:00:20,589 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 96 transitions, 1013 flow, removed 9 selfloop flow, removed 1 redundant places. [2022-12-06 00:00:20,591 INFO L231 Difference]: Finished difference. Result has 87 places, 65 transitions, 675 flow [2022-12-06 00:00:20,591 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=647, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=675, PETRI_PLACES=87, PETRI_TRANSITIONS=65} [2022-12-06 00:00:20,591 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 58 predicate places. [2022-12-06 00:00:20,591 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:00:20,592 INFO L89 Accepts]: Start accepts. Operand has 87 places, 65 transitions, 675 flow [2022-12-06 00:00:20,592 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:00:20,592 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:00:20,592 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 87 places, 65 transitions, 675 flow [2022-12-06 00:00:20,593 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 87 places, 65 transitions, 675 flow [2022-12-06 00:00:20,619 INFO L130 PetriNetUnfolder]: 99/342 cut-off events. [2022-12-06 00:00:20,619 INFO L131 PetriNetUnfolder]: For 2064/2159 co-relation queries the response was YES. [2022-12-06 00:00:20,620 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1376 conditions, 342 events. 99/342 cut-off events. For 2064/2159 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 2081 event pairs, 6 based on Foata normal form. 12/329 useless extension candidates. Maximal degree in co-relation 1267. Up to 149 conditions per place. [2022-12-06 00:00:20,623 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 87 places, 65 transitions, 675 flow [2022-12-06 00:00:20,623 INFO L188 LiptonReduction]: Number of co-enabled transitions 536 [2022-12-06 00:00:20,671 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [345] L57-5-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork0_#res.offset_Out_4| 0) (not (< (mod v_thread3Thread1of1ForFork0_~i~2_In_2 4294967296) (mod (+ v_~a~0_In_3 v_~b~0_In_3) 4294967296))) (= |v_thread3Thread1of1ForFork0_#res.base_Out_4| 0)) InVars {thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_In_2, ~a~0=v_~a~0_In_3, ~b~0=v_~b~0_In_3} OutVars{thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_In_2, ~a~0=v_~a~0_In_3, thread3Thread1of1ForFork0_#res.base=|v_thread3Thread1of1ForFork0_#res.base_Out_4|, ~b~0=v_~b~0_In_3, thread3Thread1of1ForFork0_#res.offset=|v_thread3Thread1of1ForFork0_#res.offset_Out_4|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#res.offset, thread3Thread1of1ForFork0_#res.base] and [356] $Ultimate##0-->L49-5: Formula: (and (= v_thread2Thread1of1ForFork2_~i~1_41 1) (= v_~x_2~0_56 (+ v_~c~0_74 v_~x_2~0_57)) (< (mod (+ 4294967295 v_thread2Thread1of1ForFork2_~i~1_41) 4294967296) (mod v_~b~0_57 4294967296))) InVars {~c~0=v_~c~0_74, ~b~0=v_~b~0_57, ~x_2~0=v_~x_2~0_57} OutVars{thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_41, thread2Thread1of1ForFork2_#t~post2=|v_thread2Thread1of1ForFork2_#t~post2_24|, ~c~0=v_~c~0_74, ~b~0=v_~b~0_57, ~x_2~0=v_~x_2~0_56} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_~i~1, thread2Thread1of1ForFork2_#t~post2, ~x_2~0] [2022-12-06 00:00:20,742 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [374] L49-5-->thread3EXIT: Formula: (and (= v_thread3Thread1of1ForFork0_~i~2_72 0) (= 0 |v_thread3Thread1of1ForFork0_#res.base_18|) (not (< (mod v_thread2Thread1of1ForFork2_~i~1_96 4294967296) (mod v_~b~0_87 4294967296))) (= |v_thread3Thread1of1ForFork0_#res.offset_18| 0) (not (< (mod v_thread3Thread1of1ForFork0_~i~2_72 4294967296) (mod (+ v_~b~0_87 v_~a~0_101) 4294967296))) (= |v_thread2Thread1of1ForFork2_#res.offset_24| 0) (= |v_thread2Thread1of1ForFork2_#res.base_24| 0)) InVars {~a~0=v_~a~0_101, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_96, ~b~0=v_~b~0_87} OutVars{~a~0=v_~a~0_101, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_96, thread2Thread1of1ForFork2_#res.base=|v_thread2Thread1of1ForFork2_#res.base_24|, ~b~0=v_~b~0_87, thread3Thread1of1ForFork0_#res.offset=|v_thread3Thread1of1ForFork0_#res.offset_18|, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_72, thread3Thread1of1ForFork0_#res.base=|v_thread3Thread1of1ForFork0_#res.base_18|, thread2Thread1of1ForFork2_#res.offset=|v_thread2Thread1of1ForFork2_#res.offset_24|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res.base, thread3Thread1of1ForFork0_#res.offset, thread3Thread1of1ForFork0_~i~2, thread3Thread1of1ForFork0_#res.base, thread2Thread1of1ForFork2_#res.offset] and [356] $Ultimate##0-->L49-5: Formula: (and (= v_thread2Thread1of1ForFork2_~i~1_41 1) (= v_~x_2~0_56 (+ v_~c~0_74 v_~x_2~0_57)) (< (mod (+ 4294967295 v_thread2Thread1of1ForFork2_~i~1_41) 4294967296) (mod v_~b~0_57 4294967296))) InVars {~c~0=v_~c~0_74, ~b~0=v_~b~0_57, ~x_2~0=v_~x_2~0_57} OutVars{thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_41, thread2Thread1of1ForFork2_#t~post2=|v_thread2Thread1of1ForFork2_#t~post2_24|, ~c~0=v_~c~0_74, ~b~0=v_~b~0_57, ~x_2~0=v_~x_2~0_56} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_~i~1, thread2Thread1of1ForFork2_#t~post2, ~x_2~0] [2022-12-06 00:00:20,822 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [351] $Ultimate##0-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork0_#res.offset_14| 0) (not (< (mod v_thread3Thread1of1ForFork0_~i~2_32 4294967296) (mod (+ v_~a~0_59 v_~b~0_47) 4294967296))) (= 0 |v_thread3Thread1of1ForFork0_#res.base_14|) (= v_thread3Thread1of1ForFork0_~i~2_32 0)) InVars {~a~0=v_~a~0_59, ~b~0=v_~b~0_47} OutVars{~a~0=v_~a~0_59, ~b~0=v_~b~0_47, thread3Thread1of1ForFork0_#res.offset=|v_thread3Thread1of1ForFork0_#res.offset_14|, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_32, thread3Thread1of1ForFork0_#res.base=|v_thread3Thread1of1ForFork0_#res.base_14|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#res.offset, thread3Thread1of1ForFork0_~i~2, thread3Thread1of1ForFork0_#res.base] and [356] $Ultimate##0-->L49-5: Formula: (and (= v_thread2Thread1of1ForFork2_~i~1_41 1) (= v_~x_2~0_56 (+ v_~c~0_74 v_~x_2~0_57)) (< (mod (+ 4294967295 v_thread2Thread1of1ForFork2_~i~1_41) 4294967296) (mod v_~b~0_57 4294967296))) InVars {~c~0=v_~c~0_74, ~b~0=v_~b~0_57, ~x_2~0=v_~x_2~0_57} OutVars{thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_41, thread2Thread1of1ForFork2_#t~post2=|v_thread2Thread1of1ForFork2_#t~post2_24|, ~c~0=v_~c~0_74, ~b~0=v_~b~0_57, ~x_2~0=v_~x_2~0_56} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_~i~1, thread2Thread1of1ForFork2_#t~post2, ~x_2~0] [2022-12-06 00:00:20,872 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 00:00:20,873 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 282 [2022-12-06 00:00:20,873 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 66 transitions, 745 flow [2022-12-06 00:00:20,873 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:00:20,873 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:00:20,874 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:00:20,874 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-12-06 00:00:20,874 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-06 00:00:20,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:00:20,874 INFO L85 PathProgramCache]: Analyzing trace with hash 182603322, now seen corresponding path program 2 times [2022-12-06 00:00:20,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:00:20,875 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664277184] [2022-12-06 00:00:20,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:00:20,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:00:20,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:00:21,009 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-06 00:00:21,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:00:21,009 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664277184] [2022-12-06 00:00:21,010 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [664277184] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:00:21,010 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:00:21,010 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 00:00:21,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010953232] [2022-12-06 00:00:21,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:00:21,011 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 00:00:21,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:00:21,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 00:00:21,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-12-06 00:00:21,012 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 42 [2022-12-06 00:00:21,012 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 66 transitions, 745 flow. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:00:21,012 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:00:21,012 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 42 [2022-12-06 00:00:21,013 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:00:21,455 INFO L130 PetriNetUnfolder]: 1553/2443 cut-off events. [2022-12-06 00:00:21,456 INFO L131 PetriNetUnfolder]: For 18762/18762 co-relation queries the response was YES. [2022-12-06 00:00:21,464 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12486 conditions, 2443 events. 1553/2443 cut-off events. For 18762/18762 co-relation queries the response was YES. Maximal size of possible extension queue 157. Compared 11993 event pairs, 540 based on Foata normal form. 20/2463 useless extension candidates. Maximal degree in co-relation 11932. Up to 1363 conditions per place. [2022-12-06 00:00:21,475 INFO L137 encePairwiseOnDemand]: 31/42 looper letters, 109 selfloop transitions, 26 changer transitions 1/136 dead transitions. [2022-12-06 00:00:21,475 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 136 transitions, 1432 flow [2022-12-06 00:00:21,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 00:00:21,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 00:00:21,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 111 transitions. [2022-12-06 00:00:21,477 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.37755102040816324 [2022-12-06 00:00:21,477 INFO L175 Difference]: Start difference. First operand has 86 places, 66 transitions, 745 flow. Second operand 7 states and 111 transitions. [2022-12-06 00:00:21,477 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 136 transitions, 1432 flow [2022-12-06 00:00:21,513 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 136 transitions, 1388 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-06 00:00:21,515 INFO L231 Difference]: Finished difference. Result has 91 places, 77 transitions, 909 flow [2022-12-06 00:00:21,515 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=655, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=909, PETRI_PLACES=91, PETRI_TRANSITIONS=77} [2022-12-06 00:00:21,516 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 62 predicate places. [2022-12-06 00:00:21,516 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:00:21,516 INFO L89 Accepts]: Start accepts. Operand has 91 places, 77 transitions, 909 flow [2022-12-06 00:00:21,518 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:00:21,518 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:00:21,518 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 91 places, 77 transitions, 909 flow [2022-12-06 00:00:21,519 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 91 places, 77 transitions, 909 flow [2022-12-06 00:00:21,551 INFO L130 PetriNetUnfolder]: 108/388 cut-off events. [2022-12-06 00:00:21,551 INFO L131 PetriNetUnfolder]: For 2786/2936 co-relation queries the response was YES. [2022-12-06 00:00:21,552 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1588 conditions, 388 events. 108/388 cut-off events. For 2786/2936 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 2538 event pairs, 5 based on Foata normal form. 14/378 useless extension candidates. Maximal degree in co-relation 1461. Up to 163 conditions per place. [2022-12-06 00:00:21,555 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 91 places, 77 transitions, 909 flow [2022-12-06 00:00:21,555 INFO L188 LiptonReduction]: Number of co-enabled transitions 630 [2022-12-06 00:00:21,557 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [357] $Ultimate##0-->L49-5: Formula: (and (< (mod (+ 4294967295 v_thread2Thread1of1ForFork2_~i~1_45) 4294967296) (mod v_~b~0_59 4294967296)) (= v_thread2Thread1of1ForFork2_~i~1_45 1) (= v_~x_2~0_60 (+ v_~c~0_76 v_~x_2~0_61))) InVars {~c~0=v_~c~0_76, ~b~0=v_~b~0_59, ~x_2~0=v_~x_2~0_61} OutVars{thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_45, thread2Thread1of1ForFork2_#t~post2=|v_thread2Thread1of1ForFork2_#t~post2_26|, ~c~0=v_~c~0_76, ~b~0=v_~b~0_59, ~x_2~0=v_~x_2~0_60} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_~i~1, thread2Thread1of1ForFork2_#t~post2, ~x_2~0] and [251] $Ultimate##0-->L57-5: Formula: (= v_thread3Thread1of1ForFork0_~i~2_1 0) InVars {} OutVars{thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_1} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_~i~2] [2022-12-06 00:00:21,578 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [346] $Ultimate##0-->thread1EXIT: Formula: (and (= v_thread1Thread1of1ForFork1_~i~0_25 0) (= |v_thread1Thread1of1ForFork1_#res.base_11| 0) (= |v_thread1Thread1of1ForFork1_#res.offset_11| 0) (not (< (mod v_thread1Thread1of1ForFork1_~i~0_25 4294967296) (mod v_~a~0_51 4294967296)))) InVars {~a~0=v_~a~0_51} OutVars{~a~0=v_~a~0_51, thread1Thread1of1ForFork1_#res.base=|v_thread1Thread1of1ForFork1_#res.base_11|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_25, thread1Thread1of1ForFork1_#res.offset=|v_thread1Thread1of1ForFork1_#res.offset_11|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#res.base, thread1Thread1of1ForFork1_~i~0, thread1Thread1of1ForFork1_#res.offset] and [329] L57-5-->L57-5: Formula: (and (< (mod v_thread3Thread1of1ForFork0_~i~2_26 4294967296) (mod (+ v_~a~0_43 v_~b~0_35) 4294967296)) (= (+ v_thread3Thread1of1ForFork0_~i~2_26 1) v_thread3Thread1of1ForFork0_~i~2_25) (= (+ v_~c~0_52 v_~x_3~0_36) v_~x_3~0_35)) InVars {~a~0=v_~a~0_43, ~c~0=v_~c~0_52, ~b~0=v_~b~0_35, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_26, ~x_3~0=v_~x_3~0_36} OutVars{~a~0=v_~a~0_43, ~c~0=v_~c~0_52, ~b~0=v_~b~0_35, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_25, ~x_3~0=v_~x_3~0_35, thread3Thread1of1ForFork0_#t~post3=|v_thread3Thread1of1ForFork0_#t~post3_13|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_~i~2, ~x_3~0, thread3Thread1of1ForFork0_#t~post3] [2022-12-06 00:00:21,631 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 00:00:21,631 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 115 [2022-12-06 00:00:21,631 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 77 transitions, 924 flow [2022-12-06 00:00:21,632 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:00:21,632 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:00:21,632 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:00:21,632 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-12-06 00:00:21,632 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-06 00:00:21,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:00:21,632 INFO L85 PathProgramCache]: Analyzing trace with hash 1807388423, now seen corresponding path program 1 times [2022-12-06 00:00:21,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:00:21,633 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421618752] [2022-12-06 00:00:21,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:00:21,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:00:21,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:00:21,734 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-06 00:00:21,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:00:21,735 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421618752] [2022-12-06 00:00:21,735 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1421618752] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:00:21,735 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:00:21,735 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 00:00:21,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752515389] [2022-12-06 00:00:21,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:00:21,736 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 00:00:21,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:00:21,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 00:00:21,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-06 00:00:21,736 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 42 [2022-12-06 00:00:21,736 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 77 transitions, 924 flow. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:00:21,736 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:00:21,737 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 42 [2022-12-06 00:00:21,737 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:00:22,134 INFO L130 PetriNetUnfolder]: 1459/2322 cut-off events. [2022-12-06 00:00:22,134 INFO L131 PetriNetUnfolder]: For 23022/23071 co-relation queries the response was YES. [2022-12-06 00:00:22,141 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12335 conditions, 2322 events. 1459/2322 cut-off events. For 23022/23071 co-relation queries the response was YES. Maximal size of possible extension queue 160. Compared 11790 event pairs, 653 based on Foata normal form. 36/2334 useless extension candidates. Maximal degree in co-relation 11779. Up to 1674 conditions per place. [2022-12-06 00:00:22,151 INFO L137 encePairwiseOnDemand]: 33/42 looper letters, 91 selfloop transitions, 13 changer transitions 0/107 dead transitions. [2022-12-06 00:00:22,151 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 107 transitions, 1281 flow [2022-12-06 00:00:22,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 00:00:22,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 00:00:22,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 77 transitions. [2022-12-06 00:00:22,153 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-06 00:00:22,153 INFO L175 Difference]: Start difference. First operand has 91 places, 77 transitions, 924 flow. Second operand 5 states and 77 transitions. [2022-12-06 00:00:22,153 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 107 transitions, 1281 flow [2022-12-06 00:00:22,201 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 107 transitions, 1243 flow, removed 19 selfloop flow, removed 0 redundant places. [2022-12-06 00:00:22,203 INFO L231 Difference]: Finished difference. Result has 96 places, 77 transitions, 897 flow [2022-12-06 00:00:22,203 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=861, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=897, PETRI_PLACES=96, PETRI_TRANSITIONS=77} [2022-12-06 00:00:22,203 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 67 predicate places. [2022-12-06 00:00:22,203 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:00:22,203 INFO L89 Accepts]: Start accepts. Operand has 96 places, 77 transitions, 897 flow [2022-12-06 00:00:22,204 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:00:22,204 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:00:22,204 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 96 places, 77 transitions, 897 flow [2022-12-06 00:00:22,205 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 96 places, 77 transitions, 897 flow [2022-12-06 00:00:22,235 INFO L130 PetriNetUnfolder]: 106/393 cut-off events. [2022-12-06 00:00:22,236 INFO L131 PetriNetUnfolder]: For 2641/2808 co-relation queries the response was YES. [2022-12-06 00:00:22,237 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1585 conditions, 393 events. 106/393 cut-off events. For 2641/2808 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 2593 event pairs, 6 based on Foata normal form. 17/382 useless extension candidates. Maximal degree in co-relation 1456. Up to 162 conditions per place. [2022-12-06 00:00:22,240 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 96 places, 77 transitions, 897 flow [2022-12-06 00:00:22,240 INFO L188 LiptonReduction]: Number of co-enabled transitions 616 [2022-12-06 00:00:22,243 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [330] L49-5-->L49-5: Formula: (and (< (mod v_thread2Thread1of1ForFork2_~i~1_24 4294967296) (mod v_~b~0_37 4294967296)) (= (+ v_~c~0_54 v_~x_2~0_38) v_~x_2~0_37) (= (+ v_thread2Thread1of1ForFork2_~i~1_24 1) v_thread2Thread1of1ForFork2_~i~1_23)) InVars {thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_24, ~c~0=v_~c~0_54, ~b~0=v_~b~0_37, ~x_2~0=v_~x_2~0_38} OutVars{thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_23, thread2Thread1of1ForFork2_#t~post2=|v_thread2Thread1of1ForFork2_#t~post2_17|, ~c~0=v_~c~0_54, ~b~0=v_~b~0_37, ~x_2~0=v_~x_2~0_37} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_~i~1, thread2Thread1of1ForFork2_#t~post2, ~x_2~0] and [329] L57-5-->L57-5: Formula: (and (< (mod v_thread3Thread1of1ForFork0_~i~2_26 4294967296) (mod (+ v_~a~0_43 v_~b~0_35) 4294967296)) (= (+ v_thread3Thread1of1ForFork0_~i~2_26 1) v_thread3Thread1of1ForFork0_~i~2_25) (= (+ v_~c~0_52 v_~x_3~0_36) v_~x_3~0_35)) InVars {~a~0=v_~a~0_43, ~c~0=v_~c~0_52, ~b~0=v_~b~0_35, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_26, ~x_3~0=v_~x_3~0_36} OutVars{~a~0=v_~a~0_43, ~c~0=v_~c~0_52, ~b~0=v_~b~0_35, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_25, ~x_3~0=v_~x_3~0_35, thread3Thread1of1ForFork0_#t~post3=|v_thread3Thread1of1ForFork0_#t~post3_13|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_~i~2, ~x_3~0, thread3Thread1of1ForFork0_#t~post3] [2022-12-06 00:00:22,291 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [374] L49-5-->thread3EXIT: Formula: (and (= v_thread3Thread1of1ForFork0_~i~2_72 0) (= 0 |v_thread3Thread1of1ForFork0_#res.base_18|) (not (< (mod v_thread2Thread1of1ForFork2_~i~1_96 4294967296) (mod v_~b~0_87 4294967296))) (= |v_thread3Thread1of1ForFork0_#res.offset_18| 0) (not (< (mod v_thread3Thread1of1ForFork0_~i~2_72 4294967296) (mod (+ v_~b~0_87 v_~a~0_101) 4294967296))) (= |v_thread2Thread1of1ForFork2_#res.offset_24| 0) (= |v_thread2Thread1of1ForFork2_#res.base_24| 0)) InVars {~a~0=v_~a~0_101, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_96, ~b~0=v_~b~0_87} OutVars{~a~0=v_~a~0_101, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_96, thread2Thread1of1ForFork2_#res.base=|v_thread2Thread1of1ForFork2_#res.base_24|, ~b~0=v_~b~0_87, thread3Thread1of1ForFork0_#res.offset=|v_thread3Thread1of1ForFork0_#res.offset_18|, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_72, thread3Thread1of1ForFork0_#res.base=|v_thread3Thread1of1ForFork0_#res.base_18|, thread2Thread1of1ForFork2_#res.offset=|v_thread2Thread1of1ForFork2_#res.offset_24|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res.base, thread3Thread1of1ForFork0_#res.offset, thread3Thread1of1ForFork0_~i~2, thread3Thread1of1ForFork0_#res.base, thread2Thread1of1ForFork2_#res.offset] and [377] $Ultimate##0-->L41-5: Formula: (and (= v_thread1Thread1of1ForFork1_~i~0_60 3) (< 2 (mod v_~a~0_103 4294967296)) (= (+ v_~x_1~0_67 (* 3 v_~c~0_104)) v_~x_1~0_65)) InVars {~a~0=v_~a~0_103, ~c~0=v_~c~0_104, ~x_1~0=v_~x_1~0_67} OutVars{~a~0=v_~a~0_103, ~c~0=v_~c~0_104, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_31|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_60, ~x_1~0=v_~x_1~0_65} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_~i~0, ~x_1~0] [2022-12-06 00:00:22,584 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 00:00:22,585 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 382 [2022-12-06 00:00:22,585 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 75 transitions, 894 flow [2022-12-06 00:00:22,585 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:00:22,585 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:00:22,585 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:00:22,585 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-12-06 00:00:22,585 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-06 00:00:22,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:00:22,586 INFO L85 PathProgramCache]: Analyzing trace with hash 18366823, now seen corresponding path program 1 times [2022-12-06 00:00:22,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:00:22,586 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277460458] [2022-12-06 00:00:22,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:00:22,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:00:22,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:00:22,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-06 00:00:22,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:00:22,746 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277460458] [2022-12-06 00:00:22,746 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1277460458] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:00:22,746 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:00:22,746 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 00:00:22,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808404133] [2022-12-06 00:00:22,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:00:22,747 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 00:00:22,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:00:22,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 00:00:22,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 00:00:22,747 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 41 [2022-12-06 00:00:22,747 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 75 transitions, 894 flow. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 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-06 00:00:22,748 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:00:22,748 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 41 [2022-12-06 00:00:22,748 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:00:23,120 INFO L130 PetriNetUnfolder]: 1531/2457 cut-off events. [2022-12-06 00:00:23,120 INFO L131 PetriNetUnfolder]: For 21345/21454 co-relation queries the response was YES. [2022-12-06 00:00:23,129 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13255 conditions, 2457 events. 1531/2457 cut-off events. For 21345/21454 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13094 event pairs, 331 based on Foata normal form. 87/2533 useless extension candidates. Maximal degree in co-relation 12679. Up to 1953 conditions per place. [2022-12-06 00:00:23,139 INFO L137 encePairwiseOnDemand]: 23/41 looper letters, 83 selfloop transitions, 36 changer transitions 5/128 dead transitions. [2022-12-06 00:00:23,140 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 128 transitions, 1516 flow [2022-12-06 00:00:23,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 00:00:23,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 00:00:23,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 94 transitions. [2022-12-06 00:00:23,141 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4585365853658537 [2022-12-06 00:00:23,141 INFO L175 Difference]: Start difference. First operand has 95 places, 75 transitions, 894 flow. Second operand 5 states and 94 transitions. [2022-12-06 00:00:23,141 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 128 transitions, 1516 flow [2022-12-06 00:00:23,191 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 128 transitions, 1470 flow, removed 7 selfloop flow, removed 4 redundant places. [2022-12-06 00:00:23,194 INFO L231 Difference]: Finished difference. Result has 97 places, 91 transitions, 1167 flow [2022-12-06 00:00:23,194 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=860, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1167, PETRI_PLACES=97, PETRI_TRANSITIONS=91} [2022-12-06 00:00:23,194 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 68 predicate places. [2022-12-06 00:00:23,194 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:00:23,195 INFO L89 Accepts]: Start accepts. Operand has 97 places, 91 transitions, 1167 flow [2022-12-06 00:00:23,195 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:00:23,195 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:00:23,195 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 97 places, 91 transitions, 1167 flow [2022-12-06 00:00:23,196 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 97 places, 91 transitions, 1167 flow [2022-12-06 00:00:23,231 INFO L130 PetriNetUnfolder]: 114/427 cut-off events. [2022-12-06 00:00:23,231 INFO L131 PetriNetUnfolder]: For 3257/3386 co-relation queries the response was YES. [2022-12-06 00:00:23,233 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1863 conditions, 427 events. 114/427 cut-off events. For 3257/3386 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2938 event pairs, 2 based on Foata normal form. 23/425 useless extension candidates. Maximal degree in co-relation 1729. Up to 177 conditions per place. [2022-12-06 00:00:23,236 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 97 places, 91 transitions, 1167 flow [2022-12-06 00:00:23,236 INFO L188 LiptonReduction]: Number of co-enabled transitions 730 [2022-12-06 00:00:23,322 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [330] L49-5-->L49-5: Formula: (and (< (mod v_thread2Thread1of1ForFork2_~i~1_24 4294967296) (mod v_~b~0_37 4294967296)) (= (+ v_~c~0_54 v_~x_2~0_38) v_~x_2~0_37) (= (+ v_thread2Thread1of1ForFork2_~i~1_24 1) v_thread2Thread1of1ForFork2_~i~1_23)) InVars {thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_24, ~c~0=v_~c~0_54, ~b~0=v_~b~0_37, ~x_2~0=v_~x_2~0_38} OutVars{thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_23, thread2Thread1of1ForFork2_#t~post2=|v_thread2Thread1of1ForFork2_#t~post2_17|, ~c~0=v_~c~0_54, ~b~0=v_~b~0_37, ~x_2~0=v_~x_2~0_37} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_~i~1, thread2Thread1of1ForFork2_#t~post2, ~x_2~0] and [329] L57-5-->L57-5: Formula: (and (< (mod v_thread3Thread1of1ForFork0_~i~2_26 4294967296) (mod (+ v_~a~0_43 v_~b~0_35) 4294967296)) (= (+ v_thread3Thread1of1ForFork0_~i~2_26 1) v_thread3Thread1of1ForFork0_~i~2_25) (= (+ v_~c~0_52 v_~x_3~0_36) v_~x_3~0_35)) InVars {~a~0=v_~a~0_43, ~c~0=v_~c~0_52, ~b~0=v_~b~0_35, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_26, ~x_3~0=v_~x_3~0_36} OutVars{~a~0=v_~a~0_43, ~c~0=v_~c~0_52, ~b~0=v_~b~0_35, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_25, ~x_3~0=v_~x_3~0_35, thread3Thread1of1ForFork0_#t~post3=|v_thread3Thread1of1ForFork0_#t~post3_13|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_~i~2, ~x_3~0, thread3Thread1of1ForFork0_#t~post3] [2022-12-06 00:00:23,367 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 00:00:23,368 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 174 [2022-12-06 00:00:23,368 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 91 transitions, 1200 flow [2022-12-06 00:00:23,368 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 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-06 00:00:23,368 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:00:23,368 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:00:23,368 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-12-06 00:00:23,368 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-06 00:00:23,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:00:23,369 INFO L85 PathProgramCache]: Analyzing trace with hash -1014931543, now seen corresponding path program 1 times [2022-12-06 00:00:23,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:00:23,369 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919615647] [2022-12-06 00:00:23,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:00:23,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:00:23,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:00:23,465 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-06 00:00:23,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:00:23,465 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919615647] [2022-12-06 00:00:23,465 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [919615647] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:00:23,465 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:00:23,465 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:00:23,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140954935] [2022-12-06 00:00:23,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:00:23,466 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:00:23,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:00:23,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:00:23,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:00:23,467 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:00:23,467 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 91 transitions, 1200 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:00:23,467 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:00:23,467 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:00:23,467 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:00:23,903 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:00:23,904 INFO L131 PetriNetUnfolder]: For 27270/27316 co-relation queries the response was YES. [2022-12-06 00:00:23,914 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14413 conditions, 2583 events. 1614/2583 cut-off events. For 27270/27316 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13550 event pairs, 779 based on Foata normal form. 34/2590 useless extension candidates. Maximal degree in co-relation 13581. Up to 1861 conditions per place. [2022-12-06 00:00:23,927 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:00:23,927 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 112 transitions, 1573 flow [2022-12-06 00:00:23,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:00:23,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:00:23,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:00:23,928 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:00:23,928 INFO L175 Difference]: Start difference. First operand has 97 places, 91 transitions, 1200 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:00:23,928 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 112 transitions, 1573 flow [2022-12-06 00:00:23,982 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 18 selfloop flow, removed 1 redundant places. [2022-12-06 00:00:23,985 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:00:23,985 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:00:23,986 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:00:23,986 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:00:23,986 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:00:23,987 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:00:23,987 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:00:23,987 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:00:23,988 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:00:24,027 INFO L130 PetriNetUnfolder]: 112/426 cut-off events. [2022-12-06 00:00:24,028 INFO L131 PetriNetUnfolder]: For 3048/3187 co-relation queries the response was YES. [2022-12-06 00:00:24,029 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1879 conditions, 426 events. 112/426 cut-off events. For 3048/3187 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 2937 event pairs, 2 based on Foata normal form. 23/423 useless extension candidates. Maximal degree in co-relation 1743. Up to 166 conditions per place. [2022-12-06 00:00:24,033 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:00:24,033 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:00:24,034 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [251] $Ultimate##0-->L57-5: Formula: (= v_thread3Thread1of1ForFork0_~i~2_1 0) InVars {} OutVars{thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_1} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_~i~2] and [387] L49-5-->L57-5: Formula: (and (= v_thread3Thread1of1ForFork0_~i~2_100 (+ v_thread3Thread1of1ForFork0_~i~2_101 1)) (< (mod v_thread2Thread1of1ForFork2_~i~1_127 4294967296) (mod v_~b~0_111 4294967296)) (< (mod v_thread3Thread1of1ForFork0_~i~2_101 4294967296) (mod (+ v_~a~0_121 v_~b~0_111) 4294967296)) (= (+ v_~c~0_124 v_~x_2~0_135) v_~x_2~0_134) (= v_thread2Thread1of1ForFork2_~i~1_126 (+ v_thread2Thread1of1ForFork2_~i~1_127 1)) (= (+ v_~c~0_124 v_~x_3~0_108) v_~x_3~0_107)) InVars {~a~0=v_~a~0_121, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_127, ~c~0=v_~c~0_124, ~b~0=v_~b~0_111, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_101, ~x_2~0=v_~x_2~0_135, ~x_3~0=v_~x_3~0_108} OutVars{~a~0=v_~a~0_121, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_126, thread2Thread1of1ForFork2_#t~post2=|v_thread2Thread1of1ForFork2_#t~post2_68|, ~c~0=v_~c~0_124, ~b~0=v_~b~0_111, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_100, ~x_2~0=v_~x_2~0_134, ~x_3~0=v_~x_3~0_107, thread3Thread1of1ForFork0_#t~post3=|v_thread3Thread1of1ForFork0_#t~post3_53|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_~i~1, thread2Thread1of1ForFork2_#t~post2, thread3Thread1of1ForFork0_~i~2, ~x_2~0, ~x_3~0, thread3Thread1of1ForFork0_#t~post3] [2022-12-06 00:00:24,264 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 00:00:24,264 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 278 [2022-12-06 00:00:24,265 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1193 flow [2022-12-06 00:00:24,265 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:00:24,265 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:00:24,265 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:00:24,265 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-12-06 00:00:24,265 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-06 00:00:24,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:00:24,265 INFO L85 PathProgramCache]: Analyzing trace with hash 1661342501, now seen corresponding path program 1 times [2022-12-06 00:00:24,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:00:24,266 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092838267] [2022-12-06 00:00:24,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:00:24,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:00:24,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:00:24,378 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-06 00:00:24,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:00:24,379 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092838267] [2022-12-06 00:00:24,379 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1092838267] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:00:24,379 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:00:24,379 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:00:24,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742298496] [2022-12-06 00:00:24,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:00:24,379 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:00:24,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:00:24,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:00:24,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:00:24,380 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:00:24,380 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1193 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:00:24,380 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:00:24,380 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:00:24,380 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:00:24,806 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:00:24,807 INFO L131 PetriNetUnfolder]: For 27017/27062 co-relation queries the response was YES. [2022-12-06 00:00:24,814 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14638 conditions, 2583 events. 1614/2583 cut-off events. For 27017/27062 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13519 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13804. Up to 1861 conditions per place. [2022-12-06 00:00:24,824 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:00:24,825 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1566 flow [2022-12-06 00:00:24,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:00:24,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:00:24,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:00:24,826 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:00:24,826 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1193 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:00:24,826 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1566 flow [2022-12-06 00:00:24,876 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 9 selfloop flow, removed 3 redundant places. [2022-12-06 00:00:24,878 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:00:24,878 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:00:24,879 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:00:24,879 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:00:24,879 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:00:24,879 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:00:24,880 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:00:24,880 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:00:24,881 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:00:24,917 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:00:24,917 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 00:00:24,919 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3133/3273 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2980 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:00:24,923 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:00:24,923 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:00:25,102 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:00:25,103 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 224 [2022-12-06 00:00:25,103 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:00:25,103 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:00:25,103 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:00:25,103 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:00:25,103 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-12-06 00:00:25,103 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-06 00:00:25,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:00:25,104 INFO L85 PathProgramCache]: Analyzing trace with hash -890814460, now seen corresponding path program 1 times [2022-12-06 00:00:25,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:00:25,104 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828706644] [2022-12-06 00:00:25,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:00:25,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:00:25,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:00:25,212 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-06 00:00:25,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:00:25,213 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828706644] [2022-12-06 00:00:25,213 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [828706644] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:00:25,213 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:00:25,213 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:00:25,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41016986] [2022-12-06 00:00:25,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:00:25,213 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:00:25,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:00:25,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:00:25,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:00:25,214 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:00:25,214 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:00:25,214 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:00:25,215 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:00:25,215 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:00:25,604 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:00:25,604 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 00:00:25,613 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26969/27014 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13512 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:00:25,625 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:00:25,626 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:00:25,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:00:25,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:00:25,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:00:25,627 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:00:25,627 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:00:25,627 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:00:25,680 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:00:25,682 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:00:25,682 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:00:25,683 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:00:25,683 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:00:25,683 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:00:25,683 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:00:25,684 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:00:25,684 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:00:25,685 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:00:25,727 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:00:25,727 INFO L131 PetriNetUnfolder]: For 3146/3287 co-relation queries the response was YES. [2022-12-06 00:00:25,729 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3146/3287 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2976 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:00:25,732 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:00:25,733 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:00:25,984 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:00:25,985 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 302 [2022-12-06 00:00:25,985 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:00:25,985 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:00:25,985 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:00:25,985 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:00:25,985 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-12-06 00:00:25,985 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-06 00:00:25,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:00:25,986 INFO L85 PathProgramCache]: Analyzing trace with hash 851995875, now seen corresponding path program 1 times [2022-12-06 00:00:25,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:00:25,986 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979144004] [2022-12-06 00:00:25,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:00:25,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:00:26,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:00:26,212 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-06 00:00:26,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:00:26,214 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979144004] [2022-12-06 00:00:26,214 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1979144004] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:00:26,214 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:00:26,214 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:00:26,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617647303] [2022-12-06 00:00:26,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:00:26,214 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:00:26,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:00:26,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:00:26,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:00:26,215 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:00:26,215 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:00:26,215 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:00:26,215 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:00:26,215 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:00:26,611 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:00:26,611 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:00:26,620 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13552 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:00:26,635 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:00:26,635 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:00:26,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:00:26,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:00:26,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:00:26,638 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:00:26,638 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:00:26,638 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:00:26,694 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:00:26,696 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:00:26,697 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:00:26,697 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:00:26,698 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:00:26,698 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:00:26,698 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:00:26,699 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:00:26,699 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:00:26,700 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:00:26,736 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:00:26,736 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 00:00:26,737 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3312/3520 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2993 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:00:26,741 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:00:26,741 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:00:26,932 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:00:26,933 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 235 [2022-12-06 00:00:26,933 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:00:26,933 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:00:26,933 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:00:26,934 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:00:26,934 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-12-06 00:00:26,934 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-06 00:00:26,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:00:26,934 INFO L85 PathProgramCache]: Analyzing trace with hash -1700161086, now seen corresponding path program 1 times [2022-12-06 00:00:26,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:00:26,934 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380641143] [2022-12-06 00:00:26,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:00:26,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:00:26,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:00:27,084 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-06 00:00:27,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:00:27,084 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380641143] [2022-12-06 00:00:27,084 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1380641143] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:00:27,084 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:00:27,084 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:00:27,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817416374] [2022-12-06 00:00:27,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:00:27,085 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:00:27,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:00:27,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:00:27,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:00:27,085 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:00:27,086 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:00:27,086 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:00:27,086 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:00:27,086 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:00:28,179 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:00:28,180 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:00:28,188 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13552 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:00:28,199 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:00:28,200 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:00:28,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:00:28,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:00:28,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:00:28,202 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:00:28,202 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:00:28,202 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:00:28,255 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:00:28,257 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:00:28,257 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:00:28,257 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:00:28,257 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:00:28,257 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:00:28,258 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:00:28,258 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:00:28,258 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:00:28,260 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:00:28,295 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:00:28,295 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 00:00:28,297 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3321/3530 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2984 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:00:28,300 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:00:28,300 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:00:28,498 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:00:28,499 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 242 [2022-12-06 00:00:28,499 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:00:28,499 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:00:28,499 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:00:28,499 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:00:28,500 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-12-06 00:00:28,500 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-06 00:00:28,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:00:28,500 INFO L85 PathProgramCache]: Analyzing trace with hash 42649249, now seen corresponding path program 1 times [2022-12-06 00:00:28,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:00:28,500 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998580046] [2022-12-06 00:00:28,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:00:28,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:00:28,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:00:28,682 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-06 00:00:28,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:00:28,682 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998580046] [2022-12-06 00:00:28,682 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1998580046] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:00:28,682 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:00:28,682 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:00:28,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850241120] [2022-12-06 00:00:28,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:00:28,683 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:00:28,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:00:28,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:00:28,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:00:28,684 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:00:28,684 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:00:28,684 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:00:28,684 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:00:28,684 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:00:29,185 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:00:29,185 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:00:29,193 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13557 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:00:29,203 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:00:29,204 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:00:29,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:00:29,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:00:29,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:00:29,205 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:00:29,205 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:00:29,205 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:00:29,256 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:00:29,258 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:00:29,258 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:00:29,262 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:00:29,262 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:00:29,262 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:00:29,263 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:00:29,263 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:00:29,263 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:00:29,264 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:00:29,298 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:00:29,298 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 00:00:29,300 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3312/3520 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2984 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:00:29,303 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:00:29,303 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:00:29,492 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:00:29,493 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 231 [2022-12-06 00:00:29,493 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:00:29,493 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:00:29,493 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:00:29,493 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:00:29,493 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-12-06 00:00:29,493 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-06 00:00:29,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:00:29,494 INFO L85 PathProgramCache]: Analyzing trace with hash 1785459584, now seen corresponding path program 1 times [2022-12-06 00:00:29,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:00:29,494 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95792195] [2022-12-06 00:00:29,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:00:29,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:00:29,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:00:29,584 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:00:29,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:00:29,584 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95792195] [2022-12-06 00:00:29,585 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [95792195] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:00:29,585 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:00:29,585 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:00:29,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207981721] [2022-12-06 00:00:29,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:00:29,585 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:00:29,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:00:29,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:00:29,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:00:29,586 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:00:29,586 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:00:29,586 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:00:29,586 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:00:29,586 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:00:30,025 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:00:30,025 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:00:30,032 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13533 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:00:30,042 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:00:30,043 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:00:30,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:00:30,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:00:30,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:00:30,044 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:00:30,044 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:00:30,044 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:00:30,090 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:00:30,096 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:00:30,097 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:00:30,099 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:00:30,099 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:00:30,099 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:00:30,100 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:00:30,100 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:00:30,100 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:00:30,101 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:00:30,136 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:00:30,136 INFO L131 PetriNetUnfolder]: For 3338/3547 co-relation queries the response was YES. [2022-12-06 00:00:30,138 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3338/3547 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2989 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:00:30,141 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:00:30,141 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:00:30,694 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:00:30,694 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 595 [2022-12-06 00:00:30,695 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:00:30,695 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:00:30,695 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:00:30,695 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:00:30,695 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-12-06 00:00:30,695 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-06 00:00:30,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:00:30,695 INFO L85 PathProgramCache]: Analyzing trace with hash -766697377, now seen corresponding path program 1 times [2022-12-06 00:00:30,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:00:30,696 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475966479] [2022-12-06 00:00:30,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:00:30,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:00:30,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:00:30,817 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-06 00:00:30,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:00:30,818 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475966479] [2022-12-06 00:00:30,818 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [475966479] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:00:30,818 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:00:30,818 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:00:30,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532398211] [2022-12-06 00:00:30,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:00:30,819 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:00:30,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:00:30,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:00:30,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:00:30,819 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:00:30,819 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:00:30,819 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:00:30,819 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:00:30,820 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:00:31,240 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:00:31,240 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 00:00:31,248 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26969/27014 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13518 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:00:31,287 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:00:31,287 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:00:31,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:00:31,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:00:31,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:00:31,288 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:00:31,288 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:00:31,288 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:00:31,340 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:00:31,343 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:00:31,343 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:00:31,343 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:00:31,344 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:00:31,344 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:00:31,351 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:00:31,351 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:00:31,352 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:00:31,353 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:00:31,426 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:00:31,426 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 00:00:31,428 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3133/3273 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2970 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:00:31,438 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:00:31,438 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:00:31,754 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:00:31,755 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 411 [2022-12-06 00:00:31,755 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:00:31,755 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:00:31,755 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:00:31,755 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:00:31,755 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-12-06 00:00:31,755 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-06 00:00:31,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:00:31,756 INFO L85 PathProgramCache]: Analyzing trace with hash 976112958, now seen corresponding path program 1 times [2022-12-06 00:00:31,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:00:31,756 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172478130] [2022-12-06 00:00:31,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:00:31,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:00:31,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:00:31,876 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-06 00:00:31,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:00:31,876 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172478130] [2022-12-06 00:00:31,877 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [172478130] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:00:31,877 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:00:31,877 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:00:31,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292493296] [2022-12-06 00:00:31,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:00:31,877 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:00:31,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:00:31,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:00:31,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:00:31,878 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:00:31,878 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:00:31,878 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:00:31,878 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:00:31,878 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:00:32,252 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:00:32,253 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:00:32,261 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13577 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:00:32,271 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:00:32,271 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:00:32,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:00:32,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:00:32,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:00:32,272 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:00:32,272 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:00:32,272 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:00:32,324 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:00:32,326 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:00:32,326 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:00:32,327 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:00:32,327 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:00:32,327 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:00:32,327 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:00:32,328 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:00:32,328 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:00:32,329 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:00:32,364 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:00:32,365 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 00:00:32,366 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3312/3520 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2982 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:00:32,369 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:00:32,370 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:00:32,552 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:00:32,553 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 226 [2022-12-06 00:00:32,553 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:00:32,553 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:00:32,553 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:00:32,553 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:00:32,553 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-12-06 00:00:32,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-06 00:00:32,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:00:32,554 INFO L85 PathProgramCache]: Analyzing trace with hash -1576044003, now seen corresponding path program 1 times [2022-12-06 00:00:32,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:00:32,554 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60726847] [2022-12-06 00:00:32,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:00:32,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:00:32,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:00:32,668 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-06 00:00:32,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:00:32,668 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60726847] [2022-12-06 00:00:32,668 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [60726847] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:00:32,668 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:00:32,668 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:00:32,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709397043] [2022-12-06 00:00:32,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:00:32,669 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:00:32,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:00:32,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:00:32,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:00:32,671 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:00:32,671 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:00:32,671 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:00:32,671 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:00:32,671 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:00:33,047 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:00:33,047 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:00:33,055 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13557 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:00:33,066 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:00:33,066 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:00:33,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:00:33,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:00:33,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:00:33,067 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:00:33,068 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:00:33,068 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:00:33,105 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:00:33,107 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:00:33,107 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:00:33,107 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:00:33,107 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:00:33,107 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:00:33,108 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:00:33,108 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:00:33,108 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:00:33,109 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:00:33,139 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:00:33,139 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 00:00:33,141 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3312/3520 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2981 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:00:33,144 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:00:33,144 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:00:33,343 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:00:33,344 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 237 [2022-12-06 00:00:33,344 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:00:33,344 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:00:33,345 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:00:33,345 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:00:33,345 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-12-06 00:00:33,345 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-06 00:00:33,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:00:33,345 INFO L85 PathProgramCache]: Analyzing trace with hash 166766332, now seen corresponding path program 1 times [2022-12-06 00:00:33,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:00:33,346 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222281218] [2022-12-06 00:00:33,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:00:33,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:00:33,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:00:33,444 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-06 00:00:33,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:00:33,445 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222281218] [2022-12-06 00:00:33,445 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1222281218] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:00:33,445 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:00:33,445 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:00:33,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306817939] [2022-12-06 00:00:33,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:00:33,445 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:00:33,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:00:33,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:00:33,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:00:33,446 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:00:33,446 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:00:33,446 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:00:33,446 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:00:33,446 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:00:33,874 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:00:33,874 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:00:33,881 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13548 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:00:33,889 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:00:33,889 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:00:33,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:00:33,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:00:33,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:00:33,890 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:00:33,890 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:00:33,890 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:00:33,935 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:00:33,937 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:00:33,937 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:00:33,937 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:00:33,937 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:00:33,937 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:00:33,938 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:00:33,938 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:00:33,938 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:00:33,939 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:00:33,972 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:00:33,973 INFO L131 PetriNetUnfolder]: For 3348/3558 co-relation queries the response was YES. [2022-12-06 00:00:33,974 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3348/3558 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2978 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:00:33,977 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:00:33,978 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:00:34,176 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:00:34,176 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 239 [2022-12-06 00:00:34,177 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:00:34,177 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:00:34,177 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:00:34,177 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:00:34,177 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-12-06 00:00:34,177 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-06 00:00:34,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:00:34,177 INFO L85 PathProgramCache]: Analyzing trace with hash 1909576667, now seen corresponding path program 1 times [2022-12-06 00:00:34,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:00:34,178 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892408451] [2022-12-06 00:00:34,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:00:34,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:00:34,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:00:34,300 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-06 00:00:34,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:00:34,300 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892408451] [2022-12-06 00:00:34,300 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [892408451] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:00:34,300 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:00:34,300 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:00:34,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224248970] [2022-12-06 00:00:34,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:00:34,301 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:00:34,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:00:34,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:00:34,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:00:34,301 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:00:34,301 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:00:34,302 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:00:34,302 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:00:34,302 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:00:34,659 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:00:34,659 INFO L131 PetriNetUnfolder]: For 27229/27274 co-relation queries the response was YES. [2022-12-06 00:00:34,665 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27229/27274 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13562 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:00:34,673 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:00:34,673 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:00:34,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:00:34,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:00:34,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:00:34,675 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:00:34,675 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:00:34,675 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:00:34,715 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:00:34,717 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:00:34,717 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:00:34,718 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:00:34,718 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:00:34,718 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:00:34,719 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:00:34,719 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:00:34,719 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:00:34,720 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:00:34,750 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:00:34,750 INFO L131 PetriNetUnfolder]: For 3293/3500 co-relation queries the response was YES. [2022-12-06 00:00:34,751 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3293/3500 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2978 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:00:34,754 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:00:34,754 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:00:34,936 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:00:34,937 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 219 [2022-12-06 00:00:34,937 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:00:34,937 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:00:34,937 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:00:34,937 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:00:34,937 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-12-06 00:00:34,937 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-06 00:00:34,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:00:34,938 INFO L85 PathProgramCache]: Analyzing trace with hash -642580294, now seen corresponding path program 1 times [2022-12-06 00:00:34,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:00:34,938 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548739385] [2022-12-06 00:00:34,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:00:34,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:00:34,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:00:35,035 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-06 00:00:35,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:00:35,035 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548739385] [2022-12-06 00:00:35,035 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1548739385] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:00:35,035 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:00:35,035 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:00:35,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058112233] [2022-12-06 00:00:35,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:00:35,036 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:00:35,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:00:35,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:00:35,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:00:35,036 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:00:35,036 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:00:35,037 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:00:35,037 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:00:35,037 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:00:35,418 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:00:35,418 INFO L131 PetriNetUnfolder]: For 27136/27181 co-relation queries the response was YES. [2022-12-06 00:00:35,426 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27136/27181 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13516 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:00:35,435 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:00:35,436 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:00:35,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:00:35,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:00:35,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:00:35,437 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:00:35,437 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:00:35,437 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:00:35,484 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:00:35,486 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:00:35,486 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:00:35,487 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:00:35,488 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:00:35,488 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:00:35,488 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:00:35,489 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:00:35,489 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:00:35,489 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:00:35,524 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:00:35,524 INFO L131 PetriNetUnfolder]: For 3156/3296 co-relation queries the response was YES. [2022-12-06 00:00:35,525 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3156/3296 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2989 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:00:35,530 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:00:35,530 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:00:35,672 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:00:35,673 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 186 [2022-12-06 00:00:35,673 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:00:35,673 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:00:35,673 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:00:35,673 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:00:35,674 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-12-06 00:00:35,674 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-06 00:00:35,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:00:35,674 INFO L85 PathProgramCache]: Analyzing trace with hash 1100230041, now seen corresponding path program 1 times [2022-12-06 00:00:35,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:00:35,674 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325318942] [2022-12-06 00:00:35,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:00:35,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:00:35,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:00:35,769 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-06 00:00:35,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:00:35,770 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325318942] [2022-12-06 00:00:35,770 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [325318942] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:00:35,770 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:00:35,770 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:00:35,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593747901] [2022-12-06 00:00:35,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:00:35,770 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:00:35,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:00:35,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:00:35,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:00:35,771 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:00:35,771 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:00:35,771 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:00:35,772 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:00:35,772 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:00:36,198 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:00:36,198 INFO L131 PetriNetUnfolder]: For 27136/27181 co-relation queries the response was YES. [2022-12-06 00:00:36,205 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27136/27181 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13559 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:00:36,212 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:00:36,213 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:00:36,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:00:36,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:00:36,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:00:36,214 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:00:36,214 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:00:36,214 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:00:36,256 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:00:36,265 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:00:36,265 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:00:36,266 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:00:36,266 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:00:36,266 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:00:36,267 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:00:36,267 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:00:36,269 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:00:36,271 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:00:36,300 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:00:36,301 INFO L131 PetriNetUnfolder]: For 3167/3307 co-relation queries the response was YES. [2022-12-06 00:00:36,302 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3167/3307 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2996 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:00:36,304 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:00:36,304 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:00:36,480 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:00:36,481 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 215 [2022-12-06 00:00:36,481 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:00:36,481 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:00:36,481 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:00:36,481 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:00:36,481 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-12-06 00:00:36,481 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-06 00:00:36,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:00:36,482 INFO L85 PathProgramCache]: Analyzing trace with hash -1451926920, now seen corresponding path program 1 times [2022-12-06 00:00:36,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:00:36,482 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978479957] [2022-12-06 00:00:36,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:00:36,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:00:36,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:00:36,565 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-06 00:00:36,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:00:36,566 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978479957] [2022-12-06 00:00:36,566 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1978479957] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:00:36,566 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:00:36,566 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:00:36,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142975667] [2022-12-06 00:00:36,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:00:36,567 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:00:36,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:00:36,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:00:36,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:00:36,567 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:00:36,567 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:00:36,567 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:00:36,567 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:00:36,568 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:00:36,948 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:00:36,948 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:00:36,956 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13575 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:00:36,967 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:00:36,967 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:00:36,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:00:36,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:00:36,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:00:36,989 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:00:36,989 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:00:36,989 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:00:37,041 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:00:37,044 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:00:37,044 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:00:37,045 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:00:37,045 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:00:37,045 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:00:37,046 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:00:37,046 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:00:37,046 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:00:37,047 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:00:37,095 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:00:37,095 INFO L131 PetriNetUnfolder]: For 3349/3561 co-relation queries the response was YES. [2022-12-06 00:00:37,097 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3349/3561 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2965 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:00:37,100 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:00:37,100 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:00:37,355 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:00:37,356 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 311 [2022-12-06 00:00:37,356 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:00:37,356 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:00:37,356 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:00:37,356 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:00:37,356 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2022-12-06 00:00:37,356 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-06 00:00:37,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:00:37,356 INFO L85 PathProgramCache]: Analyzing trace with hash 290883415, now seen corresponding path program 1 times [2022-12-06 00:00:37,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:00:37,357 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073369041] [2022-12-06 00:00:37,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:00:37,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:00:37,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:00:37,453 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-06 00:00:37,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:00:37,454 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073369041] [2022-12-06 00:00:37,454 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1073369041] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:00:37,454 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:00:37,454 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:00:37,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931091692] [2022-12-06 00:00:37,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:00:37,455 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:00:37,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:00:37,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:00:37,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:00:37,456 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:00:37,456 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:00:37,456 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:00:37,456 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:00:37,456 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:00:37,760 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:00:37,760 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:00:37,765 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13564 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:00:37,772 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:00:37,772 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:00:37,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:00:37,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:00:37,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:00:37,773 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:00:37,773 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:00:37,773 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:00:37,809 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:00:37,811 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:00:37,811 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:00:37,811 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:00:37,811 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:00:37,811 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:00:37,812 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:00:37,812 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:00:37,812 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:00:37,812 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:00:37,837 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:00:37,837 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 00:00:37,838 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3312/3520 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2983 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:00:37,841 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:00:37,841 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:00:38,012 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:00:38,012 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 201 [2022-12-06 00:00:38,013 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:00:38,013 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:00:38,013 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:00:38,013 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:00:38,013 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2022-12-06 00:00:38,013 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-06 00:00:38,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:00:38,013 INFO L85 PathProgramCache]: Analyzing trace with hash 2033693750, now seen corresponding path program 1 times [2022-12-06 00:00:38,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:00:38,014 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83641661] [2022-12-06 00:00:38,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:00:38,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:00:38,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:00:38,123 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-06 00:00:38,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:00:38,123 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83641661] [2022-12-06 00:00:38,123 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [83641661] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:00:38,123 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:00:38,123 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:00:38,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043838507] [2022-12-06 00:00:38,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:00:38,124 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:00:38,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:00:38,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:00:38,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:00:38,124 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:00:38,124 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:00:38,124 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:00:38,125 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:00:38,125 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:00:38,505 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:00:38,505 INFO L131 PetriNetUnfolder]: For 27229/27274 co-relation queries the response was YES. [2022-12-06 00:00:38,510 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27229/27274 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13534 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:00:38,516 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:00:38,516 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:00:38,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:00:38,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:00:38,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:00:38,517 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:00:38,517 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:00:38,517 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:00:38,550 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:00:38,551 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:00:38,552 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:00:38,552 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:00:38,552 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:00:38,552 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:00:38,553 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:00:38,553 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:00:38,553 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:00:38,554 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:00:38,588 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:00:38,588 INFO L131 PetriNetUnfolder]: For 3301/3509 co-relation queries the response was YES. [2022-12-06 00:00:38,590 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3301/3509 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2984 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:00:38,592 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:00:38,592 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:00:38,790 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:00:38,791 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 239 [2022-12-06 00:00:38,791 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:00:38,791 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:00:38,791 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:00:38,792 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:00:38,792 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2022-12-06 00:00:38,792 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-06 00:00:38,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:00:38,792 INFO L85 PathProgramCache]: Analyzing trace with hash -518463211, now seen corresponding path program 1 times [2022-12-06 00:00:38,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:00:38,792 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073406541] [2022-12-06 00:00:38,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:00:38,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:00:38,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:00:38,904 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-06 00:00:38,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:00:38,905 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073406541] [2022-12-06 00:00:38,905 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1073406541] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:00:38,905 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:00:38,905 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:00:38,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739410153] [2022-12-06 00:00:38,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:00:38,905 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:00:38,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:00:38,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:00:38,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:00:38,906 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:00:38,906 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:00:38,906 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:00:38,906 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:00:38,906 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:00:39,231 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:00:39,231 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 00:00:39,239 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26969/27014 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13561 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:00:39,250 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:00:39,251 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:00:39,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:00:39,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:00:39,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:00:39,252 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:00:39,252 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:00:39,252 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:00:39,303 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:00:39,305 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:00:39,305 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:00:39,307 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:00:39,307 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:00:39,307 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:00:39,307 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:00:39,309 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:00:39,309 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:00:39,310 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:00:39,344 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:00:39,344 INFO L131 PetriNetUnfolder]: For 3122/3262 co-relation queries the response was YES. [2022-12-06 00:00:39,345 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3122/3262 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2987 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:00:39,348 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:00:39,348 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:00:39,500 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:00:39,501 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 194 [2022-12-06 00:00:39,501 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:00:39,502 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:00:39,502 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:00:39,502 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:00:39,502 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2022-12-06 00:00:39,503 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-06 00:00:39,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:00:39,503 INFO L85 PathProgramCache]: Analyzing trace with hash 1224347124, now seen corresponding path program 1 times [2022-12-06 00:00:39,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:00:39,503 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007896790] [2022-12-06 00:00:39,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:00:39,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:00:39,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:00:39,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-06 00:00:39,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:00:39,633 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007896790] [2022-12-06 00:00:39,633 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1007896790] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:00:39,633 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:00:39,633 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:00:39,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501625755] [2022-12-06 00:00:39,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:00:39,634 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:00:39,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:00:39,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:00:39,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:00:39,634 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:00:39,635 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:00:39,635 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:00:39,635 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:00:39,635 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:00:39,954 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:00:39,954 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:00:39,960 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13539 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:00:39,967 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:00:39,968 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:00:39,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:00:39,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:00:39,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:00:39,969 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:00:39,969 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:00:39,970 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:00:40,008 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:00:40,009 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:00:40,010 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:00:40,010 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:00:40,010 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:00:40,010 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:00:40,011 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:00:40,011 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:00:40,011 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:00:40,011 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:00:40,036 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:00:40,036 INFO L131 PetriNetUnfolder]: For 3337/3547 co-relation queries the response was YES. [2022-12-06 00:00:40,037 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3337/3547 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2982 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:00:40,039 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:00:40,039 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:00:40,204 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:00:40,205 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 195 [2022-12-06 00:00:40,205 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:00:40,205 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:00:40,205 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:00:40,205 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:00:40,205 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2022-12-06 00:00:40,205 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-06 00:00:40,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:00:40,205 INFO L85 PathProgramCache]: Analyzing trace with hash -1327809837, now seen corresponding path program 1 times [2022-12-06 00:00:40,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:00:40,206 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718345562] [2022-12-06 00:00:40,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:00:40,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:00:40,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:00:40,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-06 00:00:40,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:00:40,308 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718345562] [2022-12-06 00:00:40,308 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1718345562] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:00:40,308 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:00:40,308 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:00:40,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862692623] [2022-12-06 00:00:40,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:00:40,309 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:00:40,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:00:40,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:00:40,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:00:40,309 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:00:40,310 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:00:40,310 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:00:40,310 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:00:40,310 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:00:40,679 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:00:40,679 INFO L131 PetriNetUnfolder]: For 27136/27181 co-relation queries the response was YES. [2022-12-06 00:00:40,686 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27136/27181 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13522 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:00:40,695 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:00:40,696 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:00:40,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:00:40,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:00:40,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:00:40,697 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:00:40,697 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:00:40,697 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:00:40,743 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:00:40,748 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:00:40,748 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:00:40,749 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:00:40,749 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:00:40,750 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:00:40,750 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:00:40,750 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:00:40,750 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:00:40,751 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:00:40,795 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:00:40,796 INFO L131 PetriNetUnfolder]: For 3168/3309 co-relation queries the response was YES. [2022-12-06 00:00:40,797 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3168/3309 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 3003 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:00:40,800 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:00:40,800 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:00:40,963 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:00:40,964 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 215 [2022-12-06 00:00:40,964 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:00:40,964 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:00:40,964 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:00:40,964 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:00:40,965 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2022-12-06 00:00:40,965 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-06 00:00:40,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:00:40,965 INFO L85 PathProgramCache]: Analyzing trace with hash 415000498, now seen corresponding path program 1 times [2022-12-06 00:00:40,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:00:40,965 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266448802] [2022-12-06 00:00:40,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:00:40,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:00:40,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:00:41,057 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-06 00:00:41,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:00:41,057 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266448802] [2022-12-06 00:00:41,057 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [266448802] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:00:41,057 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:00:41,057 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:00:41,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56031006] [2022-12-06 00:00:41,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:00:41,058 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:00:41,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:00:41,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:00:41,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:00:41,059 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:00:41,059 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:00:41,060 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:00:41,060 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:00:41,060 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:00:41,353 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:00:41,353 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:00:41,360 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13559 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:00:41,369 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:00:41,369 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:00:41,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:00:41,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:00:41,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:00:41,370 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:00:41,370 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:00:41,370 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:00:41,407 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:00:41,409 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:00:41,409 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:00:41,409 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:00:41,410 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:00:41,410 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:00:41,410 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:00:41,410 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:00:41,411 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:00:41,411 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:00:41,437 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:00:41,437 INFO L131 PetriNetUnfolder]: For 3301/3509 co-relation queries the response was YES. [2022-12-06 00:00:41,439 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3301/3509 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2983 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:00:41,441 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:00:41,442 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:00:41,604 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:00:41,606 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 196 [2022-12-06 00:00:41,606 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:00:41,606 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:00:41,606 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:00:41,606 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:00:41,607 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2022-12-06 00:00:41,607 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-06 00:00:41,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:00:41,607 INFO L85 PathProgramCache]: Analyzing trace with hash -2137156463, now seen corresponding path program 1 times [2022-12-06 00:00:41,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:00:41,607 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705804887] [2022-12-06 00:00:41,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:00:41,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:00:41,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:00:41,711 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-06 00:00:41,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:00:41,711 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705804887] [2022-12-06 00:00:41,711 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [705804887] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:00:41,712 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:00:41,712 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:00:41,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877731340] [2022-12-06 00:00:41,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:00:41,712 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:00:41,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:00:41,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:00:41,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:00:41,713 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:00:41,713 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:00:41,713 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:00:41,713 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:00:41,713 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:00:42,049 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:00:42,049 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 00:00:42,055 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13556 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:00:42,063 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:00:42,063 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:00:42,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:00:42,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:00:42,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:00:42,064 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:00:42,064 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:00:42,064 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:00:42,121 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:00:42,123 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:00:42,123 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:00:42,124 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:00:42,124 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:00:42,124 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:00:42,124 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:00:42,124 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:00:42,124 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:00:42,125 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:00:42,150 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:00:42,150 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 00:00:42,151 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3312/3520 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2980 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:00:42,153 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:00:42,153 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:00:42,297 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:00:42,297 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 173 [2022-12-06 00:00:42,297 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:00:42,297 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:00:42,298 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:00:42,298 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:00:42,298 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2022-12-06 00:00:42,298 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-06 00:00:42,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:00:42,298 INFO L85 PathProgramCache]: Analyzing trace with hash -394346128, now seen corresponding path program 1 times [2022-12-06 00:00:42,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:00:42,298 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821288486] [2022-12-06 00:00:42,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:00:42,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:00:42,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:00:42,386 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:00:42,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:00:42,386 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821288486] [2022-12-06 00:00:42,386 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [821288486] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:00:42,386 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:00:42,387 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:00:42,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005211658] [2022-12-06 00:00:42,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:00:42,387 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:00:42,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:00:42,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:00:42,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:00:42,387 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:00:42,388 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:00:42,388 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:00:42,388 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:00:42,388 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:00:42,697 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:00:42,697 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 00:00:42,704 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26965/27010 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13529 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:00:42,713 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:00:42,714 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:00:42,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:00:42,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:00:42,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:00:42,715 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:00:42,715 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:00:42,715 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:00:42,757 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:00:42,759 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:00:42,759 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:00:42,759 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:00:42,759 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:00:42,759 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:00:42,760 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:00:42,760 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:00:42,760 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:00:42,761 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:00:42,790 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:00:42,790 INFO L131 PetriNetUnfolder]: For 3146/3287 co-relation queries the response was YES. [2022-12-06 00:00:42,792 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3146/3287 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2984 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:00:42,795 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:00:42,795 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:00:42,969 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:00:42,970 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 211 [2022-12-06 00:00:42,970 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:00:42,970 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:00:42,970 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:00:42,970 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:00:42,970 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2022-12-06 00:00:42,970 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-06 00:00:42,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:00:42,971 INFO L85 PathProgramCache]: Analyzing trace with hash 1348464207, now seen corresponding path program 1 times [2022-12-06 00:00:42,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:00:42,971 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191794994] [2022-12-06 00:00:42,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:00:42,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:00:43,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:00:43,089 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-06 00:00:43,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:00:43,090 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191794994] [2022-12-06 00:00:43,090 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1191794994] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:00:43,090 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:00:43,090 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:00:43,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796066492] [2022-12-06 00:00:43,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:00:43,093 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:00:43,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:00:43,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:00:43,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:00:43,093 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:00:43,093 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:00:43,093 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:00:43,094 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:00:43,094 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:00:43,513 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:00:43,513 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:00:43,521 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13573 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:00:43,530 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:00:43,531 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:00:43,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:00:43,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:00:43,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:00:43,532 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:00:43,532 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:00:43,532 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:00:43,576 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:00:43,577 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:00:43,578 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:00:43,578 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:00:43,578 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:00:43,578 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:00:43,579 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:00:43,579 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:00:43,579 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:00:43,580 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:00:43,614 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:00:43,614 INFO L131 PetriNetUnfolder]: For 3298/3507 co-relation queries the response was YES. [2022-12-06 00:00:43,616 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3298/3507 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2978 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:00:43,619 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:00:43,619 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:00:43,846 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:00:43,847 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 269 [2022-12-06 00:00:43,847 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:00:43,847 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:00:43,847 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:00:43,847 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:00:43,847 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2022-12-06 00:00:43,848 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-06 00:00:43,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:00:43,848 INFO L85 PathProgramCache]: Analyzing trace with hash -1203692754, now seen corresponding path program 1 times [2022-12-06 00:00:43,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:00:43,848 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509998445] [2022-12-06 00:00:43,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:00:43,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:00:43,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:00:43,931 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-06 00:00:43,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:00:43,931 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509998445] [2022-12-06 00:00:43,932 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [509998445] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:00:43,932 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:00:43,932 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:00:43,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123021189] [2022-12-06 00:00:43,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:00:43,932 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:00:43,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:00:43,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:00:43,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:00:43,933 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:00:43,933 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:00:43,933 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:00:43,934 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:00:43,934 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:00:44,259 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:00:44,259 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 00:00:44,265 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13567 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:00:44,272 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:00:44,272 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:00:44,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:00:44,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:00:44,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:00:44,273 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:00:44,273 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:00:44,273 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:00:44,306 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:00:44,308 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:00:44,308 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:00:44,308 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:00:44,308 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:00:44,308 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:00:44,309 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:00:44,309 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:00:44,309 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:00:44,310 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:00:44,336 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:00:44,336 INFO L131 PetriNetUnfolder]: For 3301/3509 co-relation queries the response was YES. [2022-12-06 00:00:44,337 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3301/3509 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2993 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:00:44,339 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:00:44,339 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:00:44,509 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:00:44,509 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 201 [2022-12-06 00:00:44,510 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:00:44,510 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:00:44,510 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:00:44,510 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:00:44,510 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2022-12-06 00:00:44,510 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-06 00:00:44,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:00:44,510 INFO L85 PathProgramCache]: Analyzing trace with hash 539117581, now seen corresponding path program 1 times [2022-12-06 00:00:44,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:00:44,511 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418657975] [2022-12-06 00:00:44,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:00:44,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:00:44,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:00:44,606 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-06 00:00:44,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:00:44,606 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418657975] [2022-12-06 00:00:44,606 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [418657975] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:00:44,606 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:00:44,606 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:00:44,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990406350] [2022-12-06 00:00:44,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:00:44,607 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:00:44,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:00:44,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:00:44,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:00:44,607 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:00:44,607 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:00:44,607 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:00:44,608 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:00:44,608 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:00:44,972 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:00:44,973 INFO L131 PetriNetUnfolder]: For 27136/27181 co-relation queries the response was YES. [2022-12-06 00:00:44,981 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27136/27181 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13513 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:00:44,990 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:00:44,991 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:00:44,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:00:44,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:00:44,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:00:44,992 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:00:44,992 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:00:44,992 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:00:45,040 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:00:45,042 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:00:45,042 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:00:45,043 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:00:45,043 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:00:45,043 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:00:45,044 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:00:45,044 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:00:45,044 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:00:45,045 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:00:45,080 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:00:45,080 INFO L131 PetriNetUnfolder]: For 3156/3296 co-relation queries the response was YES. [2022-12-06 00:00:45,082 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3156/3296 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2987 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:00:45,084 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:00:45,085 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:00:45,243 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:00:45,243 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 200 [2022-12-06 00:00:45,243 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:00:45,244 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:00:45,244 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:00:45,244 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:00:45,244 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2022-12-06 00:00:45,244 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-06 00:00:45,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:00:45,244 INFO L85 PathProgramCache]: Analyzing trace with hash -2013039380, now seen corresponding path program 1 times [2022-12-06 00:00:45,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:00:45,244 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388757905] [2022-12-06 00:00:45,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:00:45,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:00:45,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:00:45,330 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-06 00:00:45,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:00:45,331 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388757905] [2022-12-06 00:00:45,331 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [388757905] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:00:45,331 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:00:45,331 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:00:45,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633685406] [2022-12-06 00:00:45,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:00:45,331 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:00:45,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:00:45,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:00:45,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:00:45,332 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:00:45,332 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:00:45,332 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:00:45,332 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:00:45,332 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:00:45,644 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:00:45,645 INFO L131 PetriNetUnfolder]: For 27136/27181 co-relation queries the response was YES. [2022-12-06 00:00:45,650 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27136/27181 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13532 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:00:45,657 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:00:45,657 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:00:45,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:00:45,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:00:45,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:00:45,658 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:00:45,658 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:00:45,658 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:00:45,692 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:00:45,694 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:00:45,695 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:00:45,695 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:00:45,695 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:00:45,695 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:00:45,696 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:00:45,696 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:00:45,696 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:00:45,697 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:00:45,731 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:00:45,731 INFO L131 PetriNetUnfolder]: For 3175/3318 co-relation queries the response was YES. [2022-12-06 00:00:45,733 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3175/3318 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2999 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:00:45,735 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:00:45,735 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:00:45,884 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:00:45,884 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 189 [2022-12-06 00:00:45,884 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:00:45,885 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:00:45,885 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:00:45,885 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:00:45,885 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2022-12-06 00:00:45,885 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-06 00:00:45,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:00:45,885 INFO L85 PathProgramCache]: Analyzing trace with hash -270229045, now seen corresponding path program 1 times [2022-12-06 00:00:45,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:00:45,885 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243040097] [2022-12-06 00:00:45,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:00:45,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:00:45,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:00:45,970 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-06 00:00:45,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:00:45,971 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243040097] [2022-12-06 00:00:45,971 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [243040097] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:00:45,971 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:00:45,971 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:00:45,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991060989] [2022-12-06 00:00:45,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:00:45,971 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:00:45,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:00:45,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:00:45,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:00:45,972 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:00:45,972 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:00:45,972 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:00:45,972 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:00:45,972 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:00:46,311 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:00:46,311 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:00:46,316 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13569 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:00:46,324 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:00:46,324 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:00:46,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:00:46,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:00:46,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:00:46,325 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:00:46,325 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:00:46,325 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:00:46,373 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:00:46,375 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:00:46,375 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:00:46,375 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:00:46,375 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:00:46,375 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:00:46,376 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:00:46,376 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:00:46,376 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:00:46,377 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:00:46,403 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:00:46,404 INFO L131 PetriNetUnfolder]: For 3309/3518 co-relation queries the response was YES. [2022-12-06 00:00:46,405 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3309/3518 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2984 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:00:46,407 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:00:46,407 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:00:46,589 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:00:46,590 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 215 [2022-12-06 00:00:46,590 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:00:46,591 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:00:46,591 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:00:46,591 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:00:46,591 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2022-12-06 00:00:46,591 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-06 00:00:46,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:00:46,591 INFO L85 PathProgramCache]: Analyzing trace with hash 1472581290, now seen corresponding path program 1 times [2022-12-06 00:00:46,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:00:46,592 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836049328] [2022-12-06 00:00:46,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:00:46,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:00:46,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:00:46,743 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-06 00:00:46,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:00:46,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836049328] [2022-12-06 00:00:46,744 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1836049328] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:00:46,744 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:00:46,744 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:00:46,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330801512] [2022-12-06 00:00:46,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:00:46,744 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:00:46,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:00:46,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:00:46,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:00:46,745 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:00:46,745 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:00:46,745 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:00:46,745 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:00:46,745 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:00:47,072 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:00:47,072 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:00:47,078 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13541 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:00:47,085 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:00:47,085 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:00:47,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:00:47,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:00:47,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:00:47,086 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:00:47,086 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:00:47,086 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:00:47,119 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:00:47,121 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:00:47,121 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:00:47,121 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:00:47,121 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:00:47,121 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:00:47,122 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:00:47,122 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:00:47,122 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:00:47,122 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:00:47,147 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:00:47,147 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 00:00:47,149 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3321/3530 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2983 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:00:47,151 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:00:47,152 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:00:47,314 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:00:47,315 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 194 [2022-12-06 00:00:47,315 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:00:47,315 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:00:47,315 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:00:47,315 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:00:47,316 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2022-12-06 00:00:47,316 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-06 00:00:47,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:00:47,316 INFO L85 PathProgramCache]: Analyzing trace with hash -1079575671, now seen corresponding path program 1 times [2022-12-06 00:00:47,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:00:47,316 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124205739] [2022-12-06 00:00:47,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:00:47,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:00:47,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:00:47,417 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-06 00:00:47,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:00:47,417 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124205739] [2022-12-06 00:00:47,417 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1124205739] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:00:47,417 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:00:47,417 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:00:47,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115985863] [2022-12-06 00:00:47,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:00:47,418 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:00:47,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:00:47,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:00:47,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:00:47,418 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:00:47,418 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:00:47,419 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:00:47,419 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:00:47,419 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:00:47,686 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:00:47,686 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:00:47,692 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13564 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:00:47,699 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:00:47,700 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:00:47,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:00:47,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:00:47,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:00:47,701 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:00:47,701 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:00:47,701 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:00:47,742 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:00:47,744 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:00:47,744 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:00:47,744 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:00:47,744 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:00:47,744 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:00:47,745 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:00:47,745 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:00:47,745 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:00:47,745 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:00:47,771 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:00:47,771 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 00:00:47,772 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3321/3530 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2985 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:00:47,774 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:00:47,774 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:00:47,947 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:00:47,948 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 204 [2022-12-06 00:00:47,948 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:00:47,948 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:00:47,949 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:00:47,949 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:00:47,949 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2022-12-06 00:00:47,949 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-06 00:00:47,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:00:47,949 INFO L85 PathProgramCache]: Analyzing trace with hash 663234664, now seen corresponding path program 1 times [2022-12-06 00:00:47,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:00:47,949 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134021353] [2022-12-06 00:00:47,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:00:47,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:00:47,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:00:48,024 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-06 00:00:48,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:00:48,024 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134021353] [2022-12-06 00:00:48,024 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2134021353] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:00:48,024 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:00:48,025 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:00:48,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029789865] [2022-12-06 00:00:48,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:00:48,025 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:00:48,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:00:48,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:00:48,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:00:48,026 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:00:48,026 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:00:48,026 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:00:48,026 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:00:48,026 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:00:48,390 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:00:48,390 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 00:00:48,398 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26969/27014 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13536 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:00:48,407 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:00:48,407 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:00:48,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:00:48,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:00:48,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:00:48,409 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:00:48,409 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:00:48,409 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:00:48,454 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:00:48,455 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:00:48,456 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:00:48,456 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:00:48,456 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:00:48,456 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:00:48,456 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:00:48,456 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:00:48,457 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:00:48,457 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:00:48,491 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:00:48,491 INFO L131 PetriNetUnfolder]: For 3146/3287 co-relation queries the response was YES. [2022-12-06 00:00:48,492 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3146/3287 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2977 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:00:48,495 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:00:48,495 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:00:48,659 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:00:48,660 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 204 [2022-12-06 00:00:48,660 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:00:48,660 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:00:48,660 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:00:48,660 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:00:48,660 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2022-12-06 00:00:48,660 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-06 00:00:48,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:00:48,660 INFO L85 PathProgramCache]: Analyzing trace with hash -1888922297, now seen corresponding path program 1 times [2022-12-06 00:00:48,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:00:48,661 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035876537] [2022-12-06 00:00:48,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:00:48,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:00:48,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:00:48,757 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-06 00:00:48,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:00:48,757 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035876537] [2022-12-06 00:00:48,757 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2035876537] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:00:48,757 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:00:48,757 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:00:48,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079309612] [2022-12-06 00:00:48,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:00:48,757 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:00:48,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:00:48,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:00:48,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:00:48,758 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:00:48,758 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:00:48,758 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:00:48,758 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:00:48,758 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:00:49,056 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:00:49,056 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:00:49,062 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13570 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:00:49,070 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:00:49,070 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:00:49,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:00:49,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:00:49,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:00:49,071 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:00:49,071 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:00:49,072 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:00:49,114 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:00:49,116 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:00:49,116 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:00:49,117 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:00:49,117 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:00:49,117 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:00:49,118 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:00:49,118 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:00:49,118 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:00:49,119 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:00:49,148 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:00:49,148 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 00:00:49,149 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3312/3520 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2982 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:00:49,152 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:00:49,152 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:00:49,329 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:00:49,332 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 215 [2022-12-06 00:00:49,332 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:00:49,332 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:00:49,332 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:00:49,332 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:00:49,332 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2022-12-06 00:00:49,333 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-06 00:00:49,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:00:49,333 INFO L85 PathProgramCache]: Analyzing trace with hash -146111962, now seen corresponding path program 1 times [2022-12-06 00:00:49,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:00:49,333 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684871832] [2022-12-06 00:00:49,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:00:49,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:00:49,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:00:49,424 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-06 00:00:49,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:00:49,425 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684871832] [2022-12-06 00:00:49,425 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1684871832] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:00:49,425 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:00:49,425 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:00:49,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747073786] [2022-12-06 00:00:49,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:00:49,425 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:00:49,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:00:49,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:00:49,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:00:49,426 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:00:49,426 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:00:49,426 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:00:49,426 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:00:49,426 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:00:49,756 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:00:49,757 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 00:00:49,761 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26969/27014 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13526 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:00:49,766 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:00:49,766 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:00:49,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:00:49,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:00:49,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:00:49,767 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:00:49,767 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:00:49,767 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:00:49,797 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:00:49,799 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:00:49,799 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:00:49,799 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:00:49,799 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:00:49,799 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:00:49,800 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:00:49,800 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:00:49,800 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:00:49,801 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:00:49,826 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:00:49,826 INFO L131 PetriNetUnfolder]: For 3122/3262 co-relation queries the response was YES. [2022-12-06 00:00:49,827 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3122/3262 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2972 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:00:49,829 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:00:49,829 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:00:50,157 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:00:50,158 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 359 [2022-12-06 00:00:50,158 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:00:50,158 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:00:50,158 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:00:50,158 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:00:50,158 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2022-12-06 00:00:50,159 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-06 00:00:50,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:00:50,159 INFO L85 PathProgramCache]: Analyzing trace with hash 1596698373, now seen corresponding path program 1 times [2022-12-06 00:00:50,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:00:50,159 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353818810] [2022-12-06 00:00:50,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:00:50,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:00:50,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:00:50,268 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-06 00:00:50,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:00:50,269 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353818810] [2022-12-06 00:00:50,269 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1353818810] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:00:50,269 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:00:50,269 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:00:50,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136422988] [2022-12-06 00:00:50,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:00:50,269 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:00:50,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:00:50,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:00:50,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:00:50,270 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:00:50,270 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:00:50,270 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:00:50,270 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:00:50,270 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:00:50,761 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:00:50,761 INFO L131 PetriNetUnfolder]: For 26955/27000 co-relation queries the response was YES. [2022-12-06 00:00:50,772 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26955/27000 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13523 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:00:50,786 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:00:50,786 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:00:50,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:00:50,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:00:50,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:00:50,787 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:00:50,787 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:00:50,788 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:00:50,835 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:00:50,837 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:00:50,837 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:00:50,838 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:00:50,839 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:00:50,839 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:00:50,839 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:00:50,839 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:00:50,840 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:00:50,840 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:00:50,873 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:00:50,873 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 00:00:50,875 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3133/3273 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2968 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:00:50,878 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:00:50,878 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:00:51,242 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:00:51,243 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 404 [2022-12-06 00:00:51,243 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:00:51,243 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:00:51,243 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:00:51,243 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:00:51,243 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2022-12-06 00:00:51,243 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-06 00:00:51,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:00:51,244 INFO L85 PathProgramCache]: Analyzing trace with hash -955458588, now seen corresponding path program 1 times [2022-12-06 00:00:51,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:00:51,244 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639440023] [2022-12-06 00:00:51,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:00:51,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:00:51,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:00:51,339 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-06 00:00:51,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:00:51,340 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639440023] [2022-12-06 00:00:51,340 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [639440023] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:00:51,340 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:00:51,340 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:00:51,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617063137] [2022-12-06 00:00:51,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:00:51,340 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:00:51,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:00:51,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:00:51,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:00:51,341 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:00:51,341 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:00:51,341 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:00:51,341 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:00:51,341 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:00:51,861 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:00:51,861 INFO L131 PetriNetUnfolder]: For 27229/27274 co-relation queries the response was YES. [2022-12-06 00:00:51,871 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27229/27274 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13555 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:00:51,880 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:00:51,881 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:00:51,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:00:51,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:00:51,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:00:51,882 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:00:51,882 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:00:51,882 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:00:51,927 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:00:51,929 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:00:51,929 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:00:51,935 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:00:51,935 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:00:51,935 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:00:51,935 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:00:51,936 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:00:51,936 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:00:51,945 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:00:51,977 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:00:51,977 INFO L131 PetriNetUnfolder]: For 3349/3561 co-relation queries the response was YES. [2022-12-06 00:00:51,978 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3349/3561 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2975 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:00:51,981 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:00:51,981 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:00:52,161 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:00:52,161 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 226 [2022-12-06 00:00:52,162 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:00:52,162 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:00:52,162 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:00:52,162 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:00:52,162 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2022-12-06 00:00:52,162 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-06 00:00:52,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:00:52,162 INFO L85 PathProgramCache]: Analyzing trace with hash 787351747, now seen corresponding path program 1 times [2022-12-06 00:00:52,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:00:52,163 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265789485] [2022-12-06 00:00:52,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:00:52,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:00:52,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:00:52,348 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-06 00:00:52,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:00:52,348 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265789485] [2022-12-06 00:00:52,349 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1265789485] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:00:52,349 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:00:52,349 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:00:52,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821820396] [2022-12-06 00:00:52,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:00:52,350 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:00:52,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:00:52,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:00:52,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:00:52,350 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:00:52,350 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:00:52,350 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:00:52,350 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:00:52,350 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:00:52,785 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:00:52,785 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:00:52,794 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13566 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:00:52,804 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:00:52,804 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:00:52,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:00:52,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:00:52,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:00:52,811 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:00:52,811 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:00:52,811 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:00:52,864 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:00:52,866 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:00:52,866 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:00:52,868 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:00:52,868 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:00:52,868 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:00:52,870 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:00:52,870 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:00:52,870 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:00:52,871 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:00:52,907 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:00:52,907 INFO L131 PetriNetUnfolder]: For 3293/3500 co-relation queries the response was YES. [2022-12-06 00:00:52,908 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3293/3500 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2994 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:00:52,911 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:00:52,911 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:00:53,238 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:00:53,239 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 371 [2022-12-06 00:00:53,239 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:00:53,239 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:00:53,239 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:00:53,239 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:00:53,240 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2022-12-06 00:00:53,240 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-06 00:00:53,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:00:53,240 INFO L85 PathProgramCache]: Analyzing trace with hash -1764805214, now seen corresponding path program 1 times [2022-12-06 00:00:53,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:00:53,240 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983219887] [2022-12-06 00:00:53,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:00:53,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:00:53,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:00:53,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-06 00:00:53,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:00:53,442 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983219887] [2022-12-06 00:00:53,443 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1983219887] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:00:53,443 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:00:53,443 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:00:53,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917894182] [2022-12-06 00:00:53,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:00:53,443 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:00:53,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:00:53,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:00:53,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:00:53,444 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:00:53,444 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:00:53,444 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:00:53,444 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:00:53,444 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:00:53,896 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:00:53,897 INFO L131 PetriNetUnfolder]: For 27136/27181 co-relation queries the response was YES. [2022-12-06 00:00:53,904 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27136/27181 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13524 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:00:53,916 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:00:53,916 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:00:53,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:00:53,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:00:53,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:00:53,917 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:00:53,917 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:00:53,917 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:00:53,966 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:00:53,968 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:00:53,968 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:00:53,968 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:00:53,968 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:00:53,969 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:00:53,969 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:00:53,969 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:00:53,970 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:00:53,970 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:00:54,010 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:00:54,010 INFO L131 PetriNetUnfolder]: For 3156/3296 co-relation queries the response was YES. [2022-12-06 00:00:54,012 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3156/3296 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2987 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:00:54,015 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:00:54,015 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:00:54,197 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:00:54,198 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 230 [2022-12-06 00:00:54,198 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:00:54,198 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:00:54,198 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:00:54,198 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:00:54,198 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2022-12-06 00:00:54,198 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-06 00:00:54,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:00:54,199 INFO L85 PathProgramCache]: Analyzing trace with hash -21994879, now seen corresponding path program 1 times [2022-12-06 00:00:54,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:00:54,199 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888364117] [2022-12-06 00:00:54,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:00:54,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:00:54,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:00:54,346 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-06 00:00:54,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:00:54,347 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888364117] [2022-12-06 00:00:54,347 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [888364117] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:00:54,347 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:00:54,347 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:00:54,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796198008] [2022-12-06 00:00:54,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:00:54,349 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:00:54,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:00:54,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:00:54,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:00:54,349 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:00:54,349 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:00:54,349 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:00:54,349 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:00:54,349 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:00:54,731 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:00:54,731 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 00:00:54,741 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13559 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:00:54,751 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:00:54,751 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:00:54,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:00:54,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:00:54,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:00:54,753 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:00:54,753 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:00:54,753 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:00:54,806 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:00:54,808 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:00:54,808 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:00:54,810 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:00:54,810 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:00:54,810 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:00:54,811 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:00:54,811 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:00:54,811 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:00:54,812 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:00:54,845 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:00:54,845 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 00:00:54,847 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3312/3520 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2978 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:00:54,849 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:00:54,850 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:00:55,052 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:00:55,052 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 242 [2022-12-06 00:00:55,052 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:00:55,053 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:00:55,053 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:00:55,053 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:00:55,053 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2022-12-06 00:00:55,053 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-06 00:00:55,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:00:55,053 INFO L85 PathProgramCache]: Analyzing trace with hash 1720815456, now seen corresponding path program 1 times [2022-12-06 00:00:55,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:00:55,054 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146427998] [2022-12-06 00:00:55,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:00:55,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:00:55,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:00:55,186 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-06 00:00:55,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:00:55,187 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146427998] [2022-12-06 00:00:55,187 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2146427998] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:00:55,187 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:00:55,187 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:00:55,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033392199] [2022-12-06 00:00:55,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:00:55,187 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:00:55,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:00:55,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:00:55,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:00:55,188 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:00:55,188 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:00:55,188 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:00:55,188 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:00:55,188 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:00:55,637 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:00:55,637 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:00:55,644 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13577 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:00:55,653 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:00:55,653 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:00:55,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:00:55,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:00:55,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:00:55,654 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:00:55,654 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:00:55,654 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:00:55,700 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:00:55,701 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:00:55,702 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:00:55,702 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:00:55,702 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:00:55,702 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:00:55,703 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:00:55,703 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:00:55,703 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:00:55,704 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:00:55,736 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:00:55,736 INFO L131 PetriNetUnfolder]: For 3348/3558 co-relation queries the response was YES. [2022-12-06 00:00:55,738 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3348/3558 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2996 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:00:55,740 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:00:55,740 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:00:55,919 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:00:55,920 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 218 [2022-12-06 00:00:55,920 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:00:55,920 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:00:55,920 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:00:55,920 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:00:55,920 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2022-12-06 00:00:55,920 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-06 00:00:55,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:00:55,921 INFO L85 PathProgramCache]: Analyzing trace with hash -831341505, now seen corresponding path program 1 times [2022-12-06 00:00:55,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:00:55,921 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105685754] [2022-12-06 00:00:55,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:00:55,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:00:55,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:00:55,997 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-06 00:00:55,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:00:55,998 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105685754] [2022-12-06 00:00:55,998 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2105685754] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:00:55,998 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:00:55,998 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:00:55,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731539339] [2022-12-06 00:00:55,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:00:55,998 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:00:55,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:00:55,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:00:55,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:00:55,999 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:00:55,999 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:00:55,999 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:00:55,999 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:00:55,999 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:00:56,467 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:00:56,467 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 00:00:56,475 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26965/27010 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13541 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:00:56,484 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:00:56,484 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:00:56,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:00:56,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:00:56,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:00:56,485 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:00:56,485 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:00:56,485 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:00:56,538 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:00:56,540 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:00:56,540 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:00:56,540 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:00:56,540 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:00:56,540 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:00:56,541 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:00:56,541 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:00:56,541 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:00:56,542 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:00:56,574 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:00:56,575 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 00:00:56,576 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3133/3273 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2968 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:00:56,579 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:00:56,579 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:00:56,757 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:00:56,758 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 218 [2022-12-06 00:00:56,758 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:00:56,758 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:00:56,758 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:00:56,758 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:00:56,758 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2022-12-06 00:00:56,758 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-06 00:00:56,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:00:56,758 INFO L85 PathProgramCache]: Analyzing trace with hash 911468830, now seen corresponding path program 1 times [2022-12-06 00:00:56,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:00:56,759 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895705020] [2022-12-06 00:00:56,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:00:56,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:00:56,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:00:56,887 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-06 00:00:56,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:00:56,887 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895705020] [2022-12-06 00:00:56,887 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [895705020] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:00:56,887 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:00:56,888 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:00:56,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491182841] [2022-12-06 00:00:56,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:00:56,888 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:00:56,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:00:56,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:00:56,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:00:56,888 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:00:56,889 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:00:56,889 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:00:56,889 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:00:56,889 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:00:57,317 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:00:57,317 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:00:57,324 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13574 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:00:57,332 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:00:57,332 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:00:57,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:00:57,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:00:57,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:00:57,333 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:00:57,333 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:00:57,333 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:00:57,375 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:00:57,377 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:00:57,377 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:00:57,377 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:00:57,378 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:00:57,378 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:00:57,378 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:00:57,378 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:00:57,380 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:00:57,381 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:00:57,415 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:00:57,415 INFO L131 PetriNetUnfolder]: For 3301/3509 co-relation queries the response was YES. [2022-12-06 00:00:57,417 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3301/3509 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2964 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:00:57,420 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:00:57,420 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:00:57,636 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:00:57,637 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 259 [2022-12-06 00:00:57,637 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:00:57,637 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:00:57,637 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:00:57,637 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:00:57,637 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2022-12-06 00:00:57,637 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-06 00:00:57,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:00:57,638 INFO L85 PathProgramCache]: Analyzing trace with hash -1640688131, now seen corresponding path program 1 times [2022-12-06 00:00:57,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:00:57,638 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159436798] [2022-12-06 00:00:57,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:00:57,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:00:57,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:00:57,765 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-06 00:00:57,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:00:57,766 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159436798] [2022-12-06 00:00:57,766 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1159436798] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:00:57,766 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:00:57,766 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:00:57,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291597011] [2022-12-06 00:00:57,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:00:57,767 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:00:57,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:00:57,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:00:57,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:00:57,771 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:00:57,771 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:00:57,771 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:00:57,771 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:00:57,771 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:00:58,167 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:00:58,168 INFO L131 PetriNetUnfolder]: For 27136/27181 co-relation queries the response was YES. [2022-12-06 00:00:58,176 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27136/27181 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13504 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:00:58,188 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:00:58,189 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:00:58,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:00:58,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:00:58,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:00:58,190 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:00:58,190 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:00:58,190 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:00:58,239 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:00:58,241 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:00:58,242 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:00:58,245 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:00:58,245 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:00:58,246 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:00:58,246 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:00:58,246 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:00:58,247 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:00:58,247 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:00:58,286 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:00:58,287 INFO L131 PetriNetUnfolder]: For 3167/3307 co-relation queries the response was YES. [2022-12-06 00:00:58,290 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3167/3307 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2972 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:00:58,293 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:00:58,293 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:00:58,486 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:00:58,488 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 243 [2022-12-06 00:00:58,488 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:00:58,488 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:00:58,488 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:00:58,488 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:00:58,488 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2022-12-06 00:00:58,488 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-06 00:00:58,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:00:58,489 INFO L85 PathProgramCache]: Analyzing trace with hash 102122204, now seen corresponding path program 1 times [2022-12-06 00:00:58,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:00:58,489 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412970368] [2022-12-06 00:00:58,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:00:58,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:00:58,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:00:58,629 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-06 00:00:58,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:00:58,630 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412970368] [2022-12-06 00:00:58,630 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1412970368] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:00:58,630 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:00:58,630 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:00:58,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664244208] [2022-12-06 00:00:58,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:00:58,630 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:00:58,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:00:58,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:00:58,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:00:58,631 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:00:58,631 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:00:58,631 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:00:58,631 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:00:58,631 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:00:59,199 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:00:59,200 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 00:00:59,208 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26965/27010 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13523 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:00:59,218 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:00:59,218 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:00:59,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:00:59,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:00:59,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:00:59,219 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:00:59,219 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:00:59,220 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:00:59,268 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:00:59,270 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:00:59,270 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:00:59,270 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:00:59,270 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:00:59,271 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:00:59,271 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:00:59,271 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:00:59,272 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:00:59,273 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:00:59,332 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:00:59,332 INFO L131 PetriNetUnfolder]: For 3146/3287 co-relation queries the response was YES. [2022-12-06 00:00:59,334 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3146/3287 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2981 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:00:59,337 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:00:59,337 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:00:59,572 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:00:59,572 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 302 [2022-12-06 00:00:59,573 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:00:59,573 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:00:59,573 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:00:59,573 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:00:59,573 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2022-12-06 00:00:59,573 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-06 00:00:59,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:00:59,573 INFO L85 PathProgramCache]: Analyzing trace with hash 1844932539, now seen corresponding path program 1 times [2022-12-06 00:00:59,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:00:59,574 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445853693] [2022-12-06 00:00:59,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:00:59,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:00:59,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:00:59,743 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-06 00:00:59,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:00:59,743 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445853693] [2022-12-06 00:00:59,744 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1445853693] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:00:59,744 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:00:59,744 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:00:59,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194372997] [2022-12-06 00:00:59,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:00:59,745 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:00:59,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:00:59,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:00:59,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:00:59,745 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:00:59,745 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:00:59,745 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:00:59,745 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:00:59,745 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:01:00,130 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:01:00,130 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:01:00,139 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13578 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:01:00,150 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:01:00,150 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:01:00,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:01:00,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:01:00,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:01:00,151 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:01:00,151 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:01:00,151 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:01:00,199 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:01:00,201 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:00,201 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:01:00,201 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:01:00,201 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:01:00,201 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:00,202 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:01:00,202 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:01:00,202 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:00,203 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:00,237 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:01:00,237 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 00:01:00,238 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3312/3520 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2962 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:01:00,241 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:00,241 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:01:00,408 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:01:00,409 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 208 [2022-12-06 00:01:00,409 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:01:00,409 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:01:00,409 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:01:00,409 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:01:00,410 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2022-12-06 00:01:00,410 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-06 00:01:00,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:01:00,410 INFO L85 PathProgramCache]: Analyzing trace with hash -707224422, now seen corresponding path program 1 times [2022-12-06 00:01:00,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:01:00,410 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63231896] [2022-12-06 00:01:00,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:01:00,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:01:00,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:01:00,501 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-06 00:01:00,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:01:00,501 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63231896] [2022-12-06 00:01:00,501 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [63231896] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:01:00,501 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:01:00,501 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:01:00,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651314425] [2022-12-06 00:01:00,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:01:00,502 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:01:00,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:01:00,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:01:00,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:01:00,502 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:01:00,502 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:01:00,502 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:01:00,502 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:01:00,502 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:01:00,868 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:01:00,868 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:01:00,876 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13557 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:01:00,887 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:01:00,887 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:01:00,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:01:00,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:01:00,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:01:00,888 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:01:00,888 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:01:00,888 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:01:00,937 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:01:00,938 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:00,939 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:01:00,939 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:01:00,939 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:01:00,939 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:00,940 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:01:00,940 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:01:00,940 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:00,941 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:00,975 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:01:00,976 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 00:01:00,977 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3321/3530 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2978 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:01:00,980 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:00,980 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:01:01,184 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:01:01,185 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 246 [2022-12-06 00:01:01,185 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:01:01,185 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:01:01,185 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:01:01,185 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:01:01,185 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2022-12-06 00:01:01,185 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-06 00:01:01,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:01:01,185 INFO L85 PathProgramCache]: Analyzing trace with hash 1035585913, now seen corresponding path program 1 times [2022-12-06 00:01:01,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:01:01,186 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368415900] [2022-12-06 00:01:01,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:01:01,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:01:01,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:01:01,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-06 00:01:01,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:01:01,359 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368415900] [2022-12-06 00:01:01,359 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1368415900] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:01:01,359 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:01:01,359 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:01:01,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323873812] [2022-12-06 00:01:01,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:01:01,360 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:01:01,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:01:01,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:01:01,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:01:01,361 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:01:01,361 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:01:01,361 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:01:01,361 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:01:01,361 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:01:01,850 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:01:01,851 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 00:01:01,859 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26965/27010 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13517 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:01:01,870 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:01:01,870 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:01:01,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:01:01,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:01:01,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:01:01,871 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:01:01,871 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:01:01,871 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:01:01,923 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:01:01,925 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:01,925 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:01:01,926 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:01:01,926 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:01:01,926 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:01,927 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:01:01,927 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:01:01,927 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:01,929 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:01,963 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:01:01,963 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 00:01:01,964 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3133/3273 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2964 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:01:01,967 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:01,967 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:01:02,152 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:01:02,153 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 227 [2022-12-06 00:01:02,153 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:01:02,153 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:01:02,153 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:01:02,153 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:01:02,153 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2022-12-06 00:01:02,153 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-06 00:01:02,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:01:02,153 INFO L85 PathProgramCache]: Analyzing trace with hash -1516571048, now seen corresponding path program 1 times [2022-12-06 00:01:02,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:01:02,154 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976253780] [2022-12-06 00:01:02,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:01:02,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:01:02,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:01:02,229 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-06 00:01:02,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:01:02,230 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976253780] [2022-12-06 00:01:02,230 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1976253780] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:01:02,230 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:01:02,230 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:01:02,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308848920] [2022-12-06 00:01:02,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:01:02,230 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:01:02,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:01:02,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:01:02,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:01:02,231 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:01:02,231 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:01:02,231 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:01:02,231 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:01:02,231 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:01:02,590 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:01:02,591 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 00:01:02,598 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26969/27014 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13550 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:01:02,609 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:01:02,609 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:01:02,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:01:02,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:01:02,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:01:02,610 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:01:02,610 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:01:02,610 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:01:02,662 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:01:02,664 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:02,664 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:01:02,664 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:01:02,664 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:01:02,664 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:02,665 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:01:02,665 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:01:02,665 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:02,666 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:02,698 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:01:02,698 INFO L131 PetriNetUnfolder]: For 3146/3287 co-relation queries the response was YES. [2022-12-06 00:01:02,699 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3146/3287 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2977 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:01:02,702 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:02,702 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:01:02,877 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:01:02,877 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 213 [2022-12-06 00:01:02,877 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:01:02,878 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:01:02,878 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:01:02,878 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:01:02,878 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2022-12-06 00:01:02,878 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-06 00:01:02,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:01:02,878 INFO L85 PathProgramCache]: Analyzing trace with hash 226239287, now seen corresponding path program 1 times [2022-12-06 00:01:02,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:01:02,878 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729326347] [2022-12-06 00:01:02,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:01:02,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:01:02,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:01:02,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-06 00:01:02,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:01:02,956 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729326347] [2022-12-06 00:01:02,956 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [729326347] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:01:02,956 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:01:02,956 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:01:02,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911131211] [2022-12-06 00:01:02,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:01:02,957 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:01:02,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:01:02,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:01:02,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:01:02,957 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:01:02,957 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:01:02,957 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:01:02,957 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:01:02,957 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:01:03,364 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:01:03,365 INFO L131 PetriNetUnfolder]: For 27150/27195 co-relation queries the response was YES. [2022-12-06 00:01:03,373 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27150/27195 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13527 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:01:03,382 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:01:03,383 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:01:03,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:01:03,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:01:03,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:01:03,384 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:01:03,384 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:01:03,384 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:01:03,429 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:01:03,431 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:03,431 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:01:03,432 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:01:03,432 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:01:03,432 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:03,433 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:01:03,433 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:01:03,433 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:03,434 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:03,497 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:01:03,497 INFO L131 PetriNetUnfolder]: For 3156/3296 co-relation queries the response was YES. [2022-12-06 00:01:03,498 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3156/3296 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2981 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:01:03,501 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:03,501 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:01:03,859 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:01:03,860 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 428 [2022-12-06 00:01:03,860 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:01:03,860 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:01:03,860 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:01:03,860 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:01:03,860 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69 [2022-12-06 00:01:03,860 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-06 00:01:03,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:01:03,860 INFO L85 PathProgramCache]: Analyzing trace with hash 1969049622, now seen corresponding path program 1 times [2022-12-06 00:01:03,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:01:03,861 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320698096] [2022-12-06 00:01:03,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:01:03,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:01:03,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:01:03,964 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-06 00:01:03,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:01:03,964 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320698096] [2022-12-06 00:01:03,964 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1320698096] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:01:03,964 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:01:03,964 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:01:03,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81854344] [2022-12-06 00:01:03,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:01:03,965 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:01:03,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:01:03,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:01:03,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:01:03,965 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:01:03,965 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:01:03,966 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:01:03,966 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:01:03,966 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:01:04,345 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:01:04,345 INFO L131 PetriNetUnfolder]: For 27136/27181 co-relation queries the response was YES. [2022-12-06 00:01:04,353 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27136/27181 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13507 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:01:04,362 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:01:04,362 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:01:04,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:01:04,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:01:04,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:01:04,363 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:01:04,363 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:01:04,363 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:01:04,410 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:01:04,412 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:04,412 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:01:04,414 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:01:04,415 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:01:04,415 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:04,415 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:01:04,415 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:01:04,416 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:04,416 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:04,449 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:01:04,449 INFO L131 PetriNetUnfolder]: For 3167/3307 co-relation queries the response was YES. [2022-12-06 00:01:04,450 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3167/3307 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 3018 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:01:04,453 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:04,453 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:01:04,617 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:01:04,617 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 202 [2022-12-06 00:01:04,617 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:01:04,617 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:01:04,617 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:01:04,618 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:01:04,618 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70 [2022-12-06 00:01:04,618 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-06 00:01:04,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:01:04,618 INFO L85 PathProgramCache]: Analyzing trace with hash -583107339, now seen corresponding path program 1 times [2022-12-06 00:01:04,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:01:04,618 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692125995] [2022-12-06 00:01:04,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:01:04,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:01:04,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:01:04,696 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-06 00:01:04,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:01:04,696 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692125995] [2022-12-06 00:01:04,696 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [692125995] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:01:04,696 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:01:04,697 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:01:04,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612684970] [2022-12-06 00:01:04,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:01:04,697 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:01:04,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:01:04,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:01:04,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:01:04,697 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:01:04,697 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:01:04,698 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:01:04,698 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:01:04,698 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:01:05,275 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:01:05,275 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 00:01:05,282 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26965/27010 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13536 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:01:05,291 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:01:05,292 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:01:05,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:01:05,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:01:05,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:01:05,293 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:01:05,293 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:01:05,293 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:01:05,341 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:01:05,342 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:05,343 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:01:05,343 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:01:05,343 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:01:05,343 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:05,344 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:01:05,344 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:01:05,344 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:05,345 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:05,378 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:01:05,379 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 00:01:05,380 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3133/3273 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2977 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:01:05,383 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:05,383 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:01:05,562 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:01:05,563 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 220 [2022-12-06 00:01:05,563 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:01:05,563 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:01:05,563 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:01:05,563 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:01:05,563 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71 [2022-12-06 00:01:05,563 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-06 00:01:05,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:01:05,564 INFO L85 PathProgramCache]: Analyzing trace with hash 1159702996, now seen corresponding path program 1 times [2022-12-06 00:01:05,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:01:05,564 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111577983] [2022-12-06 00:01:05,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:01:05,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:01:05,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:01:05,685 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:01:05,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:01:05,686 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111577983] [2022-12-06 00:01:05,686 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2111577983] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:01:05,686 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:01:05,686 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:01:05,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298169230] [2022-12-06 00:01:05,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:01:05,686 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:01:05,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:01:05,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:01:05,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:01:05,687 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:01:05,687 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:01:05,687 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:01:05,687 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:01:05,687 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:01:06,047 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:01:06,048 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:01:06,056 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13562 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:01:06,066 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:01:06,067 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:01:06,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:01:06,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:01:06,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:01:06,068 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:01:06,068 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:01:06,068 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:01:06,120 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:01:06,140 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:06,140 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:01:06,141 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:01:06,141 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:01:06,141 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:06,141 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:01:06,142 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:01:06,142 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:06,143 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:06,182 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:01:06,183 INFO L131 PetriNetUnfolder]: For 3338/3547 co-relation queries the response was YES. [2022-12-06 00:01:06,184 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3338/3547 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2960 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:01:06,187 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:06,187 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:01:06,388 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:01:06,388 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 247 [2022-12-06 00:01:06,388 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:01:06,388 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:01:06,388 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:01:06,389 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:01:06,389 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72 [2022-12-06 00:01:06,389 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-06 00:01:06,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:01:06,389 INFO L85 PathProgramCache]: Analyzing trace with hash -1392453965, now seen corresponding path program 1 times [2022-12-06 00:01:06,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:01:06,389 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127067043] [2022-12-06 00:01:06,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:01:06,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:01:06,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:01:06,557 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-06 00:01:06,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:01:06,558 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127067043] [2022-12-06 00:01:06,558 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2127067043] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:01:06,558 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:01:06,558 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:01:06,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883374822] [2022-12-06 00:01:06,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:01:06,558 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:01:06,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:01:06,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:01:06,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:01:06,559 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:01:06,559 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:01:06,559 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:01:06,559 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:01:06,559 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:01:06,965 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:01:06,965 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:01:06,972 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13559 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:01:06,980 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:01:06,981 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:01:06,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:01:06,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:01:06,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:01:06,982 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:01:06,982 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:01:06,982 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:01:07,025 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:01:07,027 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:07,027 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:01:07,028 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:01:07,028 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:01:07,028 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:07,028 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:01:07,029 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:01:07,029 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:07,029 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:07,060 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:01:07,060 INFO L131 PetriNetUnfolder]: For 3304/3511 co-relation queries the response was YES. [2022-12-06 00:01:07,062 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3304/3511 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2988 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:01:07,064 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:07,064 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:01:07,240 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:01:07,240 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 212 [2022-12-06 00:01:07,240 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:01:07,240 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:01:07,240 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:01:07,241 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:01:07,241 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73 [2022-12-06 00:01:07,241 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-06 00:01:07,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:01:07,241 INFO L85 PathProgramCache]: Analyzing trace with hash 350356370, now seen corresponding path program 1 times [2022-12-06 00:01:07,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:01:07,241 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594409323] [2022-12-06 00:01:07,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:01:07,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:01:07,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:01:07,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-06 00:01:07,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:01:07,334 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594409323] [2022-12-06 00:01:07,334 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [594409323] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:01:07,334 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:01:07,334 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:01:07,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109157099] [2022-12-06 00:01:07,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:01:07,334 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:01:07,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:01:07,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:01:07,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:01:07,335 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:01:07,335 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:01:07,335 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:01:07,335 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:01:07,335 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:01:07,697 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:01:07,697 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 00:01:07,705 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26965/27010 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13524 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:01:07,713 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:01:07,713 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:01:07,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:01:07,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:01:07,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:01:07,714 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:01:07,714 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:01:07,714 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:01:07,761 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:01:07,762 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:07,762 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:01:07,763 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:01:07,763 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:01:07,763 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:07,764 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:01:07,764 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:01:07,764 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:07,765 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:07,795 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:01:07,795 INFO L131 PetriNetUnfolder]: For 3122/3262 co-relation queries the response was YES. [2022-12-06 00:01:07,796 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3122/3262 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2976 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:01:07,799 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:07,799 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:01:07,977 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:01:07,978 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 215 [2022-12-06 00:01:07,978 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:01:07,978 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:01:07,978 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:01:07,978 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:01:07,978 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74 [2022-12-06 00:01:07,978 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-06 00:01:07,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:01:07,979 INFO L85 PathProgramCache]: Analyzing trace with hash 2093166705, now seen corresponding path program 1 times [2022-12-06 00:01:07,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:01:07,979 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535619782] [2022-12-06 00:01:07,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:01:07,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:01:07,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:01:08,102 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-06 00:01:08,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:01:08,102 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535619782] [2022-12-06 00:01:08,102 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [535619782] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:01:08,103 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:01:08,103 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:01:08,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099949852] [2022-12-06 00:01:08,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:01:08,106 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:01:08,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:01:08,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:01:08,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:01:08,106 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:01:08,106 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:01:08,107 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:01:08,107 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:01:08,107 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:01:08,496 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:01:08,496 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 00:01:08,504 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13564 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:01:08,573 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:01:08,574 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:01:08,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:01:08,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:01:08,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:01:08,575 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:01:08,575 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:01:08,575 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:01:08,620 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:01:08,622 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:08,623 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:01:08,623 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:01:08,623 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:01:08,623 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:08,624 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:01:08,624 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:01:08,625 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:08,625 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:08,669 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:01:08,669 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 00:01:08,671 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3321/3530 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2993 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:01:08,674 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:08,674 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:01:08,872 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:01:08,872 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 249 [2022-12-06 00:01:08,873 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:01:08,873 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:01:08,873 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:01:08,873 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:01:08,873 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75 [2022-12-06 00:01:08,873 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-06 00:01:08,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:01:08,873 INFO L85 PathProgramCache]: Analyzing trace with hash -458990256, now seen corresponding path program 1 times [2022-12-06 00:01:08,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:01:08,874 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619681892] [2022-12-06 00:01:08,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:01:08,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:01:08,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:01:08,964 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-06 00:01:08,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:01:08,964 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619681892] [2022-12-06 00:01:08,964 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [619681892] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:01:08,964 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:01:08,964 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:01:08,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300195536] [2022-12-06 00:01:08,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:01:08,966 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:01:08,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:01:08,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:01:08,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:01:08,966 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:01:08,966 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:01:08,966 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:01:08,967 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:01:08,967 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:01:09,375 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:01:09,375 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:01:09,381 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13557 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:01:09,389 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:01:09,389 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:01:09,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:01:09,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:01:09,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:01:09,390 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:01:09,390 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:01:09,390 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:01:09,428 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:01:09,430 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:09,430 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:01:09,430 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:01:09,430 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:01:09,430 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:09,431 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:01:09,431 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:01:09,431 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:09,432 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:09,463 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:01:09,464 INFO L131 PetriNetUnfolder]: For 3338/3550 co-relation queries the response was YES. [2022-12-06 00:01:09,465 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3338/3550 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2996 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:01:09,468 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:09,468 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:01:09,678 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:01:09,678 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 248 [2022-12-06 00:01:09,678 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:01:09,679 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:01:09,679 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:01:09,679 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:01:09,679 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76 [2022-12-06 00:01:09,679 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-06 00:01:09,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:01:09,679 INFO L85 PathProgramCache]: Analyzing trace with hash 1283820079, now seen corresponding path program 1 times [2022-12-06 00:01:09,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:01:09,679 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261689121] [2022-12-06 00:01:09,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:01:09,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:01:09,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:01:09,757 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-06 00:01:09,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:01:09,757 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261689121] [2022-12-06 00:01:09,757 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1261689121] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:01:09,757 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:01:09,757 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:01:09,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518359869] [2022-12-06 00:01:09,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:01:09,758 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:01:09,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:01:09,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:01:09,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:01:09,758 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:01:09,758 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:01:09,758 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:01:09,758 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:01:09,759 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:01:10,123 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:01:10,123 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 00:01:10,131 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13561 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:01:10,141 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:01:10,141 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:01:10,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:01:10,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:01:10,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:01:10,143 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:01:10,143 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:01:10,143 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:01:10,195 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:01:10,196 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:10,196 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:01:10,197 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:01:10,197 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:01:10,197 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:10,197 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:01:10,197 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:01:10,197 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:10,198 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:10,226 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:01:10,226 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 00:01:10,228 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3312/3520 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2979 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:01:10,230 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:10,231 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:01:10,413 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:01:10,414 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 217 [2022-12-06 00:01:10,414 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:01:10,414 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:01:10,414 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:01:10,414 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:01:10,414 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable77 [2022-12-06 00:01:10,414 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-06 00:01:10,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:01:10,415 INFO L85 PathProgramCache]: Analyzing trace with hash -1268336882, now seen corresponding path program 1 times [2022-12-06 00:01:10,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:01:10,415 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440414996] [2022-12-06 00:01:10,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:01:10,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:01:10,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:01:10,530 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-06 00:01:10,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:01:10,530 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440414996] [2022-12-06 00:01:10,530 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [440414996] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:01:10,530 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:01:10,530 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:01:10,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885075204] [2022-12-06 00:01:10,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:01:10,531 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:01:10,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:01:10,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:01:10,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:01:10,531 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:01:10,531 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:01:10,532 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:01:10,532 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:01:10,532 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:01:10,932 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:01:10,932 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:01:10,940 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13573 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:01:10,949 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:01:10,949 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:01:10,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:01:10,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:01:10,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:01:10,950 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:01:10,950 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:01:10,950 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:01:10,992 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:01:10,994 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:10,994 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:01:10,994 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:01:10,994 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:01:10,994 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:10,995 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:01:10,995 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:01:10,995 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:10,996 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:11,022 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:01:11,022 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 00:01:11,023 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3312/3520 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2986 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:01:11,024 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:11,025 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:01:11,181 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:01:11,181 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 187 [2022-12-06 00:01:11,181 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:01:11,181 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:01:11,181 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:01:11,181 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:01:11,181 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable78 [2022-12-06 00:01:11,182 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-06 00:01:11,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:01:11,182 INFO L85 PathProgramCache]: Analyzing trace with hash 474473453, now seen corresponding path program 1 times [2022-12-06 00:01:11,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:01:11,182 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347244969] [2022-12-06 00:01:11,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:01:11,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:01:11,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:01:11,248 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-06 00:01:11,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:01:11,248 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347244969] [2022-12-06 00:01:11,248 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1347244969] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:01:11,248 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:01:11,249 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:01:11,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403925548] [2022-12-06 00:01:11,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:01:11,249 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:01:11,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:01:11,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:01:11,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:01:11,249 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:01:11,250 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:01:11,250 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:01:11,250 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:01:11,250 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:01:11,546 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:01:11,546 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:01:11,552 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13564 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:01:11,560 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:01:11,560 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:01:11,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:01:11,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:01:11,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:01:11,561 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:01:11,561 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:01:11,561 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:01:11,596 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:01:11,597 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:11,597 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:01:11,598 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:01:11,598 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:01:11,598 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:11,598 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:01:11,598 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:01:11,598 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:11,599 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:11,624 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:01:11,624 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 00:01:11,625 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3312/3520 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2993 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:01:11,627 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:11,627 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:01:11,779 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:01:11,780 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 182 [2022-12-06 00:01:11,780 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:01:11,780 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:01:11,780 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:01:11,780 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:01:11,780 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable79 [2022-12-06 00:01:11,781 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-06 00:01:11,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:01:11,781 INFO L85 PathProgramCache]: Analyzing trace with hash -2077683508, now seen corresponding path program 1 times [2022-12-06 00:01:11,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:01:11,781 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548319127] [2022-12-06 00:01:11,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:01:11,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:01:11,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:01:11,875 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-06 00:01:11,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:01:11,876 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548319127] [2022-12-06 00:01:11,876 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [548319127] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:01:11,876 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:01:11,876 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:01:11,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079468563] [2022-12-06 00:01:11,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:01:11,876 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:01:11,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:01:11,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:01:11,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:01:11,877 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:01:11,877 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:01:11,877 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:01:11,877 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:01:11,877 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:01:12,210 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:01:12,210 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:01:12,218 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13547 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:01:12,228 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:01:12,228 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:01:12,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:01:12,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:01:12,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:01:12,229 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:01:12,229 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:01:12,229 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:01:12,282 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:01:12,284 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:12,284 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:01:12,284 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:01:12,284 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:01:12,284 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:12,285 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:01:12,285 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:01:12,285 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:12,286 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:12,318 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:01:12,318 INFO L131 PetriNetUnfolder]: For 3327/3536 co-relation queries the response was YES. [2022-12-06 00:01:12,319 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3327/3536 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2971 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:01:12,322 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:12,322 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:01:12,508 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:01:12,508 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 224 [2022-12-06 00:01:12,509 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:01:12,509 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:01:12,509 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:01:12,509 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:01:12,509 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80 [2022-12-06 00:01:12,509 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-06 00:01:12,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:01:12,510 INFO L85 PathProgramCache]: Analyzing trace with hash -334873173, now seen corresponding path program 1 times [2022-12-06 00:01:12,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:01:12,510 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903675178] [2022-12-06 00:01:12,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:01:12,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:01:12,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:01:12,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:01:12,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:01:12,579 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903675178] [2022-12-06 00:01:12,579 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1903675178] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:01:12,579 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:01:12,579 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:01:12,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338184213] [2022-12-06 00:01:12,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:01:12,579 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:01:12,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:01:12,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:01:12,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:01:12,580 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:01:12,580 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:01:12,580 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:01:12,580 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:01:12,580 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:01:12,871 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:01:12,871 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 00:01:12,876 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13559 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:01:12,882 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:01:12,883 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:01:12,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:01:12,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:01:12,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:01:12,883 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:01:12,883 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:01:12,883 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:01:12,916 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:01:12,917 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:12,917 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:01:12,917 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:01:12,917 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:01:12,917 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:12,918 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:01:12,918 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:01:12,918 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:12,919 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:12,942 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:01:12,942 INFO L131 PetriNetUnfolder]: For 3304/3511 co-relation queries the response was YES. [2022-12-06 00:01:12,943 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3304/3511 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2994 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:01:12,945 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:12,945 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:01:13,097 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:01:13,097 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 180 [2022-12-06 00:01:13,097 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:01:13,097 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:01:13,097 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:01:13,097 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:01:13,098 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable81 [2022-12-06 00:01:13,098 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-06 00:01:13,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:01:13,098 INFO L85 PathProgramCache]: Analyzing trace with hash 1407937162, now seen corresponding path program 1 times [2022-12-06 00:01:13,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:01:13,098 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634621054] [2022-12-06 00:01:13,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:01:13,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:01:13,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:01:13,185 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-06 00:01:13,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:01:13,185 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634621054] [2022-12-06 00:01:13,186 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1634621054] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:01:13,186 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:01:13,186 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:01:13,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144737542] [2022-12-06 00:01:13,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:01:13,186 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:01:13,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:01:13,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:01:13,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:01:13,187 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:01:13,187 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:01:13,187 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:01:13,187 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:01:13,187 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:01:13,483 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:01:13,483 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:01:13,489 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13569 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:01:13,503 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:01:13,503 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:01:13,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:01:13,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:01:13,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:01:13,507 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:01:13,507 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:01:13,507 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:01:13,557 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:01:13,559 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:13,559 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:01:13,559 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:01:13,559 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:01:13,559 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:13,560 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:01:13,560 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:01:13,560 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:13,561 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:13,588 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:01:13,588 INFO L131 PetriNetUnfolder]: For 3301/3509 co-relation queries the response was YES. [2022-12-06 00:01:13,589 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3301/3509 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2994 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:01:13,591 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:13,591 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:01:13,745 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:01:13,746 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 187 [2022-12-06 00:01:13,746 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:01:13,746 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:01:13,746 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:01:13,746 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:01:13,746 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable82 [2022-12-06 00:01:13,746 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-06 00:01:13,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:01:13,747 INFO L85 PathProgramCache]: Analyzing trace with hash -1144219799, now seen corresponding path program 1 times [2022-12-06 00:01:13,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:01:13,747 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435162142] [2022-12-06 00:01:13,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:01:13,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:01:13,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:01:13,820 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-06 00:01:13,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:01:13,820 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435162142] [2022-12-06 00:01:13,820 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1435162142] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:01:13,820 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:01:13,820 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:01:13,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522962402] [2022-12-06 00:01:13,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:01:13,821 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:01:13,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:01:13,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:01:13,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:01:13,822 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:01:13,822 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:01:13,822 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:01:13,822 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:01:13,822 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:01:14,128 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:01:14,129 INFO L131 PetriNetUnfolder]: For 27136/27181 co-relation queries the response was YES. [2022-12-06 00:01:14,133 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27136/27181 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13531 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:01:14,139 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:01:14,139 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:01:14,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:01:14,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:01:14,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:01:14,140 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:01:14,140 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:01:14,140 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:01:14,170 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:01:14,172 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:14,172 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:01:14,172 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:01:14,172 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:01:14,172 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:14,173 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:01:14,173 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:01:14,173 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:14,174 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:14,197 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:01:14,198 INFO L131 PetriNetUnfolder]: For 3167/3307 co-relation queries the response was YES. [2022-12-06 00:01:14,198 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3167/3307 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2998 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:01:14,200 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:14,200 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:01:14,342 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:01:14,343 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 171 [2022-12-06 00:01:14,343 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:01:14,343 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:01:14,343 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:01:14,343 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:01:14,343 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable83 [2022-12-06 00:01:14,344 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-06 00:01:14,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:01:14,344 INFO L85 PathProgramCache]: Analyzing trace with hash 598590536, now seen corresponding path program 1 times [2022-12-06 00:01:14,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:01:14,344 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779723462] [2022-12-06 00:01:14,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:01:14,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:01:14,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:01:14,421 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-06 00:01:14,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:01:14,421 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779723462] [2022-12-06 00:01:14,421 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [779723462] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:01:14,421 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:01:14,421 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:01:14,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525737205] [2022-12-06 00:01:14,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:01:14,422 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:01:14,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:01:14,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:01:14,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:01:14,422 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:01:14,422 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:01:14,422 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:01:14,422 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:01:14,423 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:01:14,795 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:01:14,795 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 00:01:14,805 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26969/27014 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13520 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:01:14,816 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:01:14,816 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:01:14,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:01:14,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:01:14,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:01:14,819 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:01:14,819 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:01:14,819 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:01:14,869 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:01:14,870 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:14,870 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:01:14,871 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:01:14,871 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:01:14,871 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:14,871 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:01:14,871 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:01:14,872 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:14,872 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:14,907 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:01:14,907 INFO L131 PetriNetUnfolder]: For 3135/3276 co-relation queries the response was YES. [2022-12-06 00:01:14,909 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3135/3276 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2965 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:01:14,912 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:14,912 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:01:15,107 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:01:15,108 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 237 [2022-12-06 00:01:15,108 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:01:15,108 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:01:15,108 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:01:15,108 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:01:15,108 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable84 [2022-12-06 00:01:15,108 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-06 00:01:15,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:01:15,109 INFO L85 PathProgramCache]: Analyzing trace with hash -1953566425, now seen corresponding path program 1 times [2022-12-06 00:01:15,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:01:15,109 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379570037] [2022-12-06 00:01:15,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:01:15,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:01:15,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:01:15,183 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-06 00:01:15,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:01:15,183 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379570037] [2022-12-06 00:01:15,183 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1379570037] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:01:15,183 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:01:15,183 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:01:15,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121987225] [2022-12-06 00:01:15,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:01:15,184 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:01:15,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:01:15,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:01:15,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:01:15,184 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:01:15,184 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:01:15,184 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:01:15,184 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:01:15,184 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:01:15,544 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:01:15,544 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 00:01:15,552 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13549 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:01:15,563 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:01:15,563 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:01:15,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:01:15,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:01:15,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:01:15,566 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:01:15,566 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:01:15,566 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:01:15,609 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:01:15,611 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:15,611 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:01:15,612 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:01:15,612 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:01:15,612 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:15,614 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:01:15,614 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:01:15,614 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:15,615 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:15,650 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:01:15,650 INFO L131 PetriNetUnfolder]: For 3304/3511 co-relation queries the response was YES. [2022-12-06 00:01:15,651 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3304/3511 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2992 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:01:15,653 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:15,653 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:01:15,855 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:01:15,855 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 243 [2022-12-06 00:01:15,855 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:01:15,855 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:01:15,855 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:01:15,856 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:01:15,856 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable85 [2022-12-06 00:01:15,856 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-06 00:01:15,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:01:15,856 INFO L85 PathProgramCache]: Analyzing trace with hash -210756090, now seen corresponding path program 1 times [2022-12-06 00:01:15,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:01:15,856 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476587199] [2022-12-06 00:01:15,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:01:15,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:01:15,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:01:15,986 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-06 00:01:15,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:01:15,986 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476587199] [2022-12-06 00:01:15,986 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1476587199] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:01:15,986 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:01:15,986 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:01:15,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012287197] [2022-12-06 00:01:15,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:01:15,987 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:01:15,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:01:15,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:01:15,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:01:15,987 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:01:15,987 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:01:15,988 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:01:15,988 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:01:15,988 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:01:16,314 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:01:16,314 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:01:16,320 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13561 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:01:16,327 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:01:16,327 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:01:16,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:01:16,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:01:16,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:01:16,330 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:01:16,330 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:01:16,330 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:01:16,366 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:01:16,367 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:16,367 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:01:16,368 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:01:16,368 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:01:16,368 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:16,368 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:01:16,368 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:01:16,368 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:16,369 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:16,405 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:01:16,405 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 00:01:16,407 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3312/3520 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2984 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:01:16,410 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:16,410 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:01:16,556 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:01:16,559 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 191 [2022-12-06 00:01:16,559 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:01:16,559 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:01:16,559 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:01:16,559 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:01:16,559 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable86 [2022-12-06 00:01:16,560 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-06 00:01:16,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:01:16,560 INFO L85 PathProgramCache]: Analyzing trace with hash 1532054245, now seen corresponding path program 1 times [2022-12-06 00:01:16,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:01:16,560 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474001611] [2022-12-06 00:01:16,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:01:16,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:01:16,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:01:16,650 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-06 00:01:16,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:01:16,650 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474001611] [2022-12-06 00:01:16,650 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1474001611] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:01:16,650 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:01:16,650 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:01:16,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163824863] [2022-12-06 00:01:16,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:01:16,651 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:01:16,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:01:16,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:01:16,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:01:16,651 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:01:16,651 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:01:16,651 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:01:16,651 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:01:16,652 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:01:17,031 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:01:17,032 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:01:17,037 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13583 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:01:17,045 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:01:17,045 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:01:17,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:01:17,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:01:17,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:01:17,046 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:01:17,046 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:01:17,046 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:01:17,080 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:01:17,081 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:17,081 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:01:17,081 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:01:17,081 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:01:17,081 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:17,082 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:01:17,082 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:01:17,082 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:17,083 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:17,108 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:01:17,108 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 00:01:17,109 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3312/3520 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2984 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:01:17,111 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:17,111 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:01:17,265 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:01:17,266 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 185 [2022-12-06 00:01:17,266 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:01:17,266 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:01:17,266 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:01:17,266 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:01:17,266 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable87 [2022-12-06 00:01:17,266 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-06 00:01:17,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:01:17,267 INFO L85 PathProgramCache]: Analyzing trace with hash -1020102716, now seen corresponding path program 1 times [2022-12-06 00:01:17,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:01:17,267 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457591223] [2022-12-06 00:01:17,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:01:17,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:01:17,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:01:17,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-06 00:01:17,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:01:17,352 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457591223] [2022-12-06 00:01:17,352 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1457591223] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:01:17,352 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:01:17,352 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:01:17,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581172638] [2022-12-06 00:01:17,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:01:17,352 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:01:17,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:01:17,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:01:17,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:01:17,353 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:01:17,353 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:01:17,353 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:01:17,353 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:01:17,353 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:01:17,677 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:01:17,677 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 00:01:17,683 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26965/27010 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13528 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:01:17,692 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:01:17,692 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:01:17,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:01:17,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:01:17,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:01:17,693 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:01:17,693 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:01:17,693 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:01:17,727 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:01:17,729 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:17,729 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:01:17,729 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:01:17,729 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:01:17,729 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:17,730 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:01:17,730 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:01:17,730 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:17,731 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:17,762 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:01:17,762 INFO L131 PetriNetUnfolder]: For 3146/3287 co-relation queries the response was YES. [2022-12-06 00:01:17,763 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3146/3287 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2977 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:01:17,765 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:17,765 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:01:17,936 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:01:17,936 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 207 [2022-12-06 00:01:17,936 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:01:17,936 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:01:17,936 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:01:17,936 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:01:17,936 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable88 [2022-12-06 00:01:17,937 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-06 00:01:17,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:01:17,937 INFO L85 PathProgramCache]: Analyzing trace with hash 722707619, now seen corresponding path program 1 times [2022-12-06 00:01:17,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:01:17,937 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677322837] [2022-12-06 00:01:17,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:01:17,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:01:17,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:01:18,005 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-06 00:01:18,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:01:18,005 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677322837] [2022-12-06 00:01:18,005 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1677322837] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:01:18,005 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:01:18,005 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:01:18,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933190692] [2022-12-06 00:01:18,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:01:18,005 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:01:18,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:01:18,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:01:18,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:01:18,006 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:01:18,006 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:01:18,006 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:01:18,006 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:01:18,006 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:01:18,293 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:01:18,293 INFO L131 PetriNetUnfolder]: For 27229/27274 co-relation queries the response was YES. [2022-12-06 00:01:18,299 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27229/27274 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13570 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:01:18,307 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:01:18,307 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:01:18,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:01:18,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:01:18,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:01:18,308 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:01:18,308 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:01:18,308 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:01:18,348 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:01:18,350 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:18,350 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:01:18,351 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:01:18,351 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:01:18,351 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:18,351 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:01:18,352 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:01:18,352 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:18,353 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:18,381 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:01:18,381 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 00:01:18,382 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3312/3520 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2978 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:01:18,384 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:18,385 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:01:18,542 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:01:18,543 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 192 [2022-12-06 00:01:18,543 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:01:18,543 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:01:18,543 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:01:18,543 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:01:18,543 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable89 [2022-12-06 00:01:18,543 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-06 00:01:18,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:01:18,543 INFO L85 PathProgramCache]: Analyzing trace with hash -1829449342, now seen corresponding path program 1 times [2022-12-06 00:01:18,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:01:18,544 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327235475] [2022-12-06 00:01:18,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:01:18,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:01:18,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:01:18,616 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-06 00:01:18,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:01:18,617 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327235475] [2022-12-06 00:01:18,617 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [327235475] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:01:18,617 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:01:18,617 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:01:18,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374908960] [2022-12-06 00:01:18,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:01:18,617 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:01:18,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:01:18,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:01:18,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:01:18,618 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:01:18,618 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:01:18,618 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:01:18,618 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:01:18,618 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:01:18,950 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:01:18,950 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 00:01:18,955 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26969/27014 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13536 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:01:18,962 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:01:18,962 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:01:18,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:01:18,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:01:18,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:01:18,962 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:01:18,962 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:01:18,963 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:01:19,000 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:01:19,001 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:19,001 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:01:19,002 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:01:19,002 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:01:19,002 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:19,002 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:01:19,002 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:01:19,003 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:19,003 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:19,030 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:01:19,030 INFO L131 PetriNetUnfolder]: For 3122/3262 co-relation queries the response was YES. [2022-12-06 00:01:19,032 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3122/3262 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2959 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:01:19,033 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:19,033 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:01:19,196 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:01:19,197 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 195 [2022-12-06 00:01:19,197 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:01:19,197 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:01:19,197 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:01:19,197 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:01:19,197 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable90 [2022-12-06 00:01:19,197 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-06 00:01:19,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:01:19,197 INFO L85 PathProgramCache]: Analyzing trace with hash -86639007, now seen corresponding path program 1 times [2022-12-06 00:01:19,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:01:19,197 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126242563] [2022-12-06 00:01:19,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:01:19,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:01:19,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:01:19,271 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-06 00:01:19,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:01:19,271 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126242563] [2022-12-06 00:01:19,272 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [126242563] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:01:19,272 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:01:19,272 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:01:19,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342753309] [2022-12-06 00:01:19,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:01:19,272 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:01:19,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:01:19,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:01:19,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:01:19,273 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:01:19,273 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:01:19,273 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:01:19,273 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:01:19,273 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:01:19,667 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:01:19,667 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 00:01:19,672 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26969/27014 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13547 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:01:19,680 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:01:19,680 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:01:19,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:01:19,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:01:19,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:01:19,681 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:01:19,681 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:01:19,681 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:01:19,728 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:01:19,730 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:19,730 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:01:19,730 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:01:19,730 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:01:19,730 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:19,732 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:01:19,732 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:01:19,732 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:19,732 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:19,771 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:01:19,771 INFO L131 PetriNetUnfolder]: For 3122/3262 co-relation queries the response was YES. [2022-12-06 00:01:19,772 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3122/3262 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2973 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:01:19,775 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:19,775 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:01:20,032 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:01:20,032 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 302 [2022-12-06 00:01:20,032 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:01:20,032 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:01:20,032 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:01:20,032 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:01:20,033 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable91 [2022-12-06 00:01:20,033 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-06 00:01:20,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:01:20,033 INFO L85 PathProgramCache]: Analyzing trace with hash 1656171328, now seen corresponding path program 1 times [2022-12-06 00:01:20,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:01:20,033 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734172273] [2022-12-06 00:01:20,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:01:20,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:01:20,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:01:20,123 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-06 00:01:20,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:01:20,124 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734172273] [2022-12-06 00:01:20,124 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [734172273] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:01:20,124 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:01:20,124 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:01:20,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890186532] [2022-12-06 00:01:20,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:01:20,124 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:01:20,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:01:20,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:01:20,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:01:20,125 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:01:20,125 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:01:20,125 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:01:20,125 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:01:20,125 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:01:20,423 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:01:20,424 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:01:20,430 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13545 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:01:20,438 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:01:20,438 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:01:20,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:01:20,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:01:20,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:01:20,439 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:01:20,439 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:01:20,439 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:01:20,475 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:01:20,476 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:20,476 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:01:20,476 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:01:20,477 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:01:20,477 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:20,477 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:01:20,478 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:01:20,478 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:20,478 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:20,505 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:01:20,505 INFO L131 PetriNetUnfolder]: For 3348/3558 co-relation queries the response was YES. [2022-12-06 00:01:20,506 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3348/3558 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2987 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:01:20,508 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:20,509 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:01:20,652 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:01:20,653 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 176 [2022-12-06 00:01:20,653 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:01:20,653 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:01:20,653 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:01:20,653 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:01:20,653 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable92 [2022-12-06 00:01:20,653 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-06 00:01:20,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:01:20,654 INFO L85 PathProgramCache]: Analyzing trace with hash -895985633, now seen corresponding path program 1 times [2022-12-06 00:01:20,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:01:20,654 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088562306] [2022-12-06 00:01:20,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:01:20,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:01:20,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:01:20,723 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-06 00:01:20,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:01:20,724 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088562306] [2022-12-06 00:01:20,724 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2088562306] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:01:20,724 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:01:20,724 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:01:20,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752389283] [2022-12-06 00:01:20,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:01:20,724 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:01:20,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:01:20,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:01:20,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:01:20,725 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:01:20,725 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:01:20,725 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:01:20,725 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:01:20,725 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:01:21,160 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:01:21,161 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:01:21,170 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13543 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:01:21,181 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:01:21,181 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:01:21,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:01:21,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:01:21,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:01:21,182 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:01:21,182 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:01:21,182 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:01:21,225 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:01:21,227 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:21,227 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:01:21,227 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:01:21,227 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:01:21,227 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:21,228 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:01:21,228 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:01:21,228 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:21,229 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:21,255 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:01:21,255 INFO L131 PetriNetUnfolder]: For 3304/3511 co-relation queries the response was YES. [2022-12-06 00:01:21,256 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3304/3511 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2972 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:01:21,258 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:21,258 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:01:21,428 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:01:21,428 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 201 [2022-12-06 00:01:21,428 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:01:21,428 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:01:21,428 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:01:21,428 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:01:21,429 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable93 [2022-12-06 00:01:21,429 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-06 00:01:21,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:01:21,429 INFO L85 PathProgramCache]: Analyzing trace with hash 846824702, now seen corresponding path program 1 times [2022-12-06 00:01:21,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:01:21,429 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605045300] [2022-12-06 00:01:21,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:01:21,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:01:21,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:01:21,507 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-06 00:01:21,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:01:21,507 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605045300] [2022-12-06 00:01:21,507 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [605045300] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:01:21,507 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:01:21,507 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:01:21,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657562968] [2022-12-06 00:01:21,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:01:21,508 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:01:21,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:01:21,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:01:21,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:01:21,508 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:01:21,508 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:01:21,508 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:01:21,508 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:01:21,508 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:01:21,778 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:01:21,779 INFO L131 PetriNetUnfolder]: For 27229/27274 co-relation queries the response was YES. [2022-12-06 00:01:21,785 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27229/27274 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13549 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:01:21,793 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:01:21,793 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:01:21,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:01:21,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:01:21,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:01:21,794 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:01:21,794 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:01:21,794 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:01:21,827 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:01:21,828 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:21,829 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:01:21,829 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:01:21,829 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:01:21,829 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:21,830 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:01:21,830 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:01:21,830 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:21,830 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:21,854 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:01:21,854 INFO L131 PetriNetUnfolder]: For 3301/3509 co-relation queries the response was YES. [2022-12-06 00:01:21,855 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3301/3509 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2981 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:01:21,857 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:21,857 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:01:22,000 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:01:22,001 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 172 [2022-12-06 00:01:22,001 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:01:22,001 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:01:22,001 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:01:22,001 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:01:22,001 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable94 [2022-12-06 00:01:22,001 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-06 00:01:22,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:01:22,002 INFO L85 PathProgramCache]: Analyzing trace with hash -1705332259, now seen corresponding path program 1 times [2022-12-06 00:01:22,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:01:22,002 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960742414] [2022-12-06 00:01:22,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:01:22,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:01:22,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:01:22,087 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-06 00:01:22,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:01:22,088 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960742414] [2022-12-06 00:01:22,088 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1960742414] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:01:22,088 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:01:22,088 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:01:22,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030528392] [2022-12-06 00:01:22,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:01:22,089 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:01:22,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:01:22,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:01:22,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:01:22,089 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:01:22,089 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:01:22,089 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:01:22,089 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:01:22,089 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:01:22,393 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:01:22,393 INFO L131 PetriNetUnfolder]: For 26955/27000 co-relation queries the response was YES. [2022-12-06 00:01:22,398 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26955/27000 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13511 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:01:22,405 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:01:22,405 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:01:22,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:01:22,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:01:22,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:01:22,406 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:01:22,406 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:01:22,406 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:01:22,440 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:01:22,441 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:22,442 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:01:22,442 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:01:22,442 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:01:22,442 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:22,442 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:01:22,442 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:01:22,443 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:22,443 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:22,469 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:01:22,469 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 00:01:22,470 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3133/3273 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2992 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:01:22,472 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:22,472 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:01:22,631 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:01:22,631 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 189 [2022-12-06 00:01:22,632 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:01:22,632 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:01:22,632 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:01:22,632 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:01:22,632 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable95 [2022-12-06 00:01:22,632 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-06 00:01:22,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:01:22,632 INFO L85 PathProgramCache]: Analyzing trace with hash 37478076, now seen corresponding path program 1 times [2022-12-06 00:01:22,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:01:22,633 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243079149] [2022-12-06 00:01:22,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:01:22,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:01:22,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:01:22,724 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-06 00:01:22,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:01:22,724 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243079149] [2022-12-06 00:01:22,724 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [243079149] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:01:22,724 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:01:22,725 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:01:22,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37505588] [2022-12-06 00:01:22,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:01:22,725 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:01:22,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:01:22,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:01:22,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:01:22,725 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:01:22,725 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:01:22,725 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:01:22,725 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:01:22,725 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:01:23,036 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:01:23,036 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 00:01:23,042 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26965/27010 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13505 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:01:23,076 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:01:23,076 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:01:23,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:01:23,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:01:23,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:01:23,077 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:01:23,077 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:01:23,077 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:01:23,108 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:01:23,109 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:23,110 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:01:23,110 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:01:23,110 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:01:23,110 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:23,111 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:01:23,111 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:01:23,111 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:23,112 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:23,146 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:01:23,146 INFO L131 PetriNetUnfolder]: For 3146/3287 co-relation queries the response was YES. [2022-12-06 00:01:23,147 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3146/3287 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2969 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:01:23,150 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:23,150 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:01:23,299 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:01:23,299 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 189 [2022-12-06 00:01:23,299 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:01:23,299 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:01:23,299 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:01:23,299 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:01:23,299 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable96 [2022-12-06 00:01:23,300 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-06 00:01:23,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:01:23,300 INFO L85 PathProgramCache]: Analyzing trace with hash 1780288411, now seen corresponding path program 1 times [2022-12-06 00:01:23,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:01:23,300 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144819483] [2022-12-06 00:01:23,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:01:23,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:01:23,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:01:23,380 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-06 00:01:23,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:01:23,380 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144819483] [2022-12-06 00:01:23,380 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [144819483] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:01:23,380 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:01:23,381 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:01:23,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249516383] [2022-12-06 00:01:23,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:01:23,381 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:01:23,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:01:23,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:01:23,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:01:23,381 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:01:23,381 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:01:23,382 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:01:23,382 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:01:23,382 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:01:23,693 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:01:23,693 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 00:01:23,699 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26965/27010 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13509 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:01:23,706 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:01:23,706 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:01:23,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:01:23,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:01:23,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:01:23,707 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:01:23,707 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:01:23,707 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:01:23,742 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:01:23,745 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:23,745 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:01:23,745 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:01:23,745 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:01:23,745 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:23,746 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:01:23,746 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:01:23,746 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:23,747 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:23,781 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:01:23,781 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 00:01:23,783 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3133/3273 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2971 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:01:23,785 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:23,785 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:01:23,967 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:01:23,967 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 222 [2022-12-06 00:01:23,967 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:01:23,968 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:01:23,968 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:01:23,968 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:01:23,968 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable97 [2022-12-06 00:01:23,968 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-06 00:01:23,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:01:23,968 INFO L85 PathProgramCache]: Analyzing trace with hash -771868550, now seen corresponding path program 1 times [2022-12-06 00:01:23,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:01:23,968 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473862813] [2022-12-06 00:01:23,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:01:23,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:01:23,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:01:24,054 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-06 00:01:24,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:01:24,054 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473862813] [2022-12-06 00:01:24,054 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1473862813] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:01:24,054 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:01:24,054 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:01:24,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679105110] [2022-12-06 00:01:24,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:01:24,055 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:01:24,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:01:24,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:01:24,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:01:24,055 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:01:24,055 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:01:24,055 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:01:24,055 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:01:24,055 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:01:24,338 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:01:24,338 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:01:24,344 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13550 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:01:24,351 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:01:24,351 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:01:24,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:01:24,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:01:24,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:01:24,352 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:01:24,352 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:01:24,352 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:01:24,385 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:01:24,386 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:24,386 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:01:24,387 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:01:24,387 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:01:24,387 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:24,387 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:01:24,387 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:01:24,388 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:24,388 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:24,412 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:01:24,413 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 00:01:24,413 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3321/3530 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2994 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:01:24,415 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:24,415 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:01:24,568 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:01:24,569 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 182 [2022-12-06 00:01:24,569 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:01:24,569 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:01:24,569 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:01:24,569 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:01:24,569 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable98 [2022-12-06 00:01:24,569 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-06 00:01:24,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:01:24,570 INFO L85 PathProgramCache]: Analyzing trace with hash 970941785, now seen corresponding path program 1 times [2022-12-06 00:01:24,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:01:24,570 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062716986] [2022-12-06 00:01:24,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:01:24,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:01:24,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:01:24,636 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-06 00:01:24,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:01:24,636 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062716986] [2022-12-06 00:01:24,636 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2062716986] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:01:24,636 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:01:24,636 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:01:24,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292220003] [2022-12-06 00:01:24,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:01:24,637 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:01:24,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:01:24,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:01:24,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:01:24,637 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:01:24,637 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:01:24,637 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:01:24,637 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:01:24,637 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:01:24,924 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:01:24,924 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:01:24,930 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13577 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:01:24,936 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:01:24,937 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:01:24,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:01:24,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:01:24,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:01:24,937 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:01:24,937 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:01:24,937 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:01:24,971 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:01:24,973 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:24,973 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:01:24,973 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:01:24,973 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:01:24,974 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:24,974 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:01:24,974 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:01:24,974 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:24,975 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:25,000 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:01:25,000 INFO L131 PetriNetUnfolder]: For 3301/3509 co-relation queries the response was YES. [2022-12-06 00:01:25,001 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3301/3509 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2982 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:01:25,003 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:25,003 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:01:25,149 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:01:25,149 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 176 [2022-12-06 00:01:25,149 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:01:25,149 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:01:25,150 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:01:25,150 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:01:25,150 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable99 [2022-12-06 00:01:25,150 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-06 00:01:25,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:01:25,150 INFO L85 PathProgramCache]: Analyzing trace with hash -1581215176, now seen corresponding path program 1 times [2022-12-06 00:01:25,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:01:25,150 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488072169] [2022-12-06 00:01:25,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:01:25,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:01:25,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:01:25,225 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-06 00:01:25,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:01:25,225 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488072169] [2022-12-06 00:01:25,226 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [488072169] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:01:25,226 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:01:25,226 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:01:25,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788777621] [2022-12-06 00:01:25,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:01:25,227 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:01:25,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:01:25,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:01:25,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:01:25,227 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:01:25,227 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:01:25,227 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:01:25,227 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:01:25,227 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:01:25,512 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:01:25,512 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:01:25,518 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13560 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:01:25,526 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:01:25,526 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:01:25,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:01:25,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:01:25,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:01:25,527 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:01:25,527 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:01:25,527 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:01:25,562 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:01:25,564 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:25,564 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:01:25,565 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:01:25,565 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:01:25,565 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:25,565 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:01:25,565 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:01:25,566 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:25,566 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:25,591 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:01:25,591 INFO L131 PetriNetUnfolder]: For 3349/3561 co-relation queries the response was YES. [2022-12-06 00:01:25,592 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3349/3561 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2985 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:01:25,595 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:25,595 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:01:25,759 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:01:25,763 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 198 [2022-12-06 00:01:25,763 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:01:25,763 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:01:25,763 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:01:25,763 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:01:25,763 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable100 [2022-12-06 00:01:25,763 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-06 00:01:25,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:01:25,764 INFO L85 PathProgramCache]: Analyzing trace with hash 161595159, now seen corresponding path program 1 times [2022-12-06 00:01:25,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:01:25,764 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143584997] [2022-12-06 00:01:25,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:01:25,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:01:25,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:01:25,836 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-06 00:01:25,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:01:25,836 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143584997] [2022-12-06 00:01:25,837 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [143584997] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:01:25,837 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:01:25,837 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:01:25,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572502655] [2022-12-06 00:01:25,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:01:25,837 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:01:25,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:01:25,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:01:25,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:01:25,837 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:01:25,837 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:01:25,837 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:01:25,838 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:01:25,838 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:01:26,141 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:01:26,141 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:01:26,150 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13560 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:01:26,160 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:01:26,160 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:01:26,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:01:26,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:01:26,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:01:26,163 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:01:26,163 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:01:26,163 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:01:26,215 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:01:26,217 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:26,217 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:01:26,217 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:01:26,217 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:01:26,217 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:26,218 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:01:26,218 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:01:26,218 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:26,219 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:26,250 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:01:26,250 INFO L131 PetriNetUnfolder]: For 3304/3511 co-relation queries the response was YES. [2022-12-06 00:01:26,251 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3304/3511 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2984 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:01:26,254 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:26,254 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:01:26,438 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:01:26,439 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 222 [2022-12-06 00:01:26,439 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:01:26,439 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:01:26,439 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:01:26,439 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:01:26,439 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable101 [2022-12-06 00:01:26,439 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-06 00:01:26,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:01:26,439 INFO L85 PathProgramCache]: Analyzing trace with hash 1904405494, now seen corresponding path program 1 times [2022-12-06 00:01:26,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:01:26,439 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601251139] [2022-12-06 00:01:26,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:01:26,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:01:26,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:01:26,508 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-06 00:01:26,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:01:26,509 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601251139] [2022-12-06 00:01:26,509 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [601251139] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:01:26,509 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:01:26,509 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:01:26,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674368666] [2022-12-06 00:01:26,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:01:26,509 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:01:26,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:01:26,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:01:26,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:01:26,510 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:01:26,510 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:01:26,510 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:01:26,510 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:01:26,510 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:01:26,907 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:01:26,907 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:01:26,915 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13548 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:01:26,926 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:01:26,926 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:01:26,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:01:26,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:01:26,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:01:26,927 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:01:26,927 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:01:26,927 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:01:26,974 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:01:26,976 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:26,976 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:01:26,977 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:01:26,977 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:01:26,977 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:26,977 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:01:26,977 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:01:26,978 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:26,978 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:27,013 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:01:27,013 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 00:01:27,015 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3312/3520 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2965 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:01:27,018 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:27,018 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:01:27,197 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:01:27,198 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 221 [2022-12-06 00:01:27,198 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:01:27,198 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:01:27,198 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:01:27,198 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:01:27,198 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable102 [2022-12-06 00:01:27,198 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-06 00:01:27,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:01:27,199 INFO L85 PathProgramCache]: Analyzing trace with hash -647751467, now seen corresponding path program 1 times [2022-12-06 00:01:27,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:01:27,199 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664116357] [2022-12-06 00:01:27,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:01:27,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:01:27,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:01:27,290 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-06 00:01:27,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:01:27,290 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664116357] [2022-12-06 00:01:27,290 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1664116357] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:01:27,290 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:01:27,290 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:01:27,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873810013] [2022-12-06 00:01:27,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:01:27,291 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:01:27,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:01:27,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:01:27,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:01:27,291 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:01:27,291 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:01:27,291 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:01:27,292 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:01:27,292 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:01:27,684 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:01:27,684 INFO L131 PetriNetUnfolder]: For 27229/27274 co-relation queries the response was YES. [2022-12-06 00:01:27,693 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27229/27274 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13561 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:01:27,708 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:01:27,708 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:01:27,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:01:27,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:01:27,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:01:27,709 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:01:27,709 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:01:27,710 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:01:27,760 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:01:27,779 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:27,779 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:01:27,779 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:01:27,779 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:01:27,780 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:27,780 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:01:27,780 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:01:27,781 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:27,781 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:27,819 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:01:27,819 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 00:01:27,820 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3321/3530 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2997 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:01:27,823 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:27,823 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:01:28,030 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:01:28,031 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 252 [2022-12-06 00:01:28,031 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:01:28,031 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:01:28,031 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:01:28,032 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:01:28,032 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable103 [2022-12-06 00:01:28,032 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-06 00:01:28,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:01:28,032 INFO L85 PathProgramCache]: Analyzing trace with hash 1095058868, now seen corresponding path program 1 times [2022-12-06 00:01:28,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:01:28,032 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523462621] [2022-12-06 00:01:28,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:01:28,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:01:28,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:01:28,158 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-06 00:01:28,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:01:28,158 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523462621] [2022-12-06 00:01:28,158 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [523462621] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:01:28,158 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:01:28,159 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:01:28,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268990396] [2022-12-06 00:01:28,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:01:28,159 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:01:28,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:01:28,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:01:28,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:01:28,170 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:01:28,170 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:01:28,170 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:01:28,170 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:01:28,170 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:01:28,597 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:01:28,597 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 00:01:28,604 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26969/27014 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13552 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:01:28,614 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:01:28,614 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:01:28,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:01:28,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:01:28,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:01:28,615 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:01:28,615 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:01:28,615 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:01:28,662 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:01:28,670 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:28,670 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:01:28,671 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:01:28,671 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:01:28,671 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:28,672 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:01:28,672 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:01:28,672 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:28,673 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:28,753 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:01:28,753 INFO L131 PetriNetUnfolder]: For 3146/3287 co-relation queries the response was YES. [2022-12-06 00:01:28,759 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3146/3287 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2973 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:01:28,767 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:28,768 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:01:28,996 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:01:28,997 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 326 [2022-12-06 00:01:28,997 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:01:28,997 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:01:28,997 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:01:28,997 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:01:28,997 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable104 [2022-12-06 00:01:28,997 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-06 00:01:28,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:01:28,998 INFO L85 PathProgramCache]: Analyzing trace with hash -1457098093, now seen corresponding path program 1 times [2022-12-06 00:01:28,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:01:28,998 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279942501] [2022-12-06 00:01:28,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:01:28,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:01:29,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:01:29,606 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-06 00:01:29,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:01:29,606 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279942501] [2022-12-06 00:01:29,606 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [279942501] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:01:29,606 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:01:29,607 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:01:29,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159643129] [2022-12-06 00:01:29,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:01:29,607 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:01:29,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:01:29,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:01:29,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:01:29,607 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:01:29,608 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:01:29,608 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:01:29,608 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:01:29,608 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:01:30,308 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:01:30,308 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 00:01:30,316 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26969/27014 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13515 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:01:30,326 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:01:30,326 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:01:30,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:01:30,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:01:30,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:01:30,327 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:01:30,327 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:01:30,327 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:01:30,377 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:01:30,379 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:30,379 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:01:30,380 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:01:30,380 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:01:30,380 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:30,380 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:01:30,381 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:01:30,381 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:30,381 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:30,413 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:01:30,414 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 00:01:30,415 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3133/3273 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2985 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:01:30,418 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:30,418 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:01:30,594 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:01:30,595 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 215 [2022-12-06 00:01:30,595 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:01:30,595 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:01:30,595 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:01:30,595 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:01:30,595 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable105 [2022-12-06 00:01:30,595 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-06 00:01:30,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:01:30,596 INFO L85 PathProgramCache]: Analyzing trace with hash 285712242, now seen corresponding path program 1 times [2022-12-06 00:01:30,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:01:30,596 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306622140] [2022-12-06 00:01:30,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:01:30,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:01:30,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:01:30,686 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-06 00:01:30,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:01:30,686 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306622140] [2022-12-06 00:01:30,686 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [306622140] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:01:30,686 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:01:30,686 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:01:30,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93185885] [2022-12-06 00:01:30,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:01:30,687 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:01:30,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:01:30,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:01:30,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:01:30,687 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:01:30,687 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:01:30,687 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:01:30,688 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:01:30,688 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:01:31,051 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:01:31,051 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:01:31,059 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13571 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:01:31,070 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:01:31,070 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:01:31,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:01:31,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:01:31,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:01:31,071 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:01:31,071 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:01:31,071 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:01:31,118 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:01:31,123 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:31,124 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:01:31,124 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:01:31,124 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:01:31,124 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:31,125 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:01:31,125 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:01:31,125 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:31,126 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:31,158 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:01:31,158 INFO L131 PetriNetUnfolder]: For 3310/3519 co-relation queries the response was YES. [2022-12-06 00:01:31,160 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3310/3519 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2992 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:01:31,162 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:31,162 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:01:31,359 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:01:31,360 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 236 [2022-12-06 00:01:31,360 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:01:31,360 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:01:31,360 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:01:31,360 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:01:31,360 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable106 [2022-12-06 00:01:31,360 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-06 00:01:31,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:01:31,361 INFO L85 PathProgramCache]: Analyzing trace with hash 2028522577, now seen corresponding path program 1 times [2022-12-06 00:01:31,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:01:31,361 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198959819] [2022-12-06 00:01:31,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:01:31,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:01:31,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:01:31,448 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:01:31,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:01:31,449 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198959819] [2022-12-06 00:01:31,449 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1198959819] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:01:31,449 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:01:31,449 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:01:31,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4901853] [2022-12-06 00:01:31,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:01:31,449 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:01:31,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:01:31,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:01:31,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:01:31,450 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:01:31,450 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:01:31,450 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:01:31,450 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:01:31,450 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:01:31,846 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:01:31,847 INFO L131 PetriNetUnfolder]: For 26955/27000 co-relation queries the response was YES. [2022-12-06 00:01:31,855 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26955/27000 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13520 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:01:31,864 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:01:31,865 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:01:31,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:01:31,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:01:31,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:01:31,865 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:01:31,866 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:01:31,866 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:01:31,915 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:01:31,917 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:31,917 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:01:31,917 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:01:31,917 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:01:31,917 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:31,919 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:01:31,919 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:01:31,919 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:31,921 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:31,953 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:01:31,953 INFO L131 PetriNetUnfolder]: For 3122/3262 co-relation queries the response was YES. [2022-12-06 00:01:31,954 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3122/3262 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2982 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:01:31,957 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:31,957 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:01:32,127 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:01:32,128 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 211 [2022-12-06 00:01:32,128 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:01:32,128 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:01:32,128 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:01:32,128 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:01:32,128 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable107 [2022-12-06 00:01:32,129 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-06 00:01:32,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:01:32,129 INFO L85 PathProgramCache]: Analyzing trace with hash -523634384, now seen corresponding path program 1 times [2022-12-06 00:01:32,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:01:32,129 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502247539] [2022-12-06 00:01:32,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:01:32,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:01:32,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:01:32,226 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-06 00:01:32,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:01:32,226 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502247539] [2022-12-06 00:01:32,226 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [502247539] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:01:32,226 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:01:32,226 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:01:32,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030953010] [2022-12-06 00:01:32,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:01:32,227 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:01:32,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:01:32,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:01:32,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:01:32,227 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:01:32,227 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:01:32,227 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:01:32,227 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:01:32,227 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:01:32,604 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:01:32,604 INFO L131 PetriNetUnfolder]: For 26955/27000 co-relation queries the response was YES. [2022-12-06 00:01:32,612 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26955/27000 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13528 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:01:32,622 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:01:32,623 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:01:32,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:01:32,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:01:32,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:01:32,635 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:01:32,636 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:01:32,636 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:01:32,685 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:01:32,687 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:32,688 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:01:32,688 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:01:32,688 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:01:32,688 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:32,689 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:01:32,689 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:01:32,689 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:32,690 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:32,723 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:01:32,723 INFO L131 PetriNetUnfolder]: For 3140/3283 co-relation queries the response was YES. [2022-12-06 00:01:32,725 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3140/3283 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2980 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:01:32,727 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:32,728 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:01:32,896 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:01:32,897 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 209 [2022-12-06 00:01:32,897 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:01:32,897 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:01:32,897 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:01:32,897 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:01:32,897 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable108 [2022-12-06 00:01:32,897 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-06 00:01:32,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:01:32,897 INFO L85 PathProgramCache]: Analyzing trace with hash 1219175951, now seen corresponding path program 1 times [2022-12-06 00:01:32,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:01:32,898 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042470045] [2022-12-06 00:01:32,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:01:32,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:01:32,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:01:32,999 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-06 00:01:32,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:01:32,999 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042470045] [2022-12-06 00:01:32,999 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1042470045] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:01:32,999 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:01:32,999 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:01:32,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503196765] [2022-12-06 00:01:32,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:01:33,000 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:01:33,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:01:33,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:01:33,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:01:33,000 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:01:33,000 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:01:33,000 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:01:33,000 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:01:33,001 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:01:33,551 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:01:33,552 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:01:33,560 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13581 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:01:33,570 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:01:33,571 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:01:33,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:01:33,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:01:33,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:01:33,572 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:01:33,573 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:01:33,573 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:01:33,624 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:01:33,626 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:33,626 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:01:33,626 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:01:33,626 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:01:33,627 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:33,627 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:01:33,627 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:01:33,628 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:33,628 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:33,681 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:01:33,682 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 00:01:33,683 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3312/3520 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2980 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:01:33,686 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:33,686 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:01:33,865 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:01:33,866 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 240 [2022-12-06 00:01:33,866 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:01:33,866 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:01:33,866 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:01:33,866 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:01:33,866 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable109 [2022-12-06 00:01:33,867 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-06 00:01:33,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:01:33,867 INFO L85 PathProgramCache]: Analyzing trace with hash -1332981010, now seen corresponding path program 1 times [2022-12-06 00:01:33,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:01:33,867 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427289538] [2022-12-06 00:01:33,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:01:33,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:01:33,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:01:34,047 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-06 00:01:34,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:01:34,047 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427289538] [2022-12-06 00:01:34,048 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [427289538] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:01:34,048 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:01:34,048 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:01:34,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49579540] [2022-12-06 00:01:34,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:01:34,048 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:01:34,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:01:34,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:01:34,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:01:34,049 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:01:34,049 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:01:34,049 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:01:34,049 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:01:34,049 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:01:34,421 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:01:34,421 INFO L131 PetriNetUnfolder]: For 27146/27191 co-relation queries the response was YES. [2022-12-06 00:01:34,430 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27146/27191 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13550 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:01:34,441 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:01:34,441 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:01:34,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:01:34,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:01:34,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:01:34,442 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:01:34,442 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:01:34,442 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:01:34,491 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:01:34,494 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:34,494 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:01:34,494 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:01:34,494 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:01:34,494 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:34,495 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:01:34,495 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:01:34,495 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:34,496 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:34,531 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:01:34,531 INFO L131 PetriNetUnfolder]: For 3167/3307 co-relation queries the response was YES. [2022-12-06 00:01:34,532 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3167/3307 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2991 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:01:34,535 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:34,535 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:01:34,718 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:01:34,719 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 225 [2022-12-06 00:01:34,719 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:01:34,719 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:01:34,719 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:01:34,719 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:01:34,719 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable110 [2022-12-06 00:01:34,719 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-06 00:01:34,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:01:34,719 INFO L85 PathProgramCache]: Analyzing trace with hash 409829325, now seen corresponding path program 1 times [2022-12-06 00:01:34,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:01:34,720 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384645966] [2022-12-06 00:01:34,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:01:34,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:01:34,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:01:34,814 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-06 00:01:34,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:01:34,814 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384645966] [2022-12-06 00:01:34,814 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1384645966] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:01:34,814 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:01:34,814 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:01:34,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477791162] [2022-12-06 00:01:34,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:01:34,815 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:01:34,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:01:34,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:01:34,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:01:34,815 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:01:34,815 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:01:34,816 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:01:34,816 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:01:34,816 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:01:35,210 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:01:35,210 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:01:35,220 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13567 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:01:35,230 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:01:35,231 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:01:35,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:01:35,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:01:35,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:01:35,232 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:01:35,232 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:01:35,232 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:01:35,290 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:01:35,310 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:35,310 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:01:35,310 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:01:35,310 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:01:35,311 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:35,311 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:01:35,311 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:01:35,312 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:35,313 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:35,386 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:01:35,387 INFO L131 PetriNetUnfolder]: For 3301/3509 co-relation queries the response was YES. [2022-12-06 00:01:35,404 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3301/3509 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2982 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:01:35,408 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:35,408 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:01:35,601 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:01:35,601 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 291 [2022-12-06 00:01:35,601 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:01:35,601 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:01:35,601 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:01:35,602 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:01:35,602 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable111 [2022-12-06 00:01:35,602 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-06 00:01:35,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:01:35,602 INFO L85 PathProgramCache]: Analyzing trace with hash -2142327636, now seen corresponding path program 1 times [2022-12-06 00:01:35,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:01:35,602 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071372871] [2022-12-06 00:01:35,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:01:35,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:01:35,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:01:35,702 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-06 00:01:35,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:01:35,702 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071372871] [2022-12-06 00:01:35,703 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1071372871] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:01:35,703 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:01:35,703 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:01:35,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357083274] [2022-12-06 00:01:35,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:01:35,703 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:01:35,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:01:35,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:01:35,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:01:35,704 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:01:35,704 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:01:35,704 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:01:35,704 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:01:35,704 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:01:36,110 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:01:36,110 INFO L131 PetriNetUnfolder]: For 27136/27181 co-relation queries the response was YES. [2022-12-06 00:01:36,118 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27136/27181 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13519 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:01:36,128 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:01:36,128 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:01:36,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:01:36,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:01:36,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:01:36,141 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:01:36,141 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:01:36,141 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:01:36,188 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:01:36,190 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:36,190 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:01:36,191 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:01:36,191 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:01:36,191 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:36,192 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:01:36,192 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:01:36,192 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:36,193 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:36,226 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:01:36,227 INFO L131 PetriNetUnfolder]: For 3169/3310 co-relation queries the response was YES. [2022-12-06 00:01:36,228 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3169/3310 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 3001 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:01:36,231 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:36,231 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:01:36,420 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:01:36,421 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 230 [2022-12-06 00:01:36,421 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:01:36,421 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:01:36,421 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:01:36,421 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:01:36,422 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable112 [2022-12-06 00:01:36,422 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-06 00:01:36,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:01:36,422 INFO L85 PathProgramCache]: Analyzing trace with hash -399517301, now seen corresponding path program 1 times [2022-12-06 00:01:36,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:01:36,422 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887994415] [2022-12-06 00:01:36,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:01:36,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:01:36,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:01:36,556 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-06 00:01:36,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:01:36,557 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887994415] [2022-12-06 00:01:36,557 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1887994415] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:01:36,557 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:01:36,557 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:01:36,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326550870] [2022-12-06 00:01:36,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:01:36,558 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:01:36,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:01:36,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:01:36,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:01:36,559 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:01:36,559 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:01:36,559 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:01:36,559 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:01:36,559 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:01:36,921 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:01:36,921 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 00:01:36,929 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13555 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:01:36,940 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:01:36,941 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:01:36,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:01:36,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:01:36,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:01:36,942 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:01:36,942 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:01:36,942 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:01:36,990 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:01:36,992 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:36,992 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:01:36,993 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:01:36,993 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:01:36,993 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:36,993 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:01:36,994 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:01:36,994 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:36,994 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:37,029 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:01:37,029 INFO L131 PetriNetUnfolder]: For 3293/3500 co-relation queries the response was YES. [2022-12-06 00:01:37,031 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3293/3500 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2970 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:01:37,034 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:37,034 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:01:37,500 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:01:37,501 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 508 [2022-12-06 00:01:37,501 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:01:37,501 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:01:37,501 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:01:37,501 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:01:37,501 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable113 [2022-12-06 00:01:37,501 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-06 00:01:37,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:01:37,502 INFO L85 PathProgramCache]: Analyzing trace with hash 1343293034, now seen corresponding path program 1 times [2022-12-06 00:01:37,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:01:37,502 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315536029] [2022-12-06 00:01:37,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:01:37,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:01:37,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:01:37,602 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-06 00:01:37,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:01:37,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315536029] [2022-12-06 00:01:37,603 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [315536029] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:01:37,603 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:01:37,603 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:01:37,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171680027] [2022-12-06 00:01:37,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:01:37,603 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:01:37,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:01:37,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:01:37,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:01:37,604 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:01:37,604 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:01:37,604 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:01:37,604 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:01:37,604 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:01:37,974 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:01:37,975 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:01:37,985 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13559 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:01:37,996 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:01:37,997 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:01:37,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:01:37,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:01:37,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:01:37,998 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:01:37,998 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:01:37,998 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:01:38,048 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:01:38,050 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:38,050 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:01:38,050 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:01:38,050 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:01:38,050 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:38,054 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:01:38,054 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:01:38,054 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:38,055 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:38,092 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:01:38,092 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 00:01:38,093 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3321/3530 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2988 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:01:38,096 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:38,096 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:01:38,280 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:01:38,281 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 231 [2022-12-06 00:01:38,281 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:01:38,281 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:01:38,281 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:01:38,281 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:01:38,282 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable114 [2022-12-06 00:01:38,282 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-06 00:01:38,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:01:38,282 INFO L85 PathProgramCache]: Analyzing trace with hash -1208863927, now seen corresponding path program 1 times [2022-12-06 00:01:38,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:01:38,282 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50923335] [2022-12-06 00:01:38,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:01:38,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:01:38,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:01:38,392 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-06 00:01:38,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:01:38,393 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50923335] [2022-12-06 00:01:38,393 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [50923335] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:01:38,393 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:01:38,393 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:01:38,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085481666] [2022-12-06 00:01:38,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:01:38,393 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:01:38,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:01:38,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:01:38,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:01:38,394 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:01:38,394 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:01:38,394 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:01:38,394 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:01:38,394 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:01:38,752 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:01:38,753 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:01:38,760 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13560 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:01:38,769 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:01:38,769 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:01:38,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:01:38,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:01:38,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:01:38,781 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:01:38,781 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:01:38,781 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:01:38,830 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:01:38,832 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:38,832 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:01:38,832 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:01:38,833 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:01:38,833 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:38,833 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:01:38,833 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:01:38,833 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:38,834 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:38,869 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:01:38,869 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 00:01:38,871 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3321/3530 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2973 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:01:38,874 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:38,874 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:01:39,072 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:01:39,073 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 240 [2022-12-06 00:01:39,073 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:01:39,073 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:01:39,073 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:01:39,073 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:01:39,073 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable115 [2022-12-06 00:01:39,073 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-06 00:01:39,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:01:39,074 INFO L85 PathProgramCache]: Analyzing trace with hash 533946408, now seen corresponding path program 1 times [2022-12-06 00:01:39,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:01:39,074 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086925758] [2022-12-06 00:01:39,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:01:39,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:01:39,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:01:39,183 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-06 00:01:39,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:01:39,183 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086925758] [2022-12-06 00:01:39,184 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2086925758] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:01:39,184 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:01:39,184 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:01:39,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058233774] [2022-12-06 00:01:39,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:01:39,184 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:01:39,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:01:39,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:01:39,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:01:39,185 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:01:39,185 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:01:39,185 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:01:39,185 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:01:39,185 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:01:39,601 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:01:39,601 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:01:39,609 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13568 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:01:39,620 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:01:39,620 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:01:39,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:01:39,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:01:39,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:01:39,621 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:01:39,621 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:01:39,621 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:01:39,673 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:01:39,675 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:39,675 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:01:39,675 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:01:39,675 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:01:39,676 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:39,676 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:01:39,676 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:01:39,676 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:39,677 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:39,710 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:01:39,710 INFO L131 PetriNetUnfolder]: For 3348/3558 co-relation queries the response was YES. [2022-12-06 00:01:39,712 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3348/3558 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2978 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:01:39,714 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:39,715 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:01:39,901 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:01:39,901 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 226 [2022-12-06 00:01:39,901 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:01:39,901 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:01:39,902 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:01:39,902 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:01:39,902 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable116 [2022-12-06 00:01:39,902 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-06 00:01:39,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:01:39,902 INFO L85 PathProgramCache]: Analyzing trace with hash -2018210553, now seen corresponding path program 1 times [2022-12-06 00:01:39,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:01:39,902 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092916333] [2022-12-06 00:01:39,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:01:39,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:01:39,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:01:40,002 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-06 00:01:40,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:01:40,002 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092916333] [2022-12-06 00:01:40,002 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1092916333] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:01:40,002 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:01:40,002 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:01:40,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691319041] [2022-12-06 00:01:40,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:01:40,005 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:01:40,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:01:40,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:01:40,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:01:40,006 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:01:40,006 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:01:40,006 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:01:40,006 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:01:40,006 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:01:40,404 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:01:40,404 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:01:40,410 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13539 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:01:40,418 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:01:40,418 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:01:40,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:01:40,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:01:40,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:01:40,419 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:01:40,419 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:01:40,419 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:01:40,460 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:01:40,461 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:40,461 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:01:40,462 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:01:40,462 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:01:40,462 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:40,474 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:01:40,474 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:01:40,474 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:40,475 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:40,507 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:01:40,507 INFO L131 PetriNetUnfolder]: For 3304/3511 co-relation queries the response was YES. [2022-12-06 00:01:40,509 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3304/3511 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2988 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:01:40,512 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:40,512 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:01:40,693 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:01:40,693 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 231 [2022-12-06 00:01:40,693 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:01:40,693 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:01:40,694 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:01:40,694 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:01:40,694 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable117 [2022-12-06 00:01:40,694 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-06 00:01:40,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:01:40,694 INFO L85 PathProgramCache]: Analyzing trace with hash -275400218, now seen corresponding path program 1 times [2022-12-06 00:01:40,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:01:40,694 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602800889] [2022-12-06 00:01:40,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:01:40,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:01:40,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:01:40,824 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-06 00:01:40,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:01:40,824 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602800889] [2022-12-06 00:01:40,824 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1602800889] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:01:40,824 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:01:40,825 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:01:40,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692613562] [2022-12-06 00:01:40,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:01:40,826 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:01:40,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:01:40,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:01:40,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:01:40,827 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:01:40,827 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:01:40,827 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:01:40,827 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:01:40,827 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:01:41,344 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:01:41,352 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:01:41,360 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13565 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:01:41,386 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:01:41,386 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:01:41,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:01:41,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:01:41,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:01:41,402 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:01:41,402 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:01:41,402 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:01:41,489 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:01:41,491 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:41,491 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:01:41,491 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:01:41,492 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:01:41,492 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:41,492 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:01:41,492 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:01:41,493 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:41,493 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:41,527 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:01:41,527 INFO L131 PetriNetUnfolder]: For 3310/3519 co-relation queries the response was YES. [2022-12-06 00:01:41,528 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3310/3519 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2975 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:01:41,531 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:41,532 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:01:41,703 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:01:41,703 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 211 [2022-12-06 00:01:41,704 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:01:41,704 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:01:41,704 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:01:41,704 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:01:41,704 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable118 [2022-12-06 00:01:41,704 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-06 00:01:41,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:01:41,704 INFO L85 PathProgramCache]: Analyzing trace with hash 1467410117, now seen corresponding path program 1 times [2022-12-06 00:01:41,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:01:41,704 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575451905] [2022-12-06 00:01:41,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:01:41,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:01:41,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:01:41,809 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-06 00:01:41,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:01:41,809 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575451905] [2022-12-06 00:01:41,809 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1575451905] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:01:41,809 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:01:41,809 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:01:41,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666577556] [2022-12-06 00:01:41,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:01:41,810 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:01:41,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:01:41,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:01:41,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:01:41,810 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:01:41,810 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:01:41,811 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:01:41,811 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:01:41,811 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:01:42,161 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:01:42,161 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 00:01:42,169 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13551 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:01:42,178 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:01:42,179 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:01:42,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:01:42,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:01:42,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:01:42,180 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:01:42,180 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:01:42,180 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:01:42,226 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:01:42,228 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:42,228 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:01:42,228 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:01:42,228 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:01:42,228 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:42,230 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:01:42,230 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:01:42,230 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:42,231 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:42,264 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:01:42,264 INFO L131 PetriNetUnfolder]: For 3310/3519 co-relation queries the response was YES. [2022-12-06 00:01:42,265 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3310/3519 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2989 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:01:42,268 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:42,268 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:01:42,448 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:01:42,449 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 221 [2022-12-06 00:01:42,449 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:01:42,449 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:01:42,449 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:01:42,449 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:01:42,449 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable119 [2022-12-06 00:01:42,449 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-06 00:01:42,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:01:42,450 INFO L85 PathProgramCache]: Analyzing trace with hash -1084746844, now seen corresponding path program 1 times [2022-12-06 00:01:42,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:01:42,450 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603350546] [2022-12-06 00:01:42,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:01:42,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:01:42,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:01:42,542 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-06 00:01:42,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:01:42,542 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603350546] [2022-12-06 00:01:42,542 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [603350546] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:01:42,543 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:01:42,543 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:01:42,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424344392] [2022-12-06 00:01:42,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:01:42,543 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:01:42,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:01:42,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:01:42,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:01:42,544 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:01:42,544 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:01:42,544 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:01:42,544 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:01:42,544 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:01:42,927 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:01:42,928 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 00:01:42,936 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13550 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:01:42,946 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:01:42,946 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:01:42,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:01:42,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:01:42,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:01:42,947 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:01:42,947 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:01:42,947 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:01:42,997 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:01:42,998 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:42,998 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:01:42,999 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:01:42,999 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:01:42,999 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:43,000 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:01:43,000 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:01:43,000 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:43,001 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:43,034 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:01:43,034 INFO L131 PetriNetUnfolder]: For 3327/3536 co-relation queries the response was YES. [2022-12-06 00:01:43,035 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3327/3536 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2980 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:01:43,038 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:43,038 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:01:43,239 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:01:43,239 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 240 [2022-12-06 00:01:43,239 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:01:43,239 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:01:43,239 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:01:43,239 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:01:43,239 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable120 [2022-12-06 00:01:43,239 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-06 00:01:43,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:01:43,240 INFO L85 PathProgramCache]: Analyzing trace with hash 658063491, now seen corresponding path program 1 times [2022-12-06 00:01:43,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:01:43,240 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963836925] [2022-12-06 00:01:43,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:01:43,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:01:43,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:01:43,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-06 00:01:43,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:01:43,309 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963836925] [2022-12-06 00:01:43,309 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1963836925] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:01:43,309 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:01:43,310 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:01:43,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809594617] [2022-12-06 00:01:43,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:01:43,310 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:01:43,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:01:43,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:01:43,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:01:43,311 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:01:43,311 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:01:43,311 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:01:43,311 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:01:43,312 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:01:43,603 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:01:43,603 INFO L131 PetriNetUnfolder]: For 27136/27181 co-relation queries the response was YES. [2022-12-06 00:01:43,609 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27136/27181 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13535 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:01:43,616 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:01:43,616 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:01:43,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:01:43,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:01:43,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:01:43,617 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:01:43,617 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:01:43,617 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:01:43,652 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:01:43,654 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:43,654 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:01:43,654 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:01:43,654 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:01:43,654 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:43,655 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:01:43,655 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:01:43,655 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:43,656 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:43,683 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:01:43,683 INFO L131 PetriNetUnfolder]: For 3167/3307 co-relation queries the response was YES. [2022-12-06 00:01:43,684 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3167/3307 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2996 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:01:43,686 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:43,686 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:01:43,843 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:01:43,843 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 189 [2022-12-06 00:01:43,843 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:01:43,844 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:01:43,844 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:01:43,844 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:01:43,844 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable121 [2022-12-06 00:01:43,844 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-06 00:01:43,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:01:43,844 INFO L85 PathProgramCache]: Analyzing trace with hash -1894093470, now seen corresponding path program 1 times [2022-12-06 00:01:43,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:01:43,844 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602474650] [2022-12-06 00:01:43,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:01:43,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:01:43,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:01:43,918 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-06 00:01:43,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:01:43,918 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602474650] [2022-12-06 00:01:43,918 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1602474650] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:01:43,918 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:01:43,918 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:01:43,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641188690] [2022-12-06 00:01:43,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:01:43,918 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:01:43,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:01:43,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:01:43,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:01:43,919 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:01:43,919 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:01:43,919 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:01:43,919 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:01:43,919 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:01:44,230 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:01:44,231 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:01:44,237 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13563 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:01:44,244 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:01:44,244 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:01:44,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:01:44,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:01:44,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:01:44,245 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:01:44,245 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:01:44,245 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:01:44,290 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:01:44,291 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:44,291 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:01:44,292 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:01:44,292 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:01:44,292 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:44,292 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:01:44,292 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:01:44,293 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:44,293 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:44,330 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:01:44,330 INFO L131 PetriNetUnfolder]: For 3318/3528 co-relation queries the response was YES. [2022-12-06 00:01:44,331 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3318/3528 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2973 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:01:44,334 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:44,334 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:01:44,546 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:01:44,547 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 255 [2022-12-06 00:01:44,547 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:01:44,547 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:01:44,547 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:01:44,547 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:01:44,547 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable122 [2022-12-06 00:01:44,548 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-06 00:01:44,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:01:44,548 INFO L85 PathProgramCache]: Analyzing trace with hash -151283135, now seen corresponding path program 1 times [2022-12-06 00:01:44,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:01:44,548 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387942773] [2022-12-06 00:01:44,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:01:44,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:01:44,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:01:44,624 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-06 00:01:44,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:01:44,624 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387942773] [2022-12-06 00:01:44,624 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [387942773] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:01:44,624 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:01:44,624 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:01:44,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54768940] [2022-12-06 00:01:44,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:01:44,625 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:01:44,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:01:44,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:01:44,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:01:44,625 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:01:44,625 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:01:44,625 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:01:44,625 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:01:44,625 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:01:44,909 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:01:44,909 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:01:44,915 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13556 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:01:44,922 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:01:44,922 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:01:44,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:01:44,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:01:44,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:01:44,923 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:01:44,923 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:01:44,923 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:01:44,957 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:01:44,958 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:44,958 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:01:44,958 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:01:44,958 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:01:44,958 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:44,959 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:01:44,959 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:01:44,959 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:44,960 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:44,983 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:01:44,984 INFO L131 PetriNetUnfolder]: For 3318/3528 co-relation queries the response was YES. [2022-12-06 00:01:44,984 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3318/3528 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2995 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:01:44,986 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:44,986 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:01:45,156 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:01:45,156 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 198 [2022-12-06 00:01:45,156 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:01:45,157 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:01:45,157 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:01:45,157 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:01:45,157 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable123 [2022-12-06 00:01:45,157 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-06 00:01:45,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:01:45,157 INFO L85 PathProgramCache]: Analyzing trace with hash 1591527200, now seen corresponding path program 1 times [2022-12-06 00:01:45,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:01:45,157 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573049654] [2022-12-06 00:01:45,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:01:45,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:01:45,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:01:45,227 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-06 00:01:45,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:01:45,227 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573049654] [2022-12-06 00:01:45,227 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [573049654] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:01:45,228 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:01:45,228 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:01:45,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878782525] [2022-12-06 00:01:45,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:01:45,228 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:01:45,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:01:45,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:01:45,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:01:45,228 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:01:45,229 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:01:45,229 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:01:45,229 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:01:45,229 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:01:45,563 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:01:45,564 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:01:45,570 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13563 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:01:45,577 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:01:45,578 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:01:45,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:01:45,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:01:45,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:01:45,579 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:01:45,579 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:01:45,579 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:01:45,614 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:01:45,615 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:45,616 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:01:45,616 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:01:45,616 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:01:45,616 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:45,616 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:01:45,616 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:01:45,617 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:45,617 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:45,641 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:01:45,642 INFO L131 PetriNetUnfolder]: For 3339/3551 co-relation queries the response was YES. [2022-12-06 00:01:45,642 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3339/3551 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2983 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:01:45,644 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:45,644 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:01:45,803 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:01:45,803 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 187 [2022-12-06 00:01:45,803 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:01:45,803 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:01:45,803 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:01:45,803 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:01:45,803 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable124 [2022-12-06 00:01:45,804 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-06 00:01:45,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:01:45,804 INFO L85 PathProgramCache]: Analyzing trace with hash -960629761, now seen corresponding path program 1 times [2022-12-06 00:01:45,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:01:45,804 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011726052] [2022-12-06 00:01:45,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:01:45,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:01:45,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:01:45,860 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-06 00:01:45,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:01:45,861 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011726052] [2022-12-06 00:01:45,861 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2011726052] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:01:45,861 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:01:45,861 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:01:45,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959880623] [2022-12-06 00:01:45,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:01:45,861 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:01:45,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:01:45,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:01:45,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:01:45,862 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:01:45,862 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:01:45,862 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:01:45,862 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:01:45,862 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:01:46,169 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:01:46,170 INFO L131 PetriNetUnfolder]: For 27146/27191 co-relation queries the response was YES. [2022-12-06 00:01:46,175 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27146/27191 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13533 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:01:46,181 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:01:46,181 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:01:46,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:01:46,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:01:46,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:01:46,182 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:01:46,182 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:01:46,182 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:01:46,218 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:01:46,220 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:46,220 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:01:46,220 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:01:46,220 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:01:46,220 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:46,221 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:01:46,221 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:01:46,221 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:46,222 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:46,256 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:01:46,256 INFO L131 PetriNetUnfolder]: For 3168/3309 co-relation queries the response was YES. [2022-12-06 00:01:46,257 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3168/3309 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2988 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:01:46,260 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:46,260 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:01:46,431 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:01:46,432 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 212 [2022-12-06 00:01:46,432 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:01:46,432 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:01:46,432 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:01:46,432 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:01:46,432 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable125 [2022-12-06 00:01:46,432 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-06 00:01:46,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:01:46,433 INFO L85 PathProgramCache]: Analyzing trace with hash 782180574, now seen corresponding path program 1 times [2022-12-06 00:01:46,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:01:46,433 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108245285] [2022-12-06 00:01:46,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:01:46,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:01:46,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:01:46,527 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-06 00:01:46,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:01:46,528 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108245285] [2022-12-06 00:01:46,528 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1108245285] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:01:46,528 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:01:46,528 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:01:46,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562446667] [2022-12-06 00:01:46,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:01:46,529 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:01:46,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:01:46,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:01:46,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:01:46,529 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:01:46,529 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:01:46,529 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:01:46,530 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:01:46,530 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:01:46,891 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:01:46,892 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:01:46,899 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13546 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:01:46,908 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:01:46,908 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:01:46,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:01:46,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:01:46,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:01:46,910 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:01:46,910 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:01:46,910 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:01:46,957 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:01:46,959 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:46,960 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:01:46,960 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:01:46,960 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:01:46,960 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:46,961 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:01:46,961 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:01:46,961 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:46,962 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:46,997 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:01:46,998 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 00:01:46,999 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3312/3520 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2974 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:01:47,002 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:47,002 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:01:47,231 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:01:47,232 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 272 [2022-12-06 00:01:47,232 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:01:47,232 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:01:47,232 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:01:47,232 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:01:47,233 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable126 [2022-12-06 00:01:47,233 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-06 00:01:47,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:01:47,233 INFO L85 PathProgramCache]: Analyzing trace with hash -1769976387, now seen corresponding path program 1 times [2022-12-06 00:01:47,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:01:47,233 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275570314] [2022-12-06 00:01:47,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:01:47,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:01:47,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:01:47,349 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-06 00:01:47,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:01:47,350 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275570314] [2022-12-06 00:01:47,350 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1275570314] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:01:47,350 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:01:47,350 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:01:47,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945367607] [2022-12-06 00:01:47,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:01:47,350 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:01:47,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:01:47,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:01:47,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:01:47,351 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:01:47,351 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:01:47,351 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:01:47,351 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:01:47,351 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:01:47,734 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:01:47,734 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 00:01:47,741 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26969/27014 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13532 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:01:47,749 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:01:47,749 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:01:47,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:01:47,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:01:47,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:01:47,750 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:01:47,750 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:01:47,751 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:01:47,792 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:01:47,794 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:47,794 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:01:47,794 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:01:47,794 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:01:47,795 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:47,795 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:01:47,795 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:01:47,795 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:47,796 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:47,825 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:01:47,825 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 00:01:47,826 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3133/3273 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2974 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:01:47,828 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:47,828 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:01:47,992 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:01:47,993 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 199 [2022-12-06 00:01:47,993 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:01:47,993 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:01:47,993 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:01:47,993 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:01:47,993 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable127 [2022-12-06 00:01:47,993 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-06 00:01:47,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:01:47,993 INFO L85 PathProgramCache]: Analyzing trace with hash -27166052, now seen corresponding path program 1 times [2022-12-06 00:01:47,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:01:47,994 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028907400] [2022-12-06 00:01:47,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:01:47,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:01:48,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:01:48,046 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-06 00:01:48,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:01:48,047 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028907400] [2022-12-06 00:01:48,047 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2028907400] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:01:48,047 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:01:48,047 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:01:48,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348001355] [2022-12-06 00:01:48,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:01:48,047 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:01:48,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:01:48,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:01:48,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:01:48,048 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:01:48,048 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:01:48,048 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:01:48,048 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:01:48,048 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:01:48,377 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:01:48,377 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:01:48,385 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13572 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:01:48,396 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:01:48,396 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:01:48,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:01:48,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:01:48,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:01:48,397 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:01:48,397 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:01:48,397 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:01:48,443 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:01:48,445 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:48,445 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:01:48,445 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:01:48,445 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:01:48,446 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:48,446 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:01:48,446 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:01:48,447 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:48,448 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:48,486 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:01:48,486 INFO L131 PetriNetUnfolder]: For 3348/3558 co-relation queries the response was YES. [2022-12-06 00:01:48,488 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3348/3558 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2983 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:01:48,490 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:48,491 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:01:48,674 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:01:48,674 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 229 [2022-12-06 00:01:48,674 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:01:48,675 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:01:48,675 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:01:48,675 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:01:48,675 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable128 [2022-12-06 00:01:48,675 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-06 00:01:48,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:01:48,675 INFO L85 PathProgramCache]: Analyzing trace with hash 1715644283, now seen corresponding path program 1 times [2022-12-06 00:01:48,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:01:48,675 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786554144] [2022-12-06 00:01:48,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:01:48,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:01:48,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:01:48,768 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-06 00:01:48,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:01:48,769 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786554144] [2022-12-06 00:01:48,769 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1786554144] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:01:48,769 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:01:48,769 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:01:48,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685807471] [2022-12-06 00:01:48,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:01:48,769 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:01:48,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:01:48,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:01:48,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:01:48,770 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:01:48,770 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:01:48,770 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:01:48,770 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:01:48,770 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:01:49,055 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:01:49,055 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:01:49,062 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13571 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:01:49,070 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:01:49,070 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:01:49,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:01:49,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:01:49,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:01:49,071 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:01:49,071 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:01:49,071 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:01:49,105 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:01:49,106 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:49,106 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:01:49,106 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:01:49,106 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:01:49,106 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:49,107 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:01:49,107 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:01:49,107 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:49,108 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:49,131 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:01:49,132 INFO L131 PetriNetUnfolder]: For 3293/3500 co-relation queries the response was YES. [2022-12-06 00:01:49,132 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3293/3500 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2991 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:01:49,134 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:49,134 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:01:49,298 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:01:49,298 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 192 [2022-12-06 00:01:49,298 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:01:49,298 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:01:49,298 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:01:49,299 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:01:49,299 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable129 [2022-12-06 00:01:49,299 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-06 00:01:49,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:01:49,299 INFO L85 PathProgramCache]: Analyzing trace with hash -836512678, now seen corresponding path program 1 times [2022-12-06 00:01:49,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:01:49,299 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257516285] [2022-12-06 00:01:49,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:01:49,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:01:49,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:01:49,392 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-06 00:01:49,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:01:49,392 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257516285] [2022-12-06 00:01:49,392 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [257516285] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:01:49,392 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:01:49,392 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:01:49,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693979262] [2022-12-06 00:01:49,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:01:49,393 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:01:49,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:01:49,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:01:49,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:01:49,393 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:01:49,393 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:01:49,393 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:01:49,393 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:01:49,394 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:01:49,721 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:01:49,721 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:01:49,728 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13549 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:01:49,738 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:01:49,738 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:01:49,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:01:49,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:01:49,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:01:49,739 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:01:49,739 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:01:49,739 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:01:49,819 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:01:49,821 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:49,821 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:01:49,821 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:01:49,821 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:01:49,821 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:49,822 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:01:49,822 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:01:49,822 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:49,823 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:49,854 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:01:49,854 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 00:01:49,855 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3312/3520 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2981 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:01:49,858 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:49,858 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:01:50,058 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:01:50,059 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 238 [2022-12-06 00:01:50,059 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:01:50,059 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:01:50,059 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:01:50,059 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:01:50,059 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable130 [2022-12-06 00:01:50,060 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-06 00:01:50,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:01:50,060 INFO L85 PathProgramCache]: Analyzing trace with hash 906297657, now seen corresponding path program 1 times [2022-12-06 00:01:50,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:01:50,060 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182814513] [2022-12-06 00:01:50,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:01:50,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:01:50,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:01:50,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:01:50,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:01:50,150 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182814513] [2022-12-06 00:01:50,150 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [182814513] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:01:50,150 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:01:50,150 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:01:50,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763431582] [2022-12-06 00:01:50,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:01:50,150 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:01:50,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:01:50,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:01:50,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:01:50,151 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:01:50,151 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:01:50,151 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:01:50,151 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:01:50,151 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:01:50,525 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:01:50,525 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:01:50,533 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13545 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:01:50,543 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:01:50,543 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:01:50,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:01:50,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:01:50,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:01:50,544 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:01:50,544 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:01:50,545 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:01:50,595 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:01:50,596 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:50,596 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:01:50,597 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:01:50,597 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:01:50,597 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:50,597 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:01:50,597 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:01:50,598 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:50,598 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:50,661 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:01:50,662 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 00:01:50,663 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3321/3530 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2995 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:01:50,666 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:50,666 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:01:50,972 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:01:50,973 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 376 [2022-12-06 00:01:50,973 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:01:50,973 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:01:50,973 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:01:50,973 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:01:50,973 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable131 [2022-12-06 00:01:50,973 INFO L420 AbstractCegarLoop]: === Iteration 133 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:01:50,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:01:50,974 INFO L85 PathProgramCache]: Analyzing trace with hash -1645859304, now seen corresponding path program 1 times [2022-12-06 00:01:50,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:01:50,974 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085833978] [2022-12-06 00:01:50,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:01:50,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:01:50,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:01:51,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-06 00:01:51,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:01:51,132 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085833978] [2022-12-06 00:01:51,133 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1085833978] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:01:51,133 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:01:51,133 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:01:51,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816838612] [2022-12-06 00:01:51,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:01:51,133 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:01:51,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:01:51,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:01:51,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:01:51,134 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:01:51,134 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:01:51,134 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:01:51,134 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:01:51,134 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:01:51,515 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:01:51,515 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 00:01:51,524 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26965/27010 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13517 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:01:51,535 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:01:51,535 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:01:51,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:01:51,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:01:51,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:01:51,538 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:01:51,538 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:01:51,539 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:01:51,590 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:01:51,592 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:51,593 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:01:51,593 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:01:51,593 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:01:51,593 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:51,594 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:01:51,594 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:01:51,594 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:51,595 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:51,631 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:01:51,631 INFO L131 PetriNetUnfolder]: For 3146/3287 co-relation queries the response was YES. [2022-12-06 00:01:51,633 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3146/3287 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2973 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:01:51,635 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:51,636 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:01:51,808 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:01:51,808 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 215 [2022-12-06 00:01:51,808 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:01:51,808 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:01:51,808 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:01:51,809 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:01:51,809 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable132 [2022-12-06 00:01:51,809 INFO L420 AbstractCegarLoop]: === Iteration 134 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:01:51,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:01:51,809 INFO L85 PathProgramCache]: Analyzing trace with hash 96951031, now seen corresponding path program 1 times [2022-12-06 00:01:51,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:01:51,809 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110261223] [2022-12-06 00:01:51,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:01:51,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:01:51,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:01:51,933 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-06 00:01:51,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:01:51,933 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110261223] [2022-12-06 00:01:51,933 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1110261223] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:01:51,933 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:01:51,933 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:01:51,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409220825] [2022-12-06 00:01:51,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:01:51,934 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:01:51,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:01:51,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:01:51,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:01:51,934 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:01:51,934 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:01:51,934 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:01:51,934 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:01:51,934 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:01:52,329 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:01:52,330 INFO L131 PetriNetUnfolder]: For 27146/27191 co-relation queries the response was YES. [2022-12-06 00:01:52,337 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27146/27191 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13524 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:01:52,346 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:01:52,347 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:01:52,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:01:52,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:01:52,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:01:52,347 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:01:52,348 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:01:52,348 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:01:52,396 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:01:52,400 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:52,400 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:01:52,400 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:01:52,400 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:01:52,401 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:52,401 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:01:52,401 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:01:52,401 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:52,402 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:52,436 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:01:52,436 INFO L131 PetriNetUnfolder]: For 3168/3309 co-relation queries the response was YES. [2022-12-06 00:01:52,438 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3168/3309 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2988 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:01:52,441 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:52,441 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:01:52,617 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:01:52,618 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 218 [2022-12-06 00:01:52,618 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:01:52,618 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:01:52,618 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:01:52,618 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:01:52,619 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable133 [2022-12-06 00:01:52,619 INFO L420 AbstractCegarLoop]: === Iteration 135 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:01:52,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:01:52,619 INFO L85 PathProgramCache]: Analyzing trace with hash 1839761366, now seen corresponding path program 1 times [2022-12-06 00:01:52,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:01:52,619 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906252531] [2022-12-06 00:01:52,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:01:52,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:01:52,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:01:52,729 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-06 00:01:52,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:01:52,729 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906252531] [2022-12-06 00:01:52,729 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [906252531] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:01:52,729 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:01:52,729 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:01:52,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639146343] [2022-12-06 00:01:52,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:01:52,730 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:01:52,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:01:52,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:01:52,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:01:52,731 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:01:52,731 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:01:52,732 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:01:52,732 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:01:52,732 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:01:53,109 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:01:53,109 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:01:53,117 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13548 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:01:53,127 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:01:53,128 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:01:53,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:01:53,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:01:53,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:01:53,129 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:01:53,129 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:01:53,129 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:01:53,179 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:01:53,181 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:53,181 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:01:53,181 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:01:53,182 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:01:53,182 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:53,182 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:01:53,182 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:01:53,182 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:53,183 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:53,216 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:01:53,216 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 00:01:53,218 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3321/3530 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2979 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:01:53,220 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:53,220 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:01:53,411 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:01:53,412 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 230 [2022-12-06 00:01:53,412 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:01:53,412 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:01:53,412 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:01:53,412 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:01:53,412 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable134 [2022-12-06 00:01:53,412 INFO L420 AbstractCegarLoop]: === Iteration 136 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:01:53,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:01:53,413 INFO L85 PathProgramCache]: Analyzing trace with hash -712395595, now seen corresponding path program 1 times [2022-12-06 00:01:53,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:01:53,413 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70913241] [2022-12-06 00:01:53,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:01:53,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:01:53,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:01:53,509 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-06 00:01:53,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:01:53,509 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70913241] [2022-12-06 00:01:53,509 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [70913241] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:01:53,509 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:01:53,509 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:01:53,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332121842] [2022-12-06 00:01:53,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:01:53,510 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:01:53,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:01:53,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:01:53,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:01:53,510 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:01:53,510 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:01:53,510 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:01:53,510 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:01:53,510 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:01:53,918 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:01:53,919 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:01:53,926 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13573 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:01:53,938 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:01:53,938 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:01:53,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:01:53,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:01:53,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:01:53,939 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:01:53,939 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:01:53,939 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:01:54,023 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:01:54,025 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:54,025 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:01:54,048 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:01:54,049 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:01:54,049 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:54,049 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:01:54,049 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:01:54,050 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:54,050 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:54,134 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:01:54,134 INFO L131 PetriNetUnfolder]: For 3318/3528 co-relation queries the response was YES. [2022-12-06 00:01:54,135 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3318/3528 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2981 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:01:54,138 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:54,139 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:01:54,681 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:01:54,682 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 633 [2022-12-06 00:01:54,682 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:01:54,682 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:01:54,682 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:01:54,682 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:01:54,682 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable135 [2022-12-06 00:01:54,682 INFO L420 AbstractCegarLoop]: === Iteration 137 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:01:54,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:01:54,683 INFO L85 PathProgramCache]: Analyzing trace with hash 1030414740, now seen corresponding path program 1 times [2022-12-06 00:01:54,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:01:54,683 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547922327] [2022-12-06 00:01:54,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:01:54,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:01:54,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:01:54,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-06 00:01:54,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:01:54,819 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547922327] [2022-12-06 00:01:54,819 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [547922327] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:01:54,819 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:01:54,819 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:01:54,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704537159] [2022-12-06 00:01:54,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:01:54,820 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:01:54,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:01:54,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:01:54,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:01:54,820 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:01:54,820 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:01:54,821 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:01:54,821 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:01:54,821 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:01:55,230 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:01:55,230 INFO L131 PetriNetUnfolder]: For 27229/27274 co-relation queries the response was YES. [2022-12-06 00:01:55,240 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27229/27274 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13553 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:01:55,252 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:01:55,252 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:01:55,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:01:55,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:01:55,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:01:55,253 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:01:55,253 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:01:55,253 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:01:55,303 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:01:55,304 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:55,305 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:01:55,305 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:01:55,305 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:01:55,305 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:55,306 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:01:55,306 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:01:55,306 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:55,306 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:55,337 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:01:55,338 INFO L131 PetriNetUnfolder]: For 3348/3558 co-relation queries the response was YES. [2022-12-06 00:01:55,340 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3348/3558 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2982 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:01:55,344 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:55,344 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:01:55,538 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:01:55,539 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 234 [2022-12-06 00:01:55,539 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:01:55,539 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:01:55,539 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:01:55,539 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:01:55,539 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable136 [2022-12-06 00:01:55,539 INFO L420 AbstractCegarLoop]: === Iteration 138 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:01:55,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:01:55,539 INFO L85 PathProgramCache]: Analyzing trace with hash -1521742221, now seen corresponding path program 1 times [2022-12-06 00:01:55,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:01:55,540 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054567024] [2022-12-06 00:01:55,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:01:55,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:01:55,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:01:55,629 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-06 00:01:55,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:01:55,629 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054567024] [2022-12-06 00:01:55,629 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2054567024] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:01:55,629 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:01:55,629 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:01:55,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864820839] [2022-12-06 00:01:55,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:01:55,630 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:01:55,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:01:55,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:01:55,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:01:55,630 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:01:55,631 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:01:55,631 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:01:55,631 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:01:55,631 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:01:56,010 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:01:56,010 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:01:56,019 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13567 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:01:56,029 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:01:56,029 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:01:56,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:01:56,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:01:56,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:01:56,041 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:01:56,041 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:01:56,041 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:01:56,090 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:01:56,091 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:56,092 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:01:56,102 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:01:56,103 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:01:56,103 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:56,103 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:01:56,103 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:01:56,104 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:56,104 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:56,137 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:01:56,137 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 00:01:56,139 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3312/3520 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2988 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:01:56,142 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:56,142 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:01:56,320 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:01:56,321 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 218 [2022-12-06 00:01:56,321 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:01:56,321 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:01:56,321 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:01:56,321 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:01:56,321 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable137 [2022-12-06 00:01:56,321 INFO L420 AbstractCegarLoop]: === Iteration 139 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:01:56,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:01:56,322 INFO L85 PathProgramCache]: Analyzing trace with hash 221068114, now seen corresponding path program 1 times [2022-12-06 00:01:56,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:01:56,322 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007491057] [2022-12-06 00:01:56,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:01:56,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:01:56,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:01:56,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-06 00:01:56,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:01:56,439 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007491057] [2022-12-06 00:01:56,439 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2007491057] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:01:56,439 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:01:56,439 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:01:56,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461732750] [2022-12-06 00:01:56,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:01:56,439 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:01:56,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:01:56,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:01:56,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:01:56,440 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:01:56,440 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:01:56,440 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:01:56,440 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:01:56,440 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:01:56,898 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:01:56,898 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 00:01:56,926 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26969/27014 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13542 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:01:56,934 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:01:56,935 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:01:56,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:01:56,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:01:56,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:01:56,936 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:01:56,936 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:01:56,936 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:01:57,021 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:01:57,023 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:57,023 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:01:57,023 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:01:57,023 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:01:57,023 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:57,024 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:01:57,024 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:01:57,024 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:57,025 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:57,058 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:01:57,059 INFO L131 PetriNetUnfolder]: For 3122/3262 co-relation queries the response was YES. [2022-12-06 00:01:57,060 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3122/3262 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2986 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:01:57,063 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:57,063 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:01:57,257 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:01:57,258 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 235 [2022-12-06 00:01:57,258 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:01:57,258 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:01:57,258 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:01:57,258 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:01:57,258 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable138 [2022-12-06 00:01:57,258 INFO L420 AbstractCegarLoop]: === Iteration 140 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:01:57,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:01:57,259 INFO L85 PathProgramCache]: Analyzing trace with hash 1963878449, now seen corresponding path program 1 times [2022-12-06 00:01:57,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:01:57,259 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264397215] [2022-12-06 00:01:57,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:01:57,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:01:57,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:01:57,331 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-06 00:01:57,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:01:57,331 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264397215] [2022-12-06 00:01:57,331 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1264397215] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:01:57,331 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:01:57,331 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:01:57,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703980047] [2022-12-06 00:01:57,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:01:57,332 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:01:57,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:01:57,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:01:57,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:01:57,332 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:01:57,332 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:01:57,332 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:01:57,333 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:01:57,333 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:01:57,705 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:01:57,706 INFO L131 PetriNetUnfolder]: For 26955/27000 co-relation queries the response was YES. [2022-12-06 00:01:57,714 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26955/27000 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13540 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:01:57,724 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:01:57,725 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:01:57,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:01:57,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:01:57,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:01:57,726 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:01:57,726 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:01:57,726 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:01:57,773 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:01:57,774 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:57,775 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:01:57,775 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:01:57,775 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:01:57,775 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:57,776 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:01:57,776 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:01:57,776 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:57,777 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:57,809 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:01:57,809 INFO L131 PetriNetUnfolder]: For 3122/3262 co-relation queries the response was YES. [2022-12-06 00:01:57,811 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3122/3262 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2964 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:01:57,814 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:57,814 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:01:57,990 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:01:57,990 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 215 [2022-12-06 00:01:57,990 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:01:57,991 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:01:57,991 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:01:57,991 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:01:57,991 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable139 [2022-12-06 00:01:57,991 INFO L420 AbstractCegarLoop]: === Iteration 141 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:01:57,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:01:57,991 INFO L85 PathProgramCache]: Analyzing trace with hash -588278512, now seen corresponding path program 1 times [2022-12-06 00:01:57,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:01:57,991 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590081573] [2022-12-06 00:01:57,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:01:57,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:01:58,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:01:58,089 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-06 00:01:58,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:01:58,090 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590081573] [2022-12-06 00:01:58,090 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1590081573] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:01:58,090 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:01:58,090 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:01:58,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501805942] [2022-12-06 00:01:58,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:01:58,091 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:01:58,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:01:58,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:01:58,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:01:58,091 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:01:58,091 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:01:58,091 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:01:58,091 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:01:58,091 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:01:58,474 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:01:58,474 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:01:58,483 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13551 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:01:58,495 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:01:58,496 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:01:58,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:01:58,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:01:58,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:01:58,496 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:01:58,496 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:01:58,497 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:01:58,548 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:01:58,550 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:58,550 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:01:58,550 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:01:58,550 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:01:58,551 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:58,551 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:01:58,551 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:01:58,551 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:58,552 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:58,586 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:01:58,586 INFO L131 PetriNetUnfolder]: For 3337/3547 co-relation queries the response was YES. [2022-12-06 00:01:58,587 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3337/3547 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2983 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:01:58,590 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:58,591 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:01:58,777 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:01:58,778 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 228 [2022-12-06 00:01:58,778 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:01:58,778 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:01:58,778 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:01:58,778 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:01:58,778 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable140 [2022-12-06 00:01:58,778 INFO L420 AbstractCegarLoop]: === Iteration 142 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:01:58,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:01:58,779 INFO L85 PathProgramCache]: Analyzing trace with hash 1154531823, now seen corresponding path program 1 times [2022-12-06 00:01:58,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:01:58,779 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250610794] [2022-12-06 00:01:58,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:01:58,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:01:58,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:01:58,851 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-06 00:01:58,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:01:58,851 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250610794] [2022-12-06 00:01:58,852 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1250610794] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:01:58,852 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:01:58,852 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:01:58,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718562459] [2022-12-06 00:01:58,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:01:58,852 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:01:58,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:01:58,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:01:58,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:01:58,853 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:01:58,853 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:01:58,853 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:01:58,853 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:01:58,853 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:01:59,233 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:01:59,234 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:01:59,242 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13582 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:01:59,252 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:01:59,253 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:01:59,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:01:59,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:01:59,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:01:59,254 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:01:59,254 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:01:59,254 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:01:59,302 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:01:59,303 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:59,303 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:01:59,304 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:01:59,304 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:01:59,304 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:59,304 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:01:59,304 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:01:59,305 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:59,305 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:59,338 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:01:59,339 INFO L131 PetriNetUnfolder]: For 3301/3509 co-relation queries the response was YES. [2022-12-06 00:01:59,340 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3301/3509 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2987 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:01:59,343 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:01:59,343 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:01:59,520 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:01:59,521 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 217 [2022-12-06 00:01:59,521 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:01:59,521 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:01:59,521 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:01:59,521 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:01:59,521 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable141 [2022-12-06 00:01:59,521 INFO L420 AbstractCegarLoop]: === Iteration 143 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:01:59,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:01:59,522 INFO L85 PathProgramCache]: Analyzing trace with hash -1397625138, now seen corresponding path program 1 times [2022-12-06 00:01:59,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:01:59,522 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932785798] [2022-12-06 00:01:59,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:01:59,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:01:59,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:01:59,611 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:01:59,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:01:59,611 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932785798] [2022-12-06 00:01:59,612 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1932785798] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:01:59,612 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:01:59,612 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:01:59,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631309727] [2022-12-06 00:01:59,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:01:59,612 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:01:59,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:01:59,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:01:59,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:01:59,613 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:01:59,613 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:01:59,613 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:01:59,613 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:01:59,614 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:02:00,000 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:02:00,000 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 00:02:00,009 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13561 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:02:00,021 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:02:00,021 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:02:00,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:02:00,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:02:00,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:02:00,022 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:02:00,023 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:02:00,023 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:02:00,076 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:02:00,078 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:00,078 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:02:00,078 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:02:00,078 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:02:00,078 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:00,079 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:02:00,079 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:02:00,079 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:00,080 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:00,115 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:02:00,115 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 00:02:00,117 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3321/3530 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2978 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:02:00,120 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:00,120 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:02:00,301 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:02:00,302 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 224 [2022-12-06 00:02:00,302 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:02:00,302 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:02:00,302 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:02:00,302 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:02:00,302 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable142 [2022-12-06 00:02:00,302 INFO L420 AbstractCegarLoop]: === Iteration 144 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:02:00,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:02:00,302 INFO L85 PathProgramCache]: Analyzing trace with hash 345185197, now seen corresponding path program 1 times [2022-12-06 00:02:00,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:02:00,302 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296033166] [2022-12-06 00:02:00,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:02:00,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:02:00,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:02:00,390 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-06 00:02:00,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:02:00,391 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296033166] [2022-12-06 00:02:00,391 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1296033166] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:02:00,391 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:02:00,391 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:02:00,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661519348] [2022-12-06 00:02:00,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:02:00,392 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:02:00,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:02:00,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:02:00,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:02:00,392 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:02:00,392 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:02:00,392 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:02:00,392 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:02:00,392 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:02:00,770 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:02:00,770 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 00:02:00,780 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26965/27010 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13511 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:02:00,792 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:02:00,792 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:02:00,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:02:00,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:02:00,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:02:00,793 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:02:00,793 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:02:00,793 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:02:00,841 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:02:00,843 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:00,843 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:02:00,858 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:02:00,858 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:02:00,858 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:00,859 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:02:00,859 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:02:00,859 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:00,860 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:00,914 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:02:00,914 INFO L131 PetriNetUnfolder]: For 3123/3264 co-relation queries the response was YES. [2022-12-06 00:02:00,916 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3123/3264 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2981 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:02:00,919 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:00,919 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:02:01,118 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:02:01,119 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 261 [2022-12-06 00:02:01,119 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:02:01,119 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:02:01,119 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:02:01,119 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:02:01,119 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable143 [2022-12-06 00:02:01,119 INFO L420 AbstractCegarLoop]: === Iteration 145 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:02:01,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:02:01,119 INFO L85 PathProgramCache]: Analyzing trace with hash 2087995532, now seen corresponding path program 1 times [2022-12-06 00:02:01,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:02:01,120 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723978746] [2022-12-06 00:02:01,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:02:01,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:02:01,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:02:01,222 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-06 00:02:01,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:02:01,222 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723978746] [2022-12-06 00:02:01,222 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1723978746] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:02:01,222 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:02:01,222 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:02:01,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410954741] [2022-12-06 00:02:01,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:02:01,223 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:02:01,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:02:01,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:02:01,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:02:01,223 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:02:01,223 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:02:01,224 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:02:01,224 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:02:01,224 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:02:01,594 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:02:01,594 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 00:02:01,603 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13537 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:02:01,615 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:02:01,615 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:02:01,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:02:01,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:02:01,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:02:01,616 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:02:01,616 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:02:01,616 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:02:01,692 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:02:01,707 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:01,708 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:02:01,708 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:02:01,708 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:02:01,708 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:01,709 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:02:01,709 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:02:01,709 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:01,710 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:01,783 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:02:01,783 INFO L131 PetriNetUnfolder]: For 3338/3547 co-relation queries the response was YES. [2022-12-06 00:02:01,785 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3338/3547 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2976 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:02:01,788 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:01,788 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:02:02,289 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:02:02,290 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 582 [2022-12-06 00:02:02,290 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:02:02,290 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:02:02,290 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:02:02,290 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:02:02,290 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable144 [2022-12-06 00:02:02,291 INFO L420 AbstractCegarLoop]: === Iteration 146 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:02:02,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:02:02,291 INFO L85 PathProgramCache]: Analyzing trace with hash -464161429, now seen corresponding path program 1 times [2022-12-06 00:02:02,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:02:02,291 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829308387] [2022-12-06 00:02:02,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:02:02,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:02:02,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:02:02,372 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-06 00:02:02,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:02:02,372 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829308387] [2022-12-06 00:02:02,372 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1829308387] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:02:02,372 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:02:02,372 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:02:02,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001173661] [2022-12-06 00:02:02,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:02:02,373 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:02:02,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:02:02,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:02:02,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:02:02,373 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:02:02,373 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:02:02,373 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:02:02,373 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:02:02,373 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:02:02,748 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:02:02,748 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:02:02,756 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13555 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:02:02,767 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:02:02,767 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:02:02,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:02:02,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:02:02,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:02:02,768 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:02:02,768 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:02:02,768 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:02:02,819 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:02:02,821 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:02,821 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:02:02,821 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:02:02,821 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:02:02,821 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:02,822 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:02:02,822 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:02:02,822 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:02,823 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:02,856 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:02:02,856 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 00:02:02,857 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3312/3520 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2961 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:02:02,860 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:02,860 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:02:03,040 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:02:03,041 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 220 [2022-12-06 00:02:03,041 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:02:03,041 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:02:03,041 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:02:03,041 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:02:03,041 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable145 [2022-12-06 00:02:03,041 INFO L420 AbstractCegarLoop]: === Iteration 147 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:02:03,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:02:03,041 INFO L85 PathProgramCache]: Analyzing trace with hash 1278648906, now seen corresponding path program 1 times [2022-12-06 00:02:03,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:02:03,042 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406161011] [2022-12-06 00:02:03,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:02:03,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:02:03,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:02:03,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-06 00:02:03,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:02:03,162 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406161011] [2022-12-06 00:02:03,162 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1406161011] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:02:03,162 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:02:03,162 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:02:03,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038275264] [2022-12-06 00:02:03,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:02:03,162 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:02:03,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:02:03,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:02:03,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:02:03,163 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:02:03,163 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:02:03,163 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:02:03,163 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:02:03,163 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:02:03,565 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:02:03,566 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:02:03,573 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13543 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:02:03,583 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:02:03,583 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:02:03,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:02:03,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:02:03,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:02:03,584 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:02:03,584 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:02:03,584 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:02:03,632 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:02:03,634 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:03,634 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:02:03,634 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:02:03,634 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:02:03,635 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:03,635 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:02:03,635 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:02:03,635 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:03,636 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:03,671 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:02:03,671 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 00:02:03,673 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3321/3530 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2976 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:02:03,676 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:03,676 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:02:03,865 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:02:03,866 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 232 [2022-12-06 00:02:03,866 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:02:03,866 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:02:03,866 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:02:03,866 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:02:03,866 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable146 [2022-12-06 00:02:03,866 INFO L420 AbstractCegarLoop]: === Iteration 148 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:02:03,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:02:03,867 INFO L85 PathProgramCache]: Analyzing trace with hash -1273508055, now seen corresponding path program 1 times [2022-12-06 00:02:03,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:02:03,867 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895816515] [2022-12-06 00:02:03,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:02:03,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:02:03,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:02:04,016 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-06 00:02:04,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:02:04,016 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895816515] [2022-12-06 00:02:04,016 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [895816515] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:02:04,016 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:02:04,017 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:02:04,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961359288] [2022-12-06 00:02:04,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:02:04,017 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:02:04,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:02:04,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:02:04,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:02:04,017 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:02:04,018 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:02:04,018 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:02:04,018 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:02:04,018 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:02:04,424 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:02:04,424 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:02:04,434 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13560 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:02:04,444 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:02:04,444 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:02:04,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:02:04,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:02:04,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:02:04,445 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:02:04,446 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:02:04,446 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:02:04,493 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:02:04,520 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:04,521 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:02:04,521 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:02:04,521 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:02:04,521 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:04,522 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:02:04,522 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:02:04,522 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:04,523 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:04,571 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:02:04,571 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 00:02:04,573 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3312/3520 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2970 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:02:04,576 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:04,576 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:02:04,755 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:02:04,755 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 234 [2022-12-06 00:02:04,756 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:02:04,756 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:02:04,756 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:02:04,756 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:02:04,756 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable147 [2022-12-06 00:02:04,756 INFO L420 AbstractCegarLoop]: === Iteration 149 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:02:04,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:02:04,756 INFO L85 PathProgramCache]: Analyzing trace with hash 469302280, now seen corresponding path program 1 times [2022-12-06 00:02:04,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:02:04,756 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456365543] [2022-12-06 00:02:04,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:02:04,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:02:04,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:02:04,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-06 00:02:04,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:02:04,844 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456365543] [2022-12-06 00:02:04,844 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1456365543] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:02:04,844 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:02:04,844 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:02:04,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004372884] [2022-12-06 00:02:04,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:02:04,845 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:02:04,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:02:04,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:02:04,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:02:04,845 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:02:04,845 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:02:04,846 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:02:04,846 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:02:04,846 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:02:05,211 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:02:05,211 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:02:05,219 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13566 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:02:05,230 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:02:05,230 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:02:05,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:02:05,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:02:05,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:02:05,231 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:02:05,231 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:02:05,231 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:02:05,281 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:02:05,282 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:05,282 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:02:05,284 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:02:05,284 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:02:05,284 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:05,285 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:02:05,285 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:02:05,285 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:05,286 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:05,321 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:02:05,321 INFO L131 PetriNetUnfolder]: For 3337/3547 co-relation queries the response was YES. [2022-12-06 00:02:05,323 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3337/3547 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2990 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:02:05,326 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:05,326 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:02:05,500 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:02:05,500 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 216 [2022-12-06 00:02:05,500 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:02:05,500 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:02:05,501 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:02:05,501 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:02:05,501 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable148 [2022-12-06 00:02:05,501 INFO L420 AbstractCegarLoop]: === Iteration 150 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:02:05,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:02:05,501 INFO L85 PathProgramCache]: Analyzing trace with hash -2082854681, now seen corresponding path program 1 times [2022-12-06 00:02:05,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:02:05,501 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848896491] [2022-12-06 00:02:05,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:02:05,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:02:05,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:02:05,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-06 00:02:05,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:02:05,590 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [848896491] [2022-12-06 00:02:05,590 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [848896491] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:02:05,591 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:02:05,591 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:02:05,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373159781] [2022-12-06 00:02:05,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:02:05,591 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:02:05,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:02:05,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:02:05,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:02:05,603 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:02:05,604 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:02:05,604 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:02:05,604 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:02:05,604 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:02:05,973 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:02:05,974 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 00:02:05,982 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13565 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:02:05,992 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:02:05,992 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:02:05,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:02:05,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:02:05,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:02:05,993 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:02:05,993 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:02:05,993 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:02:06,070 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:02:06,072 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:06,072 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:02:06,072 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:02:06,072 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:02:06,072 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:06,073 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:02:06,073 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:02:06,073 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:06,074 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:06,108 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:02:06,108 INFO L131 PetriNetUnfolder]: For 3309/3518 co-relation queries the response was YES. [2022-12-06 00:02:06,110 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3309/3518 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2991 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:02:06,112 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:06,113 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:02:06,678 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:02:06,678 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 606 [2022-12-06 00:02:06,678 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:02:06,678 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:02:06,678 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:02:06,679 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:02:06,679 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable149 [2022-12-06 00:02:06,679 INFO L420 AbstractCegarLoop]: === Iteration 151 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:02:06,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:02:06,679 INFO L85 PathProgramCache]: Analyzing trace with hash -340044346, now seen corresponding path program 1 times [2022-12-06 00:02:06,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:02:06,679 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968226380] [2022-12-06 00:02:06,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:02:06,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:02:06,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:02:06,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-06 00:02:06,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:02:06,759 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968226380] [2022-12-06 00:02:06,759 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1968226380] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:02:06,759 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:02:06,759 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:02:06,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86600244] [2022-12-06 00:02:06,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:02:06,759 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:02:06,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:02:06,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:02:06,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:02:06,760 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:02:06,760 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:02:06,760 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:02:06,760 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:02:06,760 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:02:07,142 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:02:07,142 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:02:07,150 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13558 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:02:07,160 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:02:07,161 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:02:07,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:02:07,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:02:07,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:02:07,162 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:02:07,162 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:02:07,162 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:02:07,211 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:02:07,213 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:07,213 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:02:07,213 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:02:07,213 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:02:07,213 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:07,214 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:02:07,214 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:02:07,214 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:07,215 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:07,249 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:02:07,249 INFO L131 PetriNetUnfolder]: For 3318/3528 co-relation queries the response was YES. [2022-12-06 00:02:07,251 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3318/3528 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2967 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:02:07,254 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:07,254 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:02:07,441 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:02:07,442 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 229 [2022-12-06 00:02:07,442 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:02:07,442 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:02:07,442 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:02:07,442 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:02:07,443 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable150 [2022-12-06 00:02:07,443 INFO L420 AbstractCegarLoop]: === Iteration 152 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:02:07,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:02:07,443 INFO L85 PathProgramCache]: Analyzing trace with hash 1402765989, now seen corresponding path program 1 times [2022-12-06 00:02:07,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:02:07,443 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688824438] [2022-12-06 00:02:07,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:02:07,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:02:07,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:02:07,537 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-06 00:02:07,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:02:07,538 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688824438] [2022-12-06 00:02:07,538 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1688824438] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:02:07,538 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:02:07,538 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:02:07,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495720705] [2022-12-06 00:02:07,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:02:07,538 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:02:07,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:02:07,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:02:07,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:02:07,539 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:02:07,539 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:02:07,539 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:02:07,539 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:02:07,539 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:02:07,952 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:02:07,952 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 00:02:07,962 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26965/27010 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13508 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:02:07,973 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:02:07,973 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:02:07,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:02:07,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:02:07,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:02:07,974 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:02:07,974 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:02:07,974 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:02:08,020 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:02:08,021 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:08,022 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:02:08,022 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:02:08,022 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:02:08,022 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:08,023 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:02:08,023 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:02:08,023 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:08,036 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:08,068 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:02:08,068 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 00:02:08,070 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3133/3273 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2968 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:02:08,073 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:08,073 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:02:08,246 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:02:08,246 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 224 [2022-12-06 00:02:08,246 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:02:08,246 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:02:08,246 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:02:08,247 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:02:08,247 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable151 [2022-12-06 00:02:08,247 INFO L420 AbstractCegarLoop]: === Iteration 153 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:02:08,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:02:08,247 INFO L85 PathProgramCache]: Analyzing trace with hash -1149390972, now seen corresponding path program 1 times [2022-12-06 00:02:08,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:02:08,247 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887607848] [2022-12-06 00:02:08,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:02:08,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:02:08,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:02:08,339 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-06 00:02:08,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:02:08,340 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887607848] [2022-12-06 00:02:08,340 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [887607848] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:02:08,340 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:02:08,340 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:02:08,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003352981] [2022-12-06 00:02:08,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:02:08,340 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:02:08,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:02:08,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:02:08,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:02:08,341 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:02:08,341 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:02:08,341 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:02:08,341 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:02:08,341 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:02:08,705 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:02:08,705 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:02:08,716 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13571 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:02:08,726 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:02:08,726 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:02:08,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:02:08,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:02:08,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:02:08,728 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:02:08,728 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:02:08,728 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:02:08,779 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:02:08,780 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:08,781 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:02:08,792 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:02:08,793 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:02:08,793 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:08,793 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:02:08,794 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:02:08,794 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:08,795 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:08,827 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:02:08,828 INFO L131 PetriNetUnfolder]: For 3327/3536 co-relation queries the response was YES. [2022-12-06 00:02:08,829 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3327/3536 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2980 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:02:08,832 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:08,832 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:02:09,012 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:02:09,012 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 219 [2022-12-06 00:02:09,012 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:02:09,013 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:02:09,013 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:02:09,013 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:02:09,013 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable152 [2022-12-06 00:02:09,013 INFO L420 AbstractCegarLoop]: === Iteration 154 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:02:09,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:02:09,013 INFO L85 PathProgramCache]: Analyzing trace with hash 593419363, now seen corresponding path program 1 times [2022-12-06 00:02:09,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:02:09,013 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085812905] [2022-12-06 00:02:09,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:02:09,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:02:09,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:02:09,104 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-06 00:02:09,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:02:09,104 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085812905] [2022-12-06 00:02:09,105 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1085812905] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:02:09,105 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:02:09,105 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:02:09,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197671661] [2022-12-06 00:02:09,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:02:09,105 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:02:09,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:02:09,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:02:09,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:02:09,107 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:02:09,107 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:02:09,107 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:02:09,107 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:02:09,107 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:02:09,469 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:02:09,469 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 00:02:09,478 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13570 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:02:09,488 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:02:09,489 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:02:09,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:02:09,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:02:09,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:02:09,490 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:02:09,490 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:02:09,490 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:02:09,540 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:02:09,542 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:09,542 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:02:09,542 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:02:09,542 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:02:09,542 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:09,543 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:02:09,543 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:02:09,543 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:09,544 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:09,578 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:02:09,578 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 00:02:09,580 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3312/3520 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2991 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:02:09,583 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:09,583 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:02:09,764 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:02:09,765 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 223 [2022-12-06 00:02:09,765 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:02:09,765 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:02:09,765 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:02:09,765 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:02:09,765 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable153 [2022-12-06 00:02:09,766 INFO L420 AbstractCegarLoop]: === Iteration 155 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:02:09,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:02:09,766 INFO L85 PathProgramCache]: Analyzing trace with hash -1958737598, now seen corresponding path program 1 times [2022-12-06 00:02:09,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:02:09,766 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149398397] [2022-12-06 00:02:09,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:02:09,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:02:09,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:02:09,857 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-06 00:02:09,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:02:09,858 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149398397] [2022-12-06 00:02:09,858 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1149398397] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:02:09,858 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:02:09,858 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:02:09,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306020685] [2022-12-06 00:02:09,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:02:09,858 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:02:09,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:02:09,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:02:09,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:02:09,859 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:02:09,859 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:02:09,859 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:02:09,859 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:02:09,859 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:02:10,264 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:02:10,264 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:02:10,272 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13556 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:02:10,290 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:02:10,295 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:02:10,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:02:10,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:02:10,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:02:10,296 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:02:10,296 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:02:10,296 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:02:10,378 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:02:10,380 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:10,380 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:02:10,380 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:02:10,380 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:02:10,380 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:10,381 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:02:10,381 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:02:10,381 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:10,382 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:10,418 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:02:10,419 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 00:02:10,423 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3321/3530 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2996 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:02:10,426 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:10,426 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:02:10,607 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:02:10,608 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 228 [2022-12-06 00:02:10,608 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:02:10,608 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:02:10,608 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:02:10,608 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:02:10,609 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable154 [2022-12-06 00:02:10,609 INFO L420 AbstractCegarLoop]: === Iteration 156 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:02:10,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:02:10,609 INFO L85 PathProgramCache]: Analyzing trace with hash -215927263, now seen corresponding path program 1 times [2022-12-06 00:02:10,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:02:10,609 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281443016] [2022-12-06 00:02:10,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:02:10,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:02:10,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:02:10,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-06 00:02:10,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:02:10,699 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281443016] [2022-12-06 00:02:10,699 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [281443016] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:02:10,699 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:02:10,699 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:02:10,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524076609] [2022-12-06 00:02:10,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:02:10,700 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:02:10,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:02:10,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:02:10,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:02:10,700 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:02:10,700 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:02:10,701 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:02:10,701 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:02:10,701 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:02:11,076 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:02:11,076 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:02:11,085 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13579 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:02:11,096 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:02:11,097 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:02:11,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:02:11,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:02:11,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:02:11,098 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:02:11,098 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:02:11,098 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:02:11,152 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:02:11,153 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:11,153 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:02:11,154 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:02:11,154 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:02:11,154 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:11,155 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:02:11,155 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:02:11,155 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:11,156 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:11,187 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:02:11,187 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 00:02:11,189 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3321/3530 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2969 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:02:11,193 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:11,193 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:02:11,400 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:02:11,401 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 247 [2022-12-06 00:02:11,401 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:02:11,401 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:02:11,401 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:02:11,401 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:02:11,401 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable155 [2022-12-06 00:02:11,402 INFO L420 AbstractCegarLoop]: === Iteration 157 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:02:11,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:02:11,402 INFO L85 PathProgramCache]: Analyzing trace with hash 1526883072, now seen corresponding path program 1 times [2022-12-06 00:02:11,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:02:11,402 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646742604] [2022-12-06 00:02:11,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:02:11,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:02:11,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:02:11,503 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-06 00:02:11,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:02:11,503 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646742604] [2022-12-06 00:02:11,504 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [646742604] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:02:11,504 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:02:11,504 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:02:11,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304205208] [2022-12-06 00:02:11,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:02:11,504 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:02:11,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:02:11,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:02:11,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:02:11,505 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:02:11,505 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:02:11,505 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:02:11,505 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:02:11,505 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:02:11,894 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:02:11,894 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:02:11,902 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13567 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:02:11,913 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:02:11,913 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:02:11,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:02:11,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:02:11,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:02:11,914 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:02:11,914 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:02:11,915 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:02:11,962 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:02:11,964 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:11,964 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:02:11,966 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:02:11,966 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:02:11,966 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:11,967 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:02:11,967 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:02:11,967 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:11,968 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:12,002 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:02:12,002 INFO L131 PetriNetUnfolder]: For 3338/3547 co-relation queries the response was YES. [2022-12-06 00:02:12,004 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3338/3547 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2964 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:02:12,007 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:12,007 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:02:12,186 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:02:12,187 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 221 [2022-12-06 00:02:12,187 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:02:12,187 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:02:12,187 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:02:12,187 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:02:12,187 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable156 [2022-12-06 00:02:12,187 INFO L420 AbstractCegarLoop]: === Iteration 158 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:02:12,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:02:12,188 INFO L85 PathProgramCache]: Analyzing trace with hash -1025273889, now seen corresponding path program 1 times [2022-12-06 00:02:12,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:02:12,188 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119562411] [2022-12-06 00:02:12,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:02:12,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:02:12,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:02:12,292 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-06 00:02:12,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:02:12,292 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119562411] [2022-12-06 00:02:12,292 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [119562411] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:02:12,293 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:02:12,293 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:02:12,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124050183] [2022-12-06 00:02:12,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:02:12,293 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:02:12,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:02:12,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:02:12,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:02:12,294 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:02:12,294 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:02:12,294 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:02:12,294 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:02:12,294 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:02:12,682 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:02:12,682 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:02:12,690 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13571 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:02:12,702 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:02:12,702 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:02:12,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:02:12,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:02:12,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:02:12,703 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:02:12,703 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:02:12,703 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:02:12,753 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:02:12,755 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:12,755 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:02:12,755 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:02:12,756 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:02:12,756 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:12,756 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:02:12,756 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:02:12,756 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:12,757 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:12,789 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:02:12,789 INFO L131 PetriNetUnfolder]: For 3293/3500 co-relation queries the response was YES. [2022-12-06 00:02:12,790 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3293/3500 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2996 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:02:12,793 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:12,793 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:02:12,986 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:02:12,987 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 231 [2022-12-06 00:02:12,987 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:02:12,987 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:02:12,987 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:02:12,987 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:02:12,987 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable157 [2022-12-06 00:02:12,988 INFO L420 AbstractCegarLoop]: === Iteration 159 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:02:12,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:02:12,988 INFO L85 PathProgramCache]: Analyzing trace with hash 717536446, now seen corresponding path program 1 times [2022-12-06 00:02:12,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:02:12,988 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987074320] [2022-12-06 00:02:12,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:02:12,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:02:13,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:02:13,078 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-06 00:02:13,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:02:13,078 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987074320] [2022-12-06 00:02:13,078 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1987074320] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:02:13,078 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:02:13,079 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:02:13,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965666815] [2022-12-06 00:02:13,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:02:13,079 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:02:13,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:02:13,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:02:13,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:02:13,079 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:02:13,080 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:02:13,080 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:02:13,080 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:02:13,080 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:02:13,469 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:02:13,469 INFO L131 PetriNetUnfolder]: For 26955/27000 co-relation queries the response was YES. [2022-12-06 00:02:13,478 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26955/27000 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13518 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:02:13,489 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:02:13,489 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:02:13,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:02:13,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:02:13,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:02:13,490 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:02:13,490 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:02:13,491 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:02:13,546 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:02:13,548 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:13,548 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:02:13,548 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:02:13,548 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:02:13,548 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:13,549 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:02:13,549 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:02:13,549 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:13,550 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:13,586 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:02:13,587 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 00:02:13,588 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3133/3273 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2985 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:02:13,591 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:13,591 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:02:13,776 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:02:13,776 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 228 [2022-12-06 00:02:13,776 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:02:13,776 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:02:13,777 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:02:13,777 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:02:13,777 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable158 [2022-12-06 00:02:13,777 INFO L420 AbstractCegarLoop]: === Iteration 160 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:02:13,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:02:13,777 INFO L85 PathProgramCache]: Analyzing trace with hash -1834620515, now seen corresponding path program 1 times [2022-12-06 00:02:13,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:02:13,777 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172261516] [2022-12-06 00:02:13,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:02:13,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:02:13,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:02:13,854 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-06 00:02:13,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:02:13,855 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172261516] [2022-12-06 00:02:13,855 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1172261516] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:02:13,855 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:02:13,855 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:02:13,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507556498] [2022-12-06 00:02:13,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:02:13,855 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:02:13,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:02:13,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:02:13,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:02:13,856 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:02:13,856 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:02:13,856 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:02:13,856 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:02:13,856 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:02:14,270 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:02:14,270 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:02:14,277 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13559 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:02:14,287 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:02:14,287 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:02:14,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:02:14,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:02:14,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:02:14,288 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:02:14,288 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:02:14,288 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:02:14,330 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:02:14,332 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:14,333 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:02:14,333 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:02:14,333 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:02:14,333 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:14,334 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:02:14,334 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:02:14,334 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:14,335 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:14,367 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:02:14,367 INFO L131 PetriNetUnfolder]: For 3318/3528 co-relation queries the response was YES. [2022-12-06 00:02:14,369 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3318/3528 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 3002 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:02:14,372 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:14,372 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:02:14,550 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:02:14,551 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 218 [2022-12-06 00:02:14,551 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:02:14,551 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:02:14,551 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:02:14,551 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:02:14,551 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable159 [2022-12-06 00:02:14,551 INFO L420 AbstractCegarLoop]: === Iteration 161 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:02:14,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:02:14,552 INFO L85 PathProgramCache]: Analyzing trace with hash -91810180, now seen corresponding path program 1 times [2022-12-06 00:02:14,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:02:14,552 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157709599] [2022-12-06 00:02:14,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:02:14,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:02:14,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:02:14,633 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-06 00:02:14,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:02:14,634 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157709599] [2022-12-06 00:02:14,634 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1157709599] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:02:14,634 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:02:14,634 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:02:14,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94739234] [2022-12-06 00:02:14,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:02:14,635 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:02:14,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:02:14,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:02:14,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:02:14,635 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:02:14,635 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:02:14,635 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:02:14,635 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:02:14,635 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:02:15,008 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:02:15,008 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:02:15,018 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13559 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:02:15,030 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:02:15,030 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:02:15,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:02:15,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:02:15,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:02:15,031 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:02:15,031 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:02:15,031 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:02:15,084 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:02:15,085 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:15,086 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:02:15,086 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:02:15,086 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:02:15,086 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:15,087 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:02:15,087 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:02:15,087 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:15,088 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:15,127 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:02:15,127 INFO L131 PetriNetUnfolder]: For 3337/3547 co-relation queries the response was YES. [2022-12-06 00:02:15,129 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3337/3547 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2989 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:02:15,132 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:15,132 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:02:15,327 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:02:15,327 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 241 [2022-12-06 00:02:15,327 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:02:15,327 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:02:15,328 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:02:15,328 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:02:15,328 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable160 [2022-12-06 00:02:15,328 INFO L420 AbstractCegarLoop]: === Iteration 162 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:02:15,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:02:15,328 INFO L85 PathProgramCache]: Analyzing trace with hash 1651000155, now seen corresponding path program 1 times [2022-12-06 00:02:15,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:02:15,328 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084526805] [2022-12-06 00:02:15,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:02:15,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:02:15,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:02:15,419 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-06 00:02:15,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:02:15,419 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084526805] [2022-12-06 00:02:15,419 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2084526805] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:02:15,419 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:02:15,419 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:02:15,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239663249] [2022-12-06 00:02:15,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:02:15,420 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:02:15,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:02:15,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:02:15,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:02:15,420 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:02:15,420 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:02:15,420 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:02:15,420 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:02:15,420 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:02:15,794 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:02:15,794 INFO L131 PetriNetUnfolder]: For 27150/27195 co-relation queries the response was YES. [2022-12-06 00:02:15,802 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27150/27195 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13549 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:02:15,813 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:02:15,813 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:02:15,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:02:15,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:02:15,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:02:15,814 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:02:15,814 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:02:15,814 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:02:15,866 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:02:15,868 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:15,868 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:02:15,868 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:02:15,868 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:02:15,868 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:15,869 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:02:15,869 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:02:15,869 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:15,870 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:15,903 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:02:15,903 INFO L131 PetriNetUnfolder]: For 3167/3307 co-relation queries the response was YES. [2022-12-06 00:02:15,904 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3167/3307 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 3017 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:02:15,907 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:15,907 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:02:16,106 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:02:16,107 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 239 [2022-12-06 00:02:16,107 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:02:16,107 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:02:16,107 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:02:16,107 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:02:16,107 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable161 [2022-12-06 00:02:16,108 INFO L420 AbstractCegarLoop]: === Iteration 163 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:02:16,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:02:16,108 INFO L85 PathProgramCache]: Analyzing trace with hash -901156806, now seen corresponding path program 1 times [2022-12-06 00:02:16,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:02:16,108 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008596236] [2022-12-06 00:02:16,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:02:16,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:02:16,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:02:16,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-06 00:02:16,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:02:16,189 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008596236] [2022-12-06 00:02:16,189 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1008596236] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:02:16,190 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:02:16,190 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:02:16,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498312272] [2022-12-06 00:02:16,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:02:16,190 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:02:16,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:02:16,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:02:16,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:02:16,191 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:02:16,191 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:02:16,191 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:02:16,191 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:02:16,191 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:02:16,571 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:02:16,571 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 00:02:16,579 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26965/27010 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13515 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:02:16,590 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:02:16,590 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:02:16,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:02:16,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:02:16,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:02:16,591 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:02:16,591 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:02:16,591 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:02:16,639 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:02:16,640 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:16,640 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:02:16,641 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:02:16,641 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:02:16,641 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:16,641 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:02:16,642 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:02:16,642 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:16,642 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:16,677 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:02:16,677 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 00:02:16,679 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3133/3273 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2974 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:02:16,681 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:16,681 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:02:16,870 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:02:16,870 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 229 [2022-12-06 00:02:16,870 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:02:16,871 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:02:16,871 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:02:16,871 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:02:16,871 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable162 [2022-12-06 00:02:16,871 INFO L420 AbstractCegarLoop]: === Iteration 164 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:02:16,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:02:16,871 INFO L85 PathProgramCache]: Analyzing trace with hash 841653529, now seen corresponding path program 1 times [2022-12-06 00:02:16,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:02:16,871 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41335311] [2022-12-06 00:02:16,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:02:16,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:02:16,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:02:16,945 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-06 00:02:16,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:02:16,946 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41335311] [2022-12-06 00:02:16,946 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [41335311] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:02:16,946 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:02:16,946 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:02:16,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835446998] [2022-12-06 00:02:16,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:02:16,946 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:02:16,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:02:16,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:02:16,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:02:16,947 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:02:16,947 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:02:16,947 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:02:16,947 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:02:16,947 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:02:17,349 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:02:17,349 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:02:17,357 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13561 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:02:17,366 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:02:17,366 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:02:17,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:02:17,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:02:17,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:02:17,367 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:02:17,367 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:02:17,367 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:02:17,413 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:02:17,415 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:17,416 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:02:17,416 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:02:17,416 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:02:17,416 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:17,417 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:02:17,417 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:02:17,417 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:17,418 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:17,450 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:02:17,450 INFO L131 PetriNetUnfolder]: For 3301/3509 co-relation queries the response was YES. [2022-12-06 00:02:17,452 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3301/3509 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2977 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:02:17,455 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:17,455 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:02:17,628 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:02:17,628 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 212 [2022-12-06 00:02:17,628 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:02:17,628 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:02:17,629 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:02:17,629 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:02:17,629 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable163 [2022-12-06 00:02:17,629 INFO L420 AbstractCegarLoop]: === Iteration 165 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:02:17,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:02:17,629 INFO L85 PathProgramCache]: Analyzing trace with hash -1710503432, now seen corresponding path program 1 times [2022-12-06 00:02:17,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:02:17,629 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67032145] [2022-12-06 00:02:17,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:02:17,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:02:17,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:02:17,727 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-06 00:02:17,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:02:17,727 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67032145] [2022-12-06 00:02:17,727 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [67032145] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:02:17,727 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:02:17,727 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:02:17,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690616244] [2022-12-06 00:02:17,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:02:17,728 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:02:17,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:02:17,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:02:17,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:02:17,728 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:02:17,728 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:02:17,728 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:02:17,728 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:02:17,729 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:02:18,098 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:02:18,098 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 00:02:18,106 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13550 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:02:18,116 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:02:18,116 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:02:18,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:02:18,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:02:18,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:02:18,117 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:02:18,117 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:02:18,118 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:02:18,163 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:02:18,164 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:18,164 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:02:18,165 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:02:18,165 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:02:18,165 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:18,165 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:02:18,165 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:02:18,166 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:18,166 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:18,215 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:02:18,215 INFO L131 PetriNetUnfolder]: For 3337/3547 co-relation queries the response was YES. [2022-12-06 00:02:18,217 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3337/3547 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2976 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:02:18,219 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:18,220 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:02:18,406 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:02:18,407 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 242 [2022-12-06 00:02:18,407 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:02:18,407 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:02:18,407 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:02:18,407 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:02:18,407 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable164 [2022-12-06 00:02:18,408 INFO L420 AbstractCegarLoop]: === Iteration 166 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:02:18,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:02:18,408 INFO L85 PathProgramCache]: Analyzing trace with hash 32306903, now seen corresponding path program 1 times [2022-12-06 00:02:18,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:02:18,408 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133265649] [2022-12-06 00:02:18,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:02:18,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:02:18,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:02:18,499 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-06 00:02:18,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:02:18,499 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133265649] [2022-12-06 00:02:18,500 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2133265649] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:02:18,500 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:02:18,500 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:02:18,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806008702] [2022-12-06 00:02:18,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:02:18,500 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:02:18,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:02:18,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:02:18,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:02:18,501 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:02:18,501 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:02:18,501 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:02:18,501 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:02:18,501 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:02:18,876 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:02:18,876 INFO L131 PetriNetUnfolder]: For 27136/27181 co-relation queries the response was YES. [2022-12-06 00:02:18,884 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27136/27181 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13517 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:02:18,894 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:02:18,894 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:02:18,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:02:18,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:02:18,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:02:18,895 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:02:18,895 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:02:18,895 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:02:18,932 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:02:18,934 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:18,934 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:02:18,934 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:02:18,934 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:02:18,934 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:18,935 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:02:18,935 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:02:18,935 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:18,936 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:18,962 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:02:18,962 INFO L131 PetriNetUnfolder]: For 3156/3296 co-relation queries the response was YES. [2022-12-06 00:02:18,963 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3156/3296 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2993 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:02:18,965 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:18,965 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:02:19,112 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:02:19,113 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 179 [2022-12-06 00:02:19,113 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:02:19,113 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:02:19,113 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:02:19,113 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:02:19,113 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable165 [2022-12-06 00:02:19,113 INFO L420 AbstractCegarLoop]: === Iteration 167 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:02:19,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:02:19,114 INFO L85 PathProgramCache]: Analyzing trace with hash 1775117238, now seen corresponding path program 1 times [2022-12-06 00:02:19,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:02:19,114 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022008705] [2022-12-06 00:02:19,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:02:19,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:02:19,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:02:19,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-06 00:02:19,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:02:19,194 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022008705] [2022-12-06 00:02:19,194 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2022008705] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:02:19,194 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:02:19,194 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:02:19,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622819618] [2022-12-06 00:02:19,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:02:19,195 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:02:19,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:02:19,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:02:19,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:02:19,195 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:02:19,195 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:02:19,195 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:02:19,195 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:02:19,196 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:02:19,500 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:02:19,500 INFO L131 PetriNetUnfolder]: For 27136/27181 co-relation queries the response was YES. [2022-12-06 00:02:19,506 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27136/27181 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13536 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:02:19,514 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:02:19,515 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:02:19,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:02:19,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:02:19,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:02:19,516 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:02:19,516 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:02:19,516 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:02:19,551 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:02:19,553 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:19,553 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:02:19,553 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:02:19,553 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:02:19,553 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:19,554 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:02:19,554 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:02:19,554 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:19,554 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:19,582 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:02:19,582 INFO L131 PetriNetUnfolder]: For 3167/3307 co-relation queries the response was YES. [2022-12-06 00:02:19,583 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3167/3307 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2987 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:02:19,585 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:19,585 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:02:19,751 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:02:19,751 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 198 [2022-12-06 00:02:19,751 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:02:19,752 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:02:19,752 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:02:19,752 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:02:19,752 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable166 [2022-12-06 00:02:19,752 INFO L420 AbstractCegarLoop]: === Iteration 168 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:02:19,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:02:19,752 INFO L85 PathProgramCache]: Analyzing trace with hash -777039723, now seen corresponding path program 1 times [2022-12-06 00:02:19,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:02:19,752 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202789171] [2022-12-06 00:02:19,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:02:19,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:02:19,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:02:19,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-06 00:02:19,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:02:19,823 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202789171] [2022-12-06 00:02:19,823 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1202789171] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:02:19,823 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:02:19,823 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:02:19,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482309942] [2022-12-06 00:02:19,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:02:19,824 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:02:19,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:02:19,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:02:19,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:02:19,824 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:02:19,824 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:02:19,824 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:02:19,824 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:02:19,825 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:02:20,229 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:02:20,230 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 00:02:20,237 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26965/27010 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13563 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:02:20,249 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:02:20,249 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:02:20,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:02:20,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:02:20,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:02:20,250 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:02:20,250 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:02:20,250 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:02:20,299 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:02:20,301 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:20,302 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:02:20,302 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:02:20,302 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:02:20,302 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:20,303 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:02:20,303 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:02:20,303 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:20,304 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:20,340 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:02:20,340 INFO L131 PetriNetUnfolder]: For 3122/3262 co-relation queries the response was YES. [2022-12-06 00:02:20,342 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3122/3262 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2994 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:02:20,345 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:20,345 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:02:20,532 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:02:20,533 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 231 [2022-12-06 00:02:20,533 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:02:20,533 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:02:20,533 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:02:20,533 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:02:20,533 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable167 [2022-12-06 00:02:20,533 INFO L420 AbstractCegarLoop]: === Iteration 169 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:02:20,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:02:20,534 INFO L85 PathProgramCache]: Analyzing trace with hash 965770612, now seen corresponding path program 1 times [2022-12-06 00:02:20,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:02:20,534 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656173273] [2022-12-06 00:02:20,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:02:20,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:02:20,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:02:20,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-06 00:02:20,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:02:20,613 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656173273] [2022-12-06 00:02:20,613 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1656173273] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:02:20,613 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:02:20,613 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:02:20,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740762786] [2022-12-06 00:02:20,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:02:20,613 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:02:20,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:02:20,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:02:20,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:02:20,614 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:02:20,614 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:02:20,614 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:02:20,614 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:02:20,614 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:02:20,930 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:02:20,931 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 00:02:20,938 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13551 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:02:20,947 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:02:20,947 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:02:20,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:02:20,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:02:20,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:02:20,952 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:02:20,952 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:02:20,952 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:02:21,001 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:02:21,003 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:21,003 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:02:21,003 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:02:21,003 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:02:21,003 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:21,004 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:02:21,004 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:02:21,004 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:21,005 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:21,036 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:02:21,036 INFO L131 PetriNetUnfolder]: For 3338/3547 co-relation queries the response was YES. [2022-12-06 00:02:21,037 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3338/3547 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 3001 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:02:21,040 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:21,040 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:02:21,234 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:02:21,234 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 231 [2022-12-06 00:02:21,235 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:02:21,235 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:02:21,235 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:02:21,235 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:02:21,235 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable168 [2022-12-06 00:02:21,235 INFO L420 AbstractCegarLoop]: === Iteration 170 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:02:21,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:02:21,235 INFO L85 PathProgramCache]: Analyzing trace with hash -1586386349, now seen corresponding path program 1 times [2022-12-06 00:02:21,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:02:21,235 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019460573] [2022-12-06 00:02:21,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:02:21,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:02:21,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:02:21,306 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-06 00:02:21,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:02:21,306 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019460573] [2022-12-06 00:02:21,306 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2019460573] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:02:21,307 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:02:21,307 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:02:21,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079359997] [2022-12-06 00:02:21,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:02:21,307 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:02:21,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:02:21,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:02:21,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:02:21,308 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:02:21,308 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:02:21,308 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:02:21,308 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:02:21,308 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:02:21,677 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:02:21,677 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:02:21,685 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13564 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:02:21,695 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:02:21,696 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:02:21,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:02:21,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:02:21,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:02:21,696 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:02:21,697 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:02:21,697 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:02:21,744 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:02:21,746 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:21,746 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:02:21,747 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:02:21,747 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:02:21,747 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:21,748 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:02:21,748 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:02:21,748 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:21,748 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:21,782 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:02:21,782 INFO L131 PetriNetUnfolder]: For 3304/3511 co-relation queries the response was YES. [2022-12-06 00:02:21,784 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3304/3511 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2989 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:02:21,788 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:21,788 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:02:21,996 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:02:21,997 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 250 [2022-12-06 00:02:21,997 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:02:21,997 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:02:21,997 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:02:21,997 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:02:21,997 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable169 [2022-12-06 00:02:21,997 INFO L420 AbstractCegarLoop]: === Iteration 171 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:02:21,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:02:21,998 INFO L85 PathProgramCache]: Analyzing trace with hash 156423986, now seen corresponding path program 1 times [2022-12-06 00:02:21,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:02:21,998 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383657669] [2022-12-06 00:02:21,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:02:21,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:02:22,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:02:22,125 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-06 00:02:22,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:02:22,126 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383657669] [2022-12-06 00:02:22,126 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1383657669] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:02:22,126 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:02:22,126 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:02:22,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447432611] [2022-12-06 00:02:22,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:02:22,126 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:02:22,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:02:22,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:02:22,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:02:22,127 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:02:22,127 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:02:22,127 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:02:22,128 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:02:22,128 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:02:22,466 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:02:22,466 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:02:22,473 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13558 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:02:22,482 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:02:22,482 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:02:22,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:02:22,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:02:22,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:02:22,483 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:02:22,483 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:02:22,483 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:02:22,522 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:02:22,523 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:22,523 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:02:22,524 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:02:22,524 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:02:22,524 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:22,524 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:02:22,524 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:02:22,524 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:22,525 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:22,552 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:02:22,552 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 00:02:22,553 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3312/3520 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2974 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:02:22,555 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:22,555 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:02:22,705 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:02:22,706 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 182 [2022-12-06 00:02:22,706 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:02:22,706 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:02:22,706 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:02:22,706 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:02:22,706 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable170 [2022-12-06 00:02:22,706 INFO L420 AbstractCegarLoop]: === Iteration 172 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:02:22,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:02:22,706 INFO L85 PathProgramCache]: Analyzing trace with hash 1899234321, now seen corresponding path program 1 times [2022-12-06 00:02:22,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:02:22,707 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987350859] [2022-12-06 00:02:22,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:02:22,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:02:22,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:02:22,776 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-06 00:02:22,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:02:22,776 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987350859] [2022-12-06 00:02:22,777 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1987350859] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:02:22,777 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:02:22,777 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:02:22,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466540553] [2022-12-06 00:02:22,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:02:22,777 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:02:22,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:02:22,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:02:22,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:02:22,777 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:02:22,777 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:02:22,777 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:02:22,778 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:02:22,778 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:02:23,086 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:02:23,087 INFO L131 PetriNetUnfolder]: For 27150/27195 co-relation queries the response was YES. [2022-12-06 00:02:23,094 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27150/27195 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13540 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:02:23,105 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:02:23,105 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:02:23,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:02:23,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:02:23,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:02:23,106 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:02:23,106 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:02:23,106 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:02:23,147 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:02:23,148 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:23,148 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:02:23,148 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:02:23,148 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:02:23,149 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:23,149 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:02:23,149 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:02:23,149 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:23,150 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:23,177 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:02:23,177 INFO L131 PetriNetUnfolder]: For 3167/3307 co-relation queries the response was YES. [2022-12-06 00:02:23,178 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3167/3307 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2991 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:02:23,180 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:23,180 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:02:23,354 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:02:23,355 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 207 [2022-12-06 00:02:23,355 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:02:23,355 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:02:23,355 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:02:23,355 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:02:23,355 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable171 [2022-12-06 00:02:23,355 INFO L420 AbstractCegarLoop]: === Iteration 173 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:02:23,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:02:23,355 INFO L85 PathProgramCache]: Analyzing trace with hash -652922640, now seen corresponding path program 1 times [2022-12-06 00:02:23,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:02:23,356 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810816204] [2022-12-06 00:02:23,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:02:23,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:02:23,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:02:23,427 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-06 00:02:23,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:02:23,427 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810816204] [2022-12-06 00:02:23,427 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [810816204] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:02:23,427 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:02:23,427 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:02:23,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185233105] [2022-12-06 00:02:23,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:02:23,431 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:02:23,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:02:23,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:02:23,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:02:23,432 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:02:23,432 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:02:23,432 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:02:23,432 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:02:23,432 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:02:23,788 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:02:23,789 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:02:23,797 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13557 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:02:23,845 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:02:23,846 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:02:23,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:02:23,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:02:23,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:02:23,846 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:02:23,847 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:02:23,847 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:02:23,882 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:02:23,883 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:23,883 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:02:23,884 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:02:23,884 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:02:23,884 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:23,885 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:02:23,885 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:02:23,885 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:23,886 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:23,917 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:02:23,917 INFO L131 PetriNetUnfolder]: For 3327/3536 co-relation queries the response was YES. [2022-12-06 00:02:23,918 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3327/3536 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2980 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:02:23,920 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:23,920 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:02:24,099 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:02:24,100 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 216 [2022-12-06 00:02:24,100 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:02:24,100 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:02:24,100 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:02:24,100 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:02:24,100 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable172 [2022-12-06 00:02:24,100 INFO L420 AbstractCegarLoop]: === Iteration 174 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:02:24,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:02:24,100 INFO L85 PathProgramCache]: Analyzing trace with hash 1089887695, now seen corresponding path program 1 times [2022-12-06 00:02:24,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:02:24,101 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758988481] [2022-12-06 00:02:24,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:02:24,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:02:24,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:02:24,181 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-06 00:02:24,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:02:24,182 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758988481] [2022-12-06 00:02:24,182 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1758988481] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:02:24,182 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:02:24,182 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:02:24,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757550492] [2022-12-06 00:02:24,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:02:24,182 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:02:24,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:02:24,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:02:24,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:02:24,182 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:02:24,183 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:02:24,183 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:02:24,183 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:02:24,183 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:02:24,481 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:02:24,482 INFO L131 PetriNetUnfolder]: For 27136/27181 co-relation queries the response was YES. [2022-12-06 00:02:24,488 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27136/27181 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13535 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:02:24,497 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:02:24,497 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:02:24,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:02:24,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:02:24,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:02:24,498 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:02:24,498 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:02:24,498 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:02:24,531 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:02:24,532 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:24,532 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:02:24,532 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:02:24,532 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:02:24,532 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:24,533 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:02:24,533 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:02:24,533 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:24,534 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:24,558 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:02:24,558 INFO L131 PetriNetUnfolder]: For 3156/3296 co-relation queries the response was YES. [2022-12-06 00:02:24,559 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3156/3296 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2996 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:02:24,561 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:24,561 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:02:24,718 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:02:24,719 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 187 [2022-12-06 00:02:24,719 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:02:24,719 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:02:24,719 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:02:24,719 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:02:24,719 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable173 [2022-12-06 00:02:24,719 INFO L420 AbstractCegarLoop]: === Iteration 175 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:02:24,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:02:24,719 INFO L85 PathProgramCache]: Analyzing trace with hash -1462269266, now seen corresponding path program 1 times [2022-12-06 00:02:24,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:02:24,720 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597972584] [2022-12-06 00:02:24,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:02:24,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:02:24,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:02:24,798 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-06 00:02:24,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:02:24,799 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597972584] [2022-12-06 00:02:24,799 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [597972584] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:02:24,799 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:02:24,799 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:02:24,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832673886] [2022-12-06 00:02:24,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:02:24,799 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:02:24,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:02:24,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:02:24,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:02:24,800 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:02:24,800 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:02:24,800 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:02:24,800 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:02:24,800 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:02:25,127 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:02:25,127 INFO L131 PetriNetUnfolder]: For 26955/27000 co-relation queries the response was YES. [2022-12-06 00:02:25,134 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26955/27000 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13532 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:02:25,142 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:02:25,142 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:02:25,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:02:25,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:02:25,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:02:25,143 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:02:25,143 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:02:25,143 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:02:25,185 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:02:25,186 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:25,186 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:02:25,187 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:02:25,187 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:02:25,187 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:25,187 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:02:25,187 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:02:25,187 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:25,188 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:25,219 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:02:25,220 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 00:02:25,222 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3133/3273 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2986 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:02:25,225 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:25,225 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:02:25,407 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:02:25,408 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 221 [2022-12-06 00:02:25,408 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:02:25,408 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:02:25,408 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:02:25,408 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:02:25,408 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable174 [2022-12-06 00:02:25,408 INFO L420 AbstractCegarLoop]: === Iteration 176 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:02:25,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:02:25,408 INFO L85 PathProgramCache]: Analyzing trace with hash 280541069, now seen corresponding path program 1 times [2022-12-06 00:02:25,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:02:25,408 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110165205] [2022-12-06 00:02:25,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:02:25,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:02:25,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:02:25,559 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-06 00:02:25,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:02:25,560 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110165205] [2022-12-06 00:02:25,560 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2110165205] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:02:25,560 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:02:25,560 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:02:25,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469946308] [2022-12-06 00:02:25,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:02:25,560 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:02:25,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:02:25,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:02:25,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:02:25,561 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:02:25,561 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:02:25,561 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:02:25,561 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:02:25,561 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:02:25,881 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:02:25,882 INFO L131 PetriNetUnfolder]: For 27229/27274 co-relation queries the response was YES. [2022-12-06 00:02:25,890 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27229/27274 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13586 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:02:25,902 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:02:25,902 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:02:25,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:02:25,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:02:25,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:02:25,904 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:02:25,904 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:02:25,904 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:02:25,955 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:02:25,957 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:25,957 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:02:25,957 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:02:25,958 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:02:25,958 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:25,958 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:02:25,958 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:02:25,958 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:25,959 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:25,994 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:02:25,994 INFO L131 PetriNetUnfolder]: For 3310/3519 co-relation queries the response was YES. [2022-12-06 00:02:25,996 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3310/3519 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2979 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:02:25,999 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:25,999 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:02:26,203 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:02:26,203 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 245 [2022-12-06 00:02:26,203 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:02:26,203 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:02:26,204 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:02:26,204 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:02:26,204 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable175 [2022-12-06 00:02:26,204 INFO L420 AbstractCegarLoop]: === Iteration 177 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:02:26,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:02:26,204 INFO L85 PathProgramCache]: Analyzing trace with hash 2023351404, now seen corresponding path program 1 times [2022-12-06 00:02:26,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:02:26,204 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280704286] [2022-12-06 00:02:26,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:02:26,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:02:26,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:02:26,278 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-06 00:02:26,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:02:26,278 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280704286] [2022-12-06 00:02:26,278 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1280704286] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:02:26,278 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:02:26,278 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:02:26,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800148211] [2022-12-06 00:02:26,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:02:26,279 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:02:26,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:02:26,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:02:26,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:02:26,279 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:02:26,279 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:02:26,279 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:02:26,280 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:02:26,280 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:02:26,584 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:02:26,585 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 00:02:26,592 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13552 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:02:26,602 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:02:26,602 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:02:26,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:02:26,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:02:26,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:02:26,603 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:02:26,603 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:02:26,603 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:02:26,635 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:02:26,636 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:26,636 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:02:26,637 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:02:26,637 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:02:26,637 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:26,637 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:02:26,637 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:02:26,637 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:26,638 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:26,662 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:02:26,662 INFO L131 PetriNetUnfolder]: For 3338/3547 co-relation queries the response was YES. [2022-12-06 00:02:26,663 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3338/3547 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2995 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:02:26,665 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:26,665 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:02:26,845 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:02:26,846 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 209 [2022-12-06 00:02:26,846 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:02:26,846 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:02:26,846 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:02:26,846 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:02:26,846 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable176 [2022-12-06 00:02:26,846 INFO L420 AbstractCegarLoop]: === Iteration 178 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:02:26,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:02:26,846 INFO L85 PathProgramCache]: Analyzing trace with hash -528805557, now seen corresponding path program 1 times [2022-12-06 00:02:26,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:02:26,847 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425646422] [2022-12-06 00:02:26,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:02:26,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:02:26,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:02:26,905 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-06 00:02:26,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:02:26,905 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425646422] [2022-12-06 00:02:26,905 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [425646422] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:02:26,905 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:02:26,905 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:02:26,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019477003] [2022-12-06 00:02:26,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:02:26,906 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:02:26,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:02:26,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:02:26,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:02:26,906 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:02:26,906 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:02:26,906 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:02:26,906 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:02:26,906 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:02:27,239 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:02:27,239 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:02:27,248 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13563 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:02:27,259 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:02:27,259 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:02:27,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:02:27,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:02:27,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:02:27,260 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:02:27,260 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:02:27,260 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:02:27,297 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:02:27,298 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:27,298 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:02:27,299 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:02:27,299 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:02:27,299 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:27,299 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:02:27,299 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:02:27,299 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:27,300 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:27,334 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:02:27,335 INFO L131 PetriNetUnfolder]: For 3293/3500 co-relation queries the response was YES. [2022-12-06 00:02:27,336 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3293/3500 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 3004 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:02:27,338 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:27,338 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:02:27,678 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:02:27,679 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 380 [2022-12-06 00:02:27,679 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:02:27,679 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:02:27,679 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:02:27,679 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:02:27,679 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable177 [2022-12-06 00:02:27,679 INFO L420 AbstractCegarLoop]: === Iteration 179 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:02:27,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:02:27,680 INFO L85 PathProgramCache]: Analyzing trace with hash 1214004778, now seen corresponding path program 1 times [2022-12-06 00:02:27,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:02:27,680 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551837324] [2022-12-06 00:02:27,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:02:27,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:02:27,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:02:27,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-06 00:02:27,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:02:27,737 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551837324] [2022-12-06 00:02:27,737 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [551837324] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:02:27,737 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:02:27,737 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:02:27,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402337578] [2022-12-06 00:02:27,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:02:27,737 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:02:27,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:02:27,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:02:27,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:02:27,737 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:02:27,738 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:02:27,738 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:02:27,738 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:02:27,738 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:02:28,048 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:02:28,048 INFO L131 PetriNetUnfolder]: For 27136/27181 co-relation queries the response was YES. [2022-12-06 00:02:28,054 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27136/27181 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13554 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:02:28,065 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:02:28,065 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:02:28,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:02:28,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:02:28,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:02:28,066 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:02:28,066 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:02:28,066 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:02:28,109 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:02:28,111 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:28,111 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:02:28,111 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:02:28,111 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:02:28,111 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:28,112 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:02:28,112 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:02:28,112 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:28,113 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:28,146 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:02:28,146 INFO L131 PetriNetUnfolder]: For 3167/3307 co-relation queries the response was YES. [2022-12-06 00:02:28,148 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3167/3307 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2983 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:02:28,151 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:28,151 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:02:28,344 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:02:28,345 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 234 [2022-12-06 00:02:28,345 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:02:28,345 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:02:28,345 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:02:28,345 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:02:28,345 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable178 [2022-12-06 00:02:28,345 INFO L420 AbstractCegarLoop]: === Iteration 180 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:02:28,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:02:28,345 INFO L85 PathProgramCache]: Analyzing trace with hash -1338152183, now seen corresponding path program 1 times [2022-12-06 00:02:28,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:02:28,346 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140218144] [2022-12-06 00:02:28,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:02:28,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:02:28,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:02:28,401 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-06 00:02:28,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:02:28,401 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140218144] [2022-12-06 00:02:28,402 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1140218144] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:02:28,402 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:02:28,402 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:02:28,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45391123] [2022-12-06 00:02:28,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:02:28,402 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:02:28,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:02:28,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:02:28,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:02:28,402 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:02:28,402 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:02:28,402 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:02:28,402 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:02:28,403 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:02:28,693 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:02:28,694 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 00:02:28,700 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26965/27010 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13539 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:02:28,709 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:02:28,709 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:02:28,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:02:28,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:02:28,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:02:28,710 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:02:28,710 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:02:28,710 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:02:28,748 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:02:28,750 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:28,750 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:02:28,750 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:02:28,750 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:02:28,750 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:28,751 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:02:28,751 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:02:28,751 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:28,752 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:28,778 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:02:28,779 INFO L131 PetriNetUnfolder]: For 3122/3262 co-relation queries the response was YES. [2022-12-06 00:02:28,779 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3122/3262 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2977 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:02:28,781 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:28,781 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:02:28,936 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:02:28,937 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 187 [2022-12-06 00:02:28,937 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:02:28,937 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:02:28,937 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:02:28,937 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:02:28,937 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable179 [2022-12-06 00:02:28,937 INFO L420 AbstractCegarLoop]: === Iteration 181 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:02:28,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:02:28,937 INFO L85 PathProgramCache]: Analyzing trace with hash 404658152, now seen corresponding path program 1 times [2022-12-06 00:02:28,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:02:28,938 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943798583] [2022-12-06 00:02:28,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:02:28,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:02:28,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:02:29,011 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:02:29,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:02:29,011 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943798583] [2022-12-06 00:02:29,011 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1943798583] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:02:29,011 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:02:29,012 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:02:29,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593397178] [2022-12-06 00:02:29,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:02:29,012 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:02:29,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:02:29,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:02:29,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:02:29,012 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:02:29,012 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:02:29,013 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:02:29,013 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:02:29,013 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:02:29,419 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:02:29,419 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 00:02:29,426 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13564 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:02:29,435 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:02:29,436 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:02:29,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:02:29,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:02:29,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:02:29,437 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:02:29,437 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:02:29,437 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:02:29,482 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:02:29,484 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:29,484 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:02:29,484 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:02:29,484 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:02:29,484 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:29,486 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:02:29,486 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:02:29,486 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:29,487 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:29,520 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:02:29,520 INFO L131 PetriNetUnfolder]: For 3338/3547 co-relation queries the response was YES. [2022-12-06 00:02:29,521 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3338/3547 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2991 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:02:29,524 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:29,524 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:02:29,716 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:02:29,716 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 232 [2022-12-06 00:02:29,716 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:02:29,717 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:02:29,717 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:02:29,717 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:02:29,717 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable180 [2022-12-06 00:02:29,717 INFO L420 AbstractCegarLoop]: === Iteration 182 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:02:29,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:02:29,717 INFO L85 PathProgramCache]: Analyzing trace with hash 2147468487, now seen corresponding path program 1 times [2022-12-06 00:02:29,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:02:29,717 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420464033] [2022-12-06 00:02:29,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:02:29,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:02:29,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:02:29,807 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-06 00:02:29,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:02:29,807 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420464033] [2022-12-06 00:02:29,807 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1420464033] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:02:29,807 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:02:29,808 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:02:29,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120489804] [2022-12-06 00:02:29,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:02:29,808 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:02:29,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:02:29,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:02:29,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:02:29,808 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:02:29,808 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:02:29,809 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:02:29,809 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:02:29,809 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:02:30,188 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:02:30,189 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:02:30,197 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13563 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:02:30,207 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:02:30,207 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:02:30,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:02:30,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:02:30,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:02:30,208 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:02:30,208 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:02:30,208 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:02:30,256 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:02:30,258 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:30,258 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:02:30,258 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:02:30,258 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:02:30,258 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:30,259 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:02:30,259 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:02:30,259 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:30,260 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:30,293 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:02:30,293 INFO L131 PetriNetUnfolder]: For 3304/3511 co-relation queries the response was YES. [2022-12-06 00:02:30,295 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3304/3511 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2986 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:02:30,297 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:30,297 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:02:30,492 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:02:30,493 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 235 [2022-12-06 00:02:30,493 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:02:30,493 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:02:30,493 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:02:30,493 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:02:30,493 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable181 [2022-12-06 00:02:30,493 INFO L420 AbstractCegarLoop]: === Iteration 183 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:02:30,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:02:30,494 INFO L85 PathProgramCache]: Analyzing trace with hash -404688474, now seen corresponding path program 1 times [2022-12-06 00:02:30,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:02:30,494 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962784685] [2022-12-06 00:02:30,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:02:30,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:02:30,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:02:30,578 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-06 00:02:30,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:02:30,579 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962784685] [2022-12-06 00:02:30,579 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1962784685] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:02:30,579 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:02:30,579 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:02:30,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364378905] [2022-12-06 00:02:30,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:02:30,579 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:02:30,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:02:30,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:02:30,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:02:30,580 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:02:30,580 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:02:30,580 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:02:30,580 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:02:30,580 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:02:30,961 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:02:30,961 INFO L131 PetriNetUnfolder]: For 27150/27195 co-relation queries the response was YES. [2022-12-06 00:02:30,970 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27150/27195 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13536 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:02:30,980 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:02:30,981 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:02:30,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:02:30,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:02:30,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:02:30,982 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:02:30,982 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:02:30,982 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:02:31,031 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:02:31,032 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:31,033 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:02:31,033 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:02:31,033 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:02:31,033 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:31,034 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:02:31,034 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:02:31,034 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:31,035 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:31,069 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:02:31,070 INFO L131 PetriNetUnfolder]: For 3167/3307 co-relation queries the response was YES. [2022-12-06 00:02:31,071 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3167/3307 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2991 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:02:31,074 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:31,074 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:02:31,256 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:02:31,256 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 223 [2022-12-06 00:02:31,256 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:02:31,257 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:02:31,257 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:02:31,257 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:02:31,257 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable182 [2022-12-06 00:02:31,257 INFO L420 AbstractCegarLoop]: === Iteration 184 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:02:31,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:02:31,257 INFO L85 PathProgramCache]: Analyzing trace with hash 1338121861, now seen corresponding path program 1 times [2022-12-06 00:02:31,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:02:31,257 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455626864] [2022-12-06 00:02:31,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:02:31,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:02:31,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:02:31,343 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-06 00:02:31,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:02:31,343 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455626864] [2022-12-06 00:02:31,343 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [455626864] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:02:31,344 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:02:31,344 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:02:31,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248017329] [2022-12-06 00:02:31,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:02:31,344 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:02:31,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:02:31,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:02:31,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:02:31,344 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:02:31,345 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:02:31,345 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:02:31,345 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:02:31,345 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:02:31,713 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:02:31,713 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:02:31,721 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13574 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:02:31,731 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:02:31,732 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:02:31,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:02:31,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:02:31,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:02:31,733 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:02:31,733 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:02:31,733 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:02:31,782 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:02:31,784 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:31,784 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:02:31,784 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:02:31,784 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:02:31,784 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:31,785 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:02:31,785 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:02:31,785 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:31,786 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:31,819 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:02:31,819 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 00:02:31,820 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3312/3520 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2981 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:02:31,823 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:31,823 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:02:32,014 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:02:32,014 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 230 [2022-12-06 00:02:32,014 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:02:32,014 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:02:32,014 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:02:32,014 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:02:32,015 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable183 [2022-12-06 00:02:32,015 INFO L420 AbstractCegarLoop]: === Iteration 185 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:02:32,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:02:32,015 INFO L85 PathProgramCache]: Analyzing trace with hash -1214035100, now seen corresponding path program 1 times [2022-12-06 00:02:32,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:02:32,015 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042146089] [2022-12-06 00:02:32,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:02:32,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:02:32,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:02:32,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:02:32,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:02:32,110 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042146089] [2022-12-06 00:02:32,110 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1042146089] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:02:32,110 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:02:32,110 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:02:32,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484611000] [2022-12-06 00:02:32,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:02:32,110 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:02:32,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:02:32,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:02:32,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:02:32,111 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:02:32,111 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:02:32,111 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:02:32,111 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:02:32,111 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:02:32,483 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:02:32,483 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:02:32,492 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13566 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:02:32,503 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:02:32,503 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:02:32,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:02:32,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:02:32,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:02:32,504 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:02:32,504 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:02:32,504 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:02:32,565 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:02:32,581 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:32,581 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:02:32,581 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:02:32,581 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:02:32,581 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:32,582 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:02:32,582 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:02:32,582 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:32,590 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:32,627 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:02:32,627 INFO L131 PetriNetUnfolder]: For 3338/3547 co-relation queries the response was YES. [2022-12-06 00:02:32,628 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3338/3547 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2996 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:02:32,631 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:32,631 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:02:32,989 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:02:32,990 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 409 [2022-12-06 00:02:32,990 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:02:32,990 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:02:32,990 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:02:32,990 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:02:32,990 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable184 [2022-12-06 00:02:32,990 INFO L420 AbstractCegarLoop]: === Iteration 186 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:02:32,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:02:32,991 INFO L85 PathProgramCache]: Analyzing trace with hash 528775235, now seen corresponding path program 1 times [2022-12-06 00:02:32,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:02:32,991 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264527500] [2022-12-06 00:02:32,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:02:32,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:02:33,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:02:33,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-06 00:02:33,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:02:33,062 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264527500] [2022-12-06 00:02:33,062 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1264527500] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:02:33,062 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:02:33,062 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:02:33,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679720391] [2022-12-06 00:02:33,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:02:33,063 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:02:33,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:02:33,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:02:33,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:02:33,063 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:02:33,063 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:02:33,063 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:02:33,063 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:02:33,064 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:02:33,450 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:02:33,450 INFO L131 PetriNetUnfolder]: For 27146/27191 co-relation queries the response was YES. [2022-12-06 00:02:33,458 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27146/27191 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13544 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:02:33,469 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:02:33,469 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:02:33,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:02:33,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:02:33,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:02:33,470 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:02:33,470 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:02:33,470 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:02:33,520 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:02:33,522 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:33,522 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:02:33,522 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:02:33,523 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:02:33,523 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:33,523 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:02:33,523 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:02:33,524 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:33,524 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:33,572 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:02:33,572 INFO L131 PetriNetUnfolder]: For 3167/3307 co-relation queries the response was YES. [2022-12-06 00:02:33,573 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3167/3307 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2999 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:02:33,576 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:33,576 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:02:33,764 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:02:33,765 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 242 [2022-12-06 00:02:33,765 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:02:33,765 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:02:33,765 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:02:33,766 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:02:33,766 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable185 [2022-12-06 00:02:33,766 INFO L420 AbstractCegarLoop]: === Iteration 187 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:02:33,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:02:33,766 INFO L85 PathProgramCache]: Analyzing trace with hash -2023381726, now seen corresponding path program 1 times [2022-12-06 00:02:33,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:02:33,766 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813911607] [2022-12-06 00:02:33,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:02:33,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:02:33,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:02:33,864 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-06 00:02:33,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:02:33,865 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813911607] [2022-12-06 00:02:33,865 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [813911607] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:02:33,865 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:02:33,865 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:02:33,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270314026] [2022-12-06 00:02:33,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:02:33,865 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:02:33,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:02:33,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:02:33,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:02:33,866 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:02:33,866 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:02:33,866 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:02:33,866 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:02:33,866 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:02:34,313 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:02:34,313 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:02:34,321 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13537 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:02:34,332 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:02:34,332 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:02:34,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:02:34,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:02:34,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:02:34,333 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:02:34,333 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:02:34,333 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:02:34,381 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:02:34,382 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:34,382 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:02:34,383 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:02:34,383 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:02:34,383 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:34,383 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:02:34,383 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:02:34,384 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:34,384 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:34,417 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:02:34,417 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 00:02:34,418 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3321/3530 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2966 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:02:34,421 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:34,421 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:02:34,590 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:02:34,591 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 208 [2022-12-06 00:02:34,591 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:02:34,591 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:02:34,591 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:02:34,591 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:02:34,592 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable186 [2022-12-06 00:02:34,592 INFO L420 AbstractCegarLoop]: === Iteration 188 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:02:34,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:02:34,592 INFO L85 PathProgramCache]: Analyzing trace with hash -280571391, now seen corresponding path program 1 times [2022-12-06 00:02:34,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:02:34,592 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914035918] [2022-12-06 00:02:34,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:02:34,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:02:34,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:02:34,697 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:02:34,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:02:34,697 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914035918] [2022-12-06 00:02:34,697 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [914035918] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:02:34,697 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:02:34,698 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:02:34,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597087351] [2022-12-06 00:02:34,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:02:34,700 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:02:34,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:02:34,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:02:34,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:02:34,700 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:02:34,700 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:02:34,701 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:02:34,701 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:02:34,701 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:02:35,063 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:02:35,063 INFO L131 PetriNetUnfolder]: For 27229/27274 co-relation queries the response was YES. [2022-12-06 00:02:35,071 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27229/27274 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13557 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:02:35,081 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:02:35,081 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:02:35,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:02:35,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:02:35,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:02:35,082 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:02:35,082 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:02:35,082 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:02:35,130 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:02:35,132 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:35,132 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:02:35,132 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:02:35,132 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:02:35,132 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:35,133 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:02:35,133 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:02:35,133 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:35,134 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:35,167 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:02:35,167 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 00:02:35,168 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3321/3530 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2997 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:02:35,171 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:35,171 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:02:35,372 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:02:35,373 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 241 [2022-12-06 00:02:35,373 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:02:35,373 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:02:35,373 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:02:35,373 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:02:35,373 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable187 [2022-12-06 00:02:35,373 INFO L420 AbstractCegarLoop]: === Iteration 189 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:02:35,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:02:35,374 INFO L85 PathProgramCache]: Analyzing trace with hash 1462238944, now seen corresponding path program 1 times [2022-12-06 00:02:35,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:02:35,374 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308935366] [2022-12-06 00:02:35,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:02:35,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:02:35,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:02:35,501 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-06 00:02:35,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:02:35,501 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308935366] [2022-12-06 00:02:35,501 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [308935366] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:02:35,501 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:02:35,501 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:02:35,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741289196] [2022-12-06 00:02:35,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:02:35,502 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:02:35,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:02:35,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:02:35,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:02:35,502 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:02:35,502 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:02:35,502 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:02:35,502 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:02:35,502 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:02:35,905 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:02:35,905 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:02:35,913 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13581 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:02:35,923 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:02:35,923 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:02:35,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:02:35,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:02:35,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:02:35,924 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:02:35,924 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:02:35,924 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:02:35,969 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:02:35,970 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:35,970 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:02:35,971 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:02:35,971 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:02:35,971 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:35,971 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:02:35,971 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:02:35,972 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:35,972 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:36,005 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:02:36,005 INFO L131 PetriNetUnfolder]: For 3337/3547 co-relation queries the response was YES. [2022-12-06 00:02:36,006 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3337/3547 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2993 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:02:36,009 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:36,009 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:02:36,183 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:02:36,183 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 212 [2022-12-06 00:02:36,183 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:02:36,183 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:02:36,184 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:02:36,184 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:02:36,184 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable188 [2022-12-06 00:02:36,184 INFO L420 AbstractCegarLoop]: === Iteration 190 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:02:36,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:02:36,184 INFO L85 PathProgramCache]: Analyzing trace with hash -1089918017, now seen corresponding path program 1 times [2022-12-06 00:02:36,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:02:36,184 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631280982] [2022-12-06 00:02:36,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:02:36,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:02:36,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:02:36,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-06 00:02:36,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:02:36,258 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631280982] [2022-12-06 00:02:36,258 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [631280982] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:02:36,258 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:02:36,258 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:02:36,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326772602] [2022-12-06 00:02:36,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:02:36,258 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:02:36,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:02:36,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:02:36,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:02:36,259 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:02:36,259 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:02:36,259 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:02:36,259 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:02:36,259 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:02:36,628 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:02:36,628 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 00:02:36,636 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13560 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:02:36,646 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:02:36,647 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:02:36,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:02:36,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:02:36,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:02:36,648 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:02:36,648 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:02:36,648 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:02:36,697 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:02:36,698 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:36,698 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:02:36,699 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:02:36,699 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:02:36,699 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:36,703 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:02:36,703 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:02:36,703 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:36,704 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:36,737 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:02:36,737 INFO L131 PetriNetUnfolder]: For 3298/3507 co-relation queries the response was YES. [2022-12-06 00:02:36,739 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3298/3507 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2990 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:02:36,741 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:36,742 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:02:36,922 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:02:36,922 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 223 [2022-12-06 00:02:36,922 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:02:36,922 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:02:36,922 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:02:36,923 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:02:36,923 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable189 [2022-12-06 00:02:36,923 INFO L420 AbstractCegarLoop]: === Iteration 191 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:02:36,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:02:36,923 INFO L85 PathProgramCache]: Analyzing trace with hash 652892318, now seen corresponding path program 1 times [2022-12-06 00:02:36,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:02:36,923 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461301723] [2022-12-06 00:02:36,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:02:36,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:02:36,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:02:37,008 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-06 00:02:37,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:02:37,009 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461301723] [2022-12-06 00:02:37,009 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [461301723] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:02:37,009 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:02:37,009 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:02:37,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746660669] [2022-12-06 00:02:37,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:02:37,010 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:02:37,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:02:37,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:02:37,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:02:37,010 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:02:37,010 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:02:37,010 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:02:37,010 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:02:37,010 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:02:37,392 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:02:37,392 INFO L131 PetriNetUnfolder]: For 26955/27000 co-relation queries the response was YES. [2022-12-06 00:02:37,400 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26955/27000 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13534 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:02:37,410 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:02:37,411 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:02:37,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:02:37,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:02:37,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:02:37,412 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:02:37,412 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:02:37,412 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:02:37,462 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:02:37,464 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:37,464 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:02:37,464 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:02:37,464 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:02:37,464 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:37,465 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:02:37,465 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:02:37,466 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:37,467 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:37,501 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:02:37,501 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 00:02:37,505 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3133/3273 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2971 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:02:37,509 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:37,509 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:02:37,703 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:02:37,703 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 239 [2022-12-06 00:02:37,704 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:02:37,704 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:02:37,704 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:02:37,704 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:02:37,704 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable190 [2022-12-06 00:02:37,704 INFO L420 AbstractCegarLoop]: === Iteration 192 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:02:37,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:02:37,704 INFO L85 PathProgramCache]: Analyzing trace with hash -1899264643, now seen corresponding path program 1 times [2022-12-06 00:02:37,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:02:37,704 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549739588] [2022-12-06 00:02:37,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:02:37,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:02:37,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:02:37,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-06 00:02:37,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:02:37,921 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549739588] [2022-12-06 00:02:37,921 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [549739588] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:02:37,921 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:02:37,921 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:02:37,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586318864] [2022-12-06 00:02:37,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:02:37,921 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:02:37,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:02:37,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:02:37,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:02:37,922 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:02:37,922 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:02:37,922 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:02:37,923 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:02:37,923 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:02:38,308 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:02:38,308 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:02:38,317 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13544 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:02:38,327 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:02:38,327 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:02:38,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:02:38,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:02:38,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:02:38,329 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:02:38,331 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:02:38,331 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:02:38,380 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:02:38,382 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:38,382 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:02:38,383 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:02:38,383 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:02:38,383 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:38,384 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:02:38,384 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:02:38,384 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:38,385 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:38,418 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:02:38,418 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 00:02:38,419 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3321/3530 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2977 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:02:38,422 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:38,422 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:02:38,611 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:02:38,612 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 229 [2022-12-06 00:02:38,612 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:02:38,612 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:02:38,612 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:02:38,612 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:02:38,612 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable191 [2022-12-06 00:02:38,612 INFO L420 AbstractCegarLoop]: === Iteration 193 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:02:38,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:02:38,612 INFO L85 PathProgramCache]: Analyzing trace with hash -156454308, now seen corresponding path program 1 times [2022-12-06 00:02:38,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:02:38,612 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897720012] [2022-12-06 00:02:38,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:02:38,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:02:38,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:02:38,730 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-06 00:02:38,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:02:38,731 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897720012] [2022-12-06 00:02:38,731 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [897720012] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:02:38,731 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:02:38,731 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:02:38,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368856446] [2022-12-06 00:02:38,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:02:38,731 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:02:38,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:02:38,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:02:38,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:02:38,732 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:02:38,732 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:02:38,732 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:02:38,732 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:02:38,732 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:02:39,119 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:02:39,119 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:02:39,128 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13545 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:02:39,139 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:02:39,139 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:02:39,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:02:39,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:02:39,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:02:39,140 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:02:39,140 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:02:39,140 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:02:39,191 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:02:39,193 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:39,193 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:02:39,193 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:02:39,194 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:02:39,194 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:39,194 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:02:39,194 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:02:39,194 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:39,195 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:39,231 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:02:39,231 INFO L131 PetriNetUnfolder]: For 3348/3558 co-relation queries the response was YES. [2022-12-06 00:02:39,233 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3348/3558 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 3005 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:02:39,236 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:39,236 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:02:39,456 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:02:39,457 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 263 [2022-12-06 00:02:39,457 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:02:39,457 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:02:39,457 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:02:39,457 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:02:39,457 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable192 [2022-12-06 00:02:39,458 INFO L420 AbstractCegarLoop]: === Iteration 194 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:02:39,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:02:39,458 INFO L85 PathProgramCache]: Analyzing trace with hash 1586356027, now seen corresponding path program 1 times [2022-12-06 00:02:39,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:02:39,458 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582700173] [2022-12-06 00:02:39,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:02:39,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:02:39,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:02:39,544 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-06 00:02:39,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:02:39,545 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582700173] [2022-12-06 00:02:39,545 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [582700173] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:02:39,545 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:02:39,545 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:02:39,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030189009] [2022-12-06 00:02:39,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:02:39,545 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:02:39,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:02:39,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:02:39,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:02:39,546 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:02:39,546 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:02:39,546 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:02:39,546 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:02:39,546 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:02:39,918 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:02:39,918 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:02:39,926 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13561 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:02:39,985 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:02:39,985 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:02:39,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:02:39,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:02:39,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:02:39,986 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:02:39,987 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:02:39,987 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:02:40,029 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:02:40,030 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:40,030 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:02:40,031 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:02:40,031 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:02:40,031 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:40,032 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:02:40,032 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:02:40,032 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:40,033 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:40,066 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:02:40,066 INFO L131 PetriNetUnfolder]: For 3304/3511 co-relation queries the response was YES. [2022-12-06 00:02:40,068 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3304/3511 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 3000 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:02:40,071 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:40,071 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:02:40,263 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:02:40,264 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 233 [2022-12-06 00:02:40,264 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:02:40,264 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:02:40,264 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:02:40,264 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:02:40,264 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable193 [2022-12-06 00:02:40,265 INFO L420 AbstractCegarLoop]: === Iteration 195 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:02:40,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:02:40,265 INFO L85 PathProgramCache]: Analyzing trace with hash -965800934, now seen corresponding path program 1 times [2022-12-06 00:02:40,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:02:40,265 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137498115] [2022-12-06 00:02:40,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:02:40,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:02:40,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:02:40,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-06 00:02:40,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:02:40,352 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137498115] [2022-12-06 00:02:40,352 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2137498115] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:02:40,352 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:02:40,352 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:02:40,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143759125] [2022-12-06 00:02:40,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:02:40,353 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:02:40,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:02:40,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:02:40,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:02:40,353 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:02:40,353 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:02:40,353 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:02:40,353 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:02:40,354 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:02:40,769 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:02:40,770 INFO L131 PetriNetUnfolder]: For 27229/27274 co-relation queries the response was YES. [2022-12-06 00:02:40,778 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27229/27274 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13557 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:02:40,790 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:02:40,790 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:02:40,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:02:40,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:02:40,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:02:40,791 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:02:40,791 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:02:40,791 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:02:40,839 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:02:40,841 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:40,841 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:02:40,841 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:02:40,841 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:02:40,841 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:40,842 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:02:40,842 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:02:40,842 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:40,843 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:40,878 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:02:40,878 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 00:02:40,880 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3312/3520 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2963 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:02:40,883 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:40,883 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:02:41,070 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:02:41,071 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 230 [2022-12-06 00:02:41,071 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:02:41,071 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:02:41,071 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:02:41,071 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:02:41,072 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable194 [2022-12-06 00:02:41,072 INFO L420 AbstractCegarLoop]: === Iteration 196 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:02:41,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:02:41,072 INFO L85 PathProgramCache]: Analyzing trace with hash 777009401, now seen corresponding path program 1 times [2022-12-06 00:02:41,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:02:41,072 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514578329] [2022-12-06 00:02:41,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:02:41,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:02:41,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:02:41,148 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-06 00:02:41,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:02:41,149 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514578329] [2022-12-06 00:02:41,149 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [514578329] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:02:41,149 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:02:41,149 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:02:41,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898956565] [2022-12-06 00:02:41,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:02:41,149 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:02:41,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:02:41,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:02:41,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:02:41,150 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:02:41,150 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:02:41,150 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:02:41,150 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:02:41,150 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:02:41,535 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:02:41,535 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:02:41,543 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13557 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:02:41,554 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:02:41,554 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:02:41,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:02:41,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:02:41,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:02:41,555 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:02:41,555 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:02:41,555 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:02:41,609 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:02:41,610 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:41,611 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:02:41,611 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:02:41,611 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:02:41,611 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:41,612 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:02:41,612 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:02:41,612 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:41,613 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:41,650 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:02:41,650 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 00:02:41,652 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3321/3530 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2969 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:02:41,655 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:41,655 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:02:41,821 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:02:41,821 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 210 [2022-12-06 00:02:41,822 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:02:41,822 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:02:41,822 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:02:41,822 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:02:41,822 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable195 [2022-12-06 00:02:41,822 INFO L420 AbstractCegarLoop]: === Iteration 197 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:02:41,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:02:41,822 INFO L85 PathProgramCache]: Analyzing trace with hash -1775147560, now seen corresponding path program 1 times [2022-12-06 00:02:41,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:02:41,822 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415850208] [2022-12-06 00:02:41,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:02:41,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:02:41,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:02:41,896 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-06 00:02:41,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:02:41,896 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415850208] [2022-12-06 00:02:41,896 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1415850208] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:02:41,896 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:02:41,896 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:02:41,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175220980] [2022-12-06 00:02:41,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:02:41,897 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:02:41,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:02:41,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:02:41,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:02:41,897 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:02:41,897 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:02:41,897 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:02:41,897 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:02:41,897 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:02:42,284 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:02:42,284 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 00:02:42,292 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26965/27010 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13542 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:02:42,302 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:02:42,303 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:02:42,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:02:42,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:02:42,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:02:42,304 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:02:42,304 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:02:42,304 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:02:42,352 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:02:42,353 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:42,354 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:02:42,354 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:02:42,354 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:02:42,354 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:42,354 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:02:42,355 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:02:42,355 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:42,355 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:42,390 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:02:42,391 INFO L131 PetriNetUnfolder]: For 3146/3287 co-relation queries the response was YES. [2022-12-06 00:02:42,392 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3146/3287 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2981 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:02:42,395 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:42,395 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:02:42,597 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:02:42,598 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 244 [2022-12-06 00:02:42,598 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:02:42,598 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:02:42,598 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:02:42,598 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:02:42,598 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable196 [2022-12-06 00:02:42,598 INFO L420 AbstractCegarLoop]: === Iteration 198 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:02:42,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:02:42,599 INFO L85 PathProgramCache]: Analyzing trace with hash -32337225, now seen corresponding path program 1 times [2022-12-06 00:02:42,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:02:42,599 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214964300] [2022-12-06 00:02:42,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:02:42,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:02:42,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:02:42,689 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-06 00:02:42,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:02:42,689 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214964300] [2022-12-06 00:02:42,689 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [214964300] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:02:42,689 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:02:42,689 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:02:42,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464359257] [2022-12-06 00:02:42,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:02:42,689 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:02:42,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:02:42,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:02:42,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:02:42,690 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:02:42,690 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:02:42,690 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:02:42,690 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:02:42,690 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:02:43,091 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:02:43,092 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:02:43,100 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13534 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:02:43,111 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:02:43,112 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:02:43,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:02:43,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:02:43,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:02:43,113 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:02:43,113 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:02:43,113 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:02:43,163 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:02:43,164 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:43,165 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:02:43,165 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:02:43,165 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:02:43,165 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:43,166 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:02:43,166 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:02:43,166 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:43,167 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:43,198 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:02:43,198 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 00:02:43,199 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3312/3520 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2982 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:02:43,202 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:43,202 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:02:43,390 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:02:43,391 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 226 [2022-12-06 00:02:43,391 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:02:43,391 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:02:43,391 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:02:43,391 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:02:43,391 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable197 [2022-12-06 00:02:43,391 INFO L420 AbstractCegarLoop]: === Iteration 199 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:02:43,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:02:43,392 INFO L85 PathProgramCache]: Analyzing trace with hash 1710473110, now seen corresponding path program 1 times [2022-12-06 00:02:43,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:02:43,392 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414130501] [2022-12-06 00:02:43,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:02:43,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:02:43,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:02:43,480 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-06 00:02:43,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:02:43,480 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414130501] [2022-12-06 00:02:43,480 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1414130501] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:02:43,480 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:02:43,480 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:02:43,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495653895] [2022-12-06 00:02:43,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:02:43,481 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:02:43,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:02:43,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:02:43,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:02:43,481 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:02:43,481 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:02:43,482 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:02:43,482 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:02:43,482 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:02:43,892 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:02:43,892 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 00:02:43,900 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26969/27014 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13541 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:02:43,910 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:02:43,910 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:02:43,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:02:43,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:02:43,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:02:43,911 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:02:43,911 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:02:43,911 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:02:43,963 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:02:43,964 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:43,964 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:02:43,965 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:02:43,965 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:02:43,965 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:43,965 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:02:43,965 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:02:43,966 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:43,966 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:43,999 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:02:43,999 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 00:02:44,001 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3133/3273 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2976 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:02:44,004 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:44,004 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:02:44,198 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:02:44,199 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 234 [2022-12-06 00:02:44,199 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:02:44,199 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:02:44,199 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:02:44,199 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:02:44,199 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable198 [2022-12-06 00:02:44,199 INFO L420 AbstractCegarLoop]: === Iteration 200 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:02:44,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:02:44,200 INFO L85 PathProgramCache]: Analyzing trace with hash -841683851, now seen corresponding path program 1 times [2022-12-06 00:02:44,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:02:44,200 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912203897] [2022-12-06 00:02:44,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:02:44,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:02:44,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:02:44,304 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-06 00:02:44,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:02:44,304 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912203897] [2022-12-06 00:02:44,304 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [912203897] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:02:44,305 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:02:44,305 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:02:44,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151865604] [2022-12-06 00:02:44,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:02:44,305 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:02:44,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:02:44,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:02:44,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:02:44,305 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:02:44,306 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:02:44,306 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:02:44,306 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:02:44,306 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:02:44,663 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:02:44,663 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:02:44,671 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13567 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:02:44,681 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:02:44,682 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:02:44,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:02:44,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:02:44,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:02:44,683 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:02:44,683 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:02:44,683 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:02:44,732 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:02:44,733 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:44,733 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:02:44,734 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:02:44,734 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:02:44,734 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:44,734 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:02:44,734 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:02:44,735 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:44,735 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:44,769 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:02:44,769 INFO L131 PetriNetUnfolder]: For 3308/3518 co-relation queries the response was YES. [2022-12-06 00:02:44,771 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3308/3518 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2988 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:02:44,773 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:44,773 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:02:44,949 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:02:44,949 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 215 [2022-12-06 00:02:44,950 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:02:44,950 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:02:44,950 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:02:44,950 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:02:44,950 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable199 [2022-12-06 00:02:44,950 INFO L420 AbstractCegarLoop]: === Iteration 201 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:02:44,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:02:44,950 INFO L85 PathProgramCache]: Analyzing trace with hash 901126484, now seen corresponding path program 1 times [2022-12-06 00:02:44,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:02:44,950 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093714442] [2022-12-06 00:02:44,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:02:44,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:02:44,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:02:45,042 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-06 00:02:45,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:02:45,042 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093714442] [2022-12-06 00:02:45,042 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1093714442] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:02:45,042 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:02:45,042 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:02:45,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143413878] [2022-12-06 00:02:45,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:02:45,043 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:02:45,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:02:45,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:02:45,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:02:45,043 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:02:45,043 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:02:45,043 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:02:45,043 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:02:45,043 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:02:45,424 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:02:45,424 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:02:45,432 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13557 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:02:45,444 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:02:45,444 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:02:45,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:02:45,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:02:45,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:02:45,445 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:02:45,445 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:02:45,445 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:02:45,498 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:02:45,499 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:45,499 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:02:45,499 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:02:45,500 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:02:45,500 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:45,500 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:02:45,500 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:02:45,500 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:45,501 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:45,534 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:02:45,534 INFO L131 PetriNetUnfolder]: For 3348/3558 co-relation queries the response was YES. [2022-12-06 00:02:45,536 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3348/3558 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2978 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:02:45,539 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:45,539 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:02:45,742 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:02:45,743 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 243 [2022-12-06 00:02:45,743 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:02:45,743 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:02:45,743 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:02:45,743 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:02:45,743 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable200 [2022-12-06 00:02:45,743 INFO L420 AbstractCegarLoop]: === Iteration 202 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:02:45,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:02:45,743 INFO L85 PathProgramCache]: Analyzing trace with hash -1651030477, now seen corresponding path program 1 times [2022-12-06 00:02:45,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:02:45,744 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134307665] [2022-12-06 00:02:45,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:02:45,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:02:45,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:02:45,923 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-06 00:02:45,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:02:45,923 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134307665] [2022-12-06 00:02:45,923 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [134307665] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:02:45,924 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:02:45,924 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:02:45,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236959872] [2022-12-06 00:02:45,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:02:45,924 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:02:45,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:02:45,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:02:45,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:02:45,925 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:02:45,925 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:02:45,925 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:02:45,925 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:02:45,925 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:02:46,423 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:02:46,423 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:02:46,431 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13554 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:02:46,442 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:02:46,442 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:02:46,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:02:46,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:02:46,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:02:46,443 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:02:46,443 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:02:46,443 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:02:46,489 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:02:46,490 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:46,490 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:02:46,490 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:02:46,490 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:02:46,491 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:46,491 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:02:46,491 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:02:46,491 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:46,492 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:46,525 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:02:46,525 INFO L131 PetriNetUnfolder]: For 3309/3518 co-relation queries the response was YES. [2022-12-06 00:02:46,527 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3309/3518 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 3004 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:02:46,529 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:46,529 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:02:46,711 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:02:46,712 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 222 [2022-12-06 00:02:46,712 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:02:46,712 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:02:46,712 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:02:46,712 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:02:46,712 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable201 [2022-12-06 00:02:46,713 INFO L420 AbstractCegarLoop]: === Iteration 203 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:02:46,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:02:46,713 INFO L85 PathProgramCache]: Analyzing trace with hash 91779858, now seen corresponding path program 1 times [2022-12-06 00:02:46,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:02:46,713 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895514082] [2022-12-06 00:02:46,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:02:46,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:02:46,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:02:46,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-06 00:02:46,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:02:46,844 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895514082] [2022-12-06 00:02:46,844 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [895514082] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:02:46,844 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:02:46,844 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:02:46,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797137610] [2022-12-06 00:02:46,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:02:46,845 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:02:46,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:02:46,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:02:46,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:02:46,845 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:02:46,845 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:02:46,845 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:02:46,845 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:02:46,845 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:02:47,242 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:02:47,242 INFO L131 PetriNetUnfolder]: For 27229/27274 co-relation queries the response was YES. [2022-12-06 00:02:47,253 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27229/27274 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13563 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:02:47,265 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:02:47,265 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:02:47,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:02:47,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:02:47,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:02:47,266 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:02:47,266 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:02:47,266 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:02:47,315 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:02:47,317 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:47,317 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:02:47,317 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:02:47,317 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:02:47,317 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:47,318 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:02:47,318 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:02:47,318 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:47,319 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:47,355 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:02:47,355 INFO L131 PetriNetUnfolder]: For 3308/3518 co-relation queries the response was YES. [2022-12-06 00:02:47,357 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3308/3518 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2988 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:02:47,360 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:47,360 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:02:47,530 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:02:47,531 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 214 [2022-12-06 00:02:47,531 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:02:47,531 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:02:47,531 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:02:47,531 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:02:47,531 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable202 [2022-12-06 00:02:47,531 INFO L420 AbstractCegarLoop]: === Iteration 204 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:02:47,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:02:47,531 INFO L85 PathProgramCache]: Analyzing trace with hash 1834590193, now seen corresponding path program 1 times [2022-12-06 00:02:47,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:02:47,532 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654012021] [2022-12-06 00:02:47,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:02:47,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:02:47,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:02:47,624 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-06 00:02:47,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:02:47,625 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654012021] [2022-12-06 00:02:47,625 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [654012021] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:02:47,625 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:02:47,625 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:02:47,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038591265] [2022-12-06 00:02:47,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:02:47,625 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:02:47,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:02:47,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:02:47,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:02:47,626 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:02:47,626 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:02:47,626 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:02:47,626 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:02:47,626 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:02:48,014 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:02:48,014 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:02:48,022 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13556 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:02:48,034 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:02:48,034 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:02:48,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:02:48,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:02:48,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:02:48,035 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:02:48,035 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:02:48,035 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:02:48,087 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:02:48,089 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:48,089 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:02:48,089 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:02:48,089 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:02:48,089 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:48,095 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:02:48,095 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:02:48,095 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:48,096 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:48,133 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:02:48,133 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 00:02:48,135 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3321/3530 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2976 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:02:48,137 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:48,137 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:02:48,310 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:02:48,311 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 222 [2022-12-06 00:02:48,311 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:02:48,311 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:02:48,311 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:02:48,311 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:02:48,311 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable203 [2022-12-06 00:02:48,311 INFO L420 AbstractCegarLoop]: === Iteration 205 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:02:48,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:02:48,312 INFO L85 PathProgramCache]: Analyzing trace with hash -717566768, now seen corresponding path program 1 times [2022-12-06 00:02:48,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:02:48,312 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411898584] [2022-12-06 00:02:48,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:02:48,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:02:48,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:02:48,425 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-06 00:02:48,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:02:48,425 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411898584] [2022-12-06 00:02:48,425 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [411898584] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:02:48,425 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:02:48,426 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:02:48,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586794576] [2022-12-06 00:02:48,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:02:48,426 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:02:48,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:02:48,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:02:48,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:02:48,427 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:02:48,427 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:02:48,427 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:02:48,427 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:02:48,427 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:02:48,812 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:02:48,813 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:02:48,821 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13550 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:02:48,832 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:02:48,832 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:02:48,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:02:48,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:02:48,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:02:48,833 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:02:48,833 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:02:48,833 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:02:48,886 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:02:48,888 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:48,889 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:02:48,889 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:02:48,889 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:02:48,890 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:48,890 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:02:48,890 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:02:48,891 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:48,891 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:48,930 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:02:48,930 INFO L131 PetriNetUnfolder]: For 3349/3561 co-relation queries the response was YES. [2022-12-06 00:02:48,932 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3349/3561 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2972 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:02:48,935 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:48,935 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:02:49,115 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:02:49,116 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 227 [2022-12-06 00:02:49,116 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:02:49,116 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:02:49,116 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:02:49,116 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:02:49,116 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable204 [2022-12-06 00:02:49,116 INFO L420 AbstractCegarLoop]: === Iteration 206 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:02:49,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:02:49,117 INFO L85 PathProgramCache]: Analyzing trace with hash 1025243567, now seen corresponding path program 1 times [2022-12-06 00:02:49,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:02:49,117 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217396501] [2022-12-06 00:02:49,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:02:49,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:02:49,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:02:49,200 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-06 00:02:49,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:02:49,200 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217396501] [2022-12-06 00:02:49,200 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1217396501] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:02:49,201 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:02:49,201 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:02:49,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210448620] [2022-12-06 00:02:49,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:02:49,201 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:02:49,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:02:49,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:02:49,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:02:49,202 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:02:49,202 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:02:49,202 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:02:49,202 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:02:49,202 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:02:49,595 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:02:49,595 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 00:02:49,604 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26965/27010 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13504 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:02:49,615 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:02:49,615 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:02:49,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:02:49,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:02:49,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:02:49,616 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:02:49,616 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:02:49,616 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:02:49,665 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:02:49,667 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:49,667 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:02:49,667 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:02:49,668 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:02:49,668 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:49,668 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:02:49,668 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:02:49,669 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:49,669 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:49,707 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:02:49,707 INFO L131 PetriNetUnfolder]: For 3122/3262 co-relation queries the response was YES. [2022-12-06 00:02:49,708 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3122/3262 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2987 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:02:49,711 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:49,711 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:02:49,918 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:02:49,919 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 251 [2022-12-06 00:02:49,919 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:02:49,919 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:02:49,919 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:02:49,919 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:02:49,919 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable205 [2022-12-06 00:02:49,919 INFO L420 AbstractCegarLoop]: === Iteration 207 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:02:49,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:02:49,920 INFO L85 PathProgramCache]: Analyzing trace with hash -1526913394, now seen corresponding path program 1 times [2022-12-06 00:02:49,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:02:49,920 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177225708] [2022-12-06 00:02:49,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:02:49,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:02:49,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:02:50,007 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-06 00:02:50,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:02:50,007 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177225708] [2022-12-06 00:02:50,007 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1177225708] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:02:50,007 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:02:50,007 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:02:50,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862680530] [2022-12-06 00:02:50,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:02:50,008 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:02:50,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:02:50,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:02:50,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:02:50,008 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:02:50,008 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:02:50,009 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:02:50,009 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:02:50,009 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:02:50,437 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:02:50,437 INFO L131 PetriNetUnfolder]: For 27136/27181 co-relation queries the response was YES. [2022-12-06 00:02:50,442 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27136/27181 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13518 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:02:50,449 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:02:50,449 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:02:50,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:02:50,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:02:50,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:02:50,450 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:02:50,450 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:02:50,450 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:02:50,482 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:02:50,484 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:50,484 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:02:50,484 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:02:50,484 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:02:50,485 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:50,485 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:02:50,485 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:02:50,485 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:50,486 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:50,515 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:02:50,515 INFO L131 PetriNetUnfolder]: For 3167/3307 co-relation queries the response was YES. [2022-12-06 00:02:50,517 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3167/3307 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2994 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:02:50,519 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:50,519 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:02:50,685 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:02:50,686 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 202 [2022-12-06 00:02:50,686 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:02:50,686 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:02:50,686 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:02:50,686 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:02:50,686 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable206 [2022-12-06 00:02:50,686 INFO L420 AbstractCegarLoop]: === Iteration 208 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:02:50,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:02:50,686 INFO L85 PathProgramCache]: Analyzing trace with hash 215896941, now seen corresponding path program 1 times [2022-12-06 00:02:50,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:02:50,687 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237662555] [2022-12-06 00:02:50,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:02:50,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:02:50,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:02:50,770 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-06 00:02:50,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:02:50,770 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237662555] [2022-12-06 00:02:50,770 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1237662555] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:02:50,770 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:02:50,770 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:02:50,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57994896] [2022-12-06 00:02:50,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:02:50,770 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:02:50,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:02:50,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:02:50,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:02:50,771 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:02:50,771 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:02:50,771 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:02:50,771 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:02:50,771 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:02:51,135 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:02:51,135 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 00:02:51,143 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26965/27010 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13552 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:02:51,153 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:02:51,154 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:02:51,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:02:51,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:02:51,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:02:51,155 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:02:51,155 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:02:51,155 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:02:51,204 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:02:51,205 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:51,206 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:02:51,206 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:02:51,206 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:02:51,206 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:51,207 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:02:51,207 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:02:51,207 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:51,208 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:51,242 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:02:51,242 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 00:02:51,244 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3133/3273 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2984 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:02:51,247 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:51,247 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:02:51,441 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:02:51,442 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 236 [2022-12-06 00:02:51,442 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:02:51,442 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:02:51,442 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:02:51,443 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:02:51,443 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable207 [2022-12-06 00:02:51,443 INFO L420 AbstractCegarLoop]: === Iteration 209 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:02:51,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:02:51,443 INFO L85 PathProgramCache]: Analyzing trace with hash 1958707276, now seen corresponding path program 1 times [2022-12-06 00:02:51,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:02:51,443 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433015810] [2022-12-06 00:02:51,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:02:51,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:02:51,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:02:51,526 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-06 00:02:51,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:02:51,526 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433015810] [2022-12-06 00:02:51,526 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [433015810] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:02:51,526 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:02:51,526 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:02:51,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588526461] [2022-12-06 00:02:51,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:02:51,527 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:02:51,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:02:51,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:02:51,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:02:51,527 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:02:51,527 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:02:51,527 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:02:51,527 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:02:51,527 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:02:51,881 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:02:51,881 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:02:51,889 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13572 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:02:51,899 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:02:51,899 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:02:51,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:02:51,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:02:51,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:02:51,900 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:02:51,900 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:02:51,901 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:02:51,950 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:02:51,952 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:51,952 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:02:51,952 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:02:51,952 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:02:51,952 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:51,953 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:02:51,953 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:02:51,953 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:51,954 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:51,986 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:02:51,986 INFO L131 PetriNetUnfolder]: For 3338/3547 co-relation queries the response was YES. [2022-12-06 00:02:51,988 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3338/3547 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2974 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:02:51,991 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:51,991 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:02:52,197 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:02:52,198 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 246 [2022-12-06 00:02:52,198 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:02:52,198 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:02:52,198 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:02:52,198 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:02:52,199 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable208 [2022-12-06 00:02:52,199 INFO L420 AbstractCegarLoop]: === Iteration 210 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:02:52,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:02:52,199 INFO L85 PathProgramCache]: Analyzing trace with hash -593449685, now seen corresponding path program 1 times [2022-12-06 00:02:52,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:02:52,199 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820618088] [2022-12-06 00:02:52,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:02:52,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:02:52,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:02:52,281 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-06 00:02:52,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:02:52,281 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820618088] [2022-12-06 00:02:52,281 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1820618088] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:02:52,281 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:02:52,281 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:02:52,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838420545] [2022-12-06 00:02:52,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:02:52,282 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:02:52,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:02:52,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:02:52,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:02:52,282 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:02:52,282 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:02:52,282 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:02:52,282 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:02:52,282 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:02:52,678 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:02:52,678 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:02:52,687 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13582 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:02:52,698 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:02:52,698 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:02:52,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:02:52,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:02:52,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:02:52,699 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:02:52,699 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:02:52,699 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:02:52,749 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:02:52,751 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:52,751 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:02:52,752 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:02:52,752 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:02:52,752 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:52,752 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:02:52,752 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:02:52,753 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:52,753 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:52,788 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:02:52,788 INFO L131 PetriNetUnfolder]: For 3309/3518 co-relation queries the response was YES. [2022-12-06 00:02:52,790 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3309/3518 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2986 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:02:52,793 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:52,793 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:02:52,981 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:02:52,982 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 230 [2022-12-06 00:02:52,982 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:02:52,982 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:02:52,982 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:02:52,982 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:02:52,982 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable209 [2022-12-06 00:02:52,982 INFO L420 AbstractCegarLoop]: === Iteration 211 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:02:52,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:02:52,983 INFO L85 PathProgramCache]: Analyzing trace with hash 1149360650, now seen corresponding path program 1 times [2022-12-06 00:02:52,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:02:52,983 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180605474] [2022-12-06 00:02:52,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:02:52,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:02:53,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:02:53,085 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-06 00:02:53,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:02:53,085 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180605474] [2022-12-06 00:02:53,085 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1180605474] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:02:53,086 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:02:53,086 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:02:53,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195724111] [2022-12-06 00:02:53,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:02:53,086 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:02:53,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:02:53,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:02:53,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:02:53,087 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:02:53,087 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:02:53,087 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:02:53,087 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:02:53,087 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:02:53,467 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:02:53,467 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:02:53,476 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13562 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:02:53,487 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:02:53,487 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:02:53,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:02:53,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:02:53,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:02:53,488 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:02:53,488 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:02:53,489 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:02:53,537 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:02:53,539 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:53,539 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:02:53,540 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:02:53,540 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:02:53,540 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:53,540 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:02:53,541 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:02:53,541 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:53,541 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:53,577 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:02:53,578 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 00:02:53,580 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3312/3520 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2974 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:02:53,583 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:53,583 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:02:53,790 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:02:53,791 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 251 [2022-12-06 00:02:53,791 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:02:53,791 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:02:53,791 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:02:53,791 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:02:53,791 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable210 [2022-12-06 00:02:53,791 INFO L420 AbstractCegarLoop]: === Iteration 212 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:02:53,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:02:53,792 INFO L85 PathProgramCache]: Analyzing trace with hash -1402796311, now seen corresponding path program 1 times [2022-12-06 00:02:53,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:02:53,792 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865691322] [2022-12-06 00:02:53,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:02:53,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:02:53,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:02:53,862 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-06 00:02:53,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:02:53,863 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865691322] [2022-12-06 00:02:53,863 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [865691322] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:02:53,863 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:02:53,863 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:02:53,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231370502] [2022-12-06 00:02:53,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:02:53,863 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:02:53,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:02:53,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:02:53,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:02:53,864 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:02:53,864 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:02:53,864 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:02:53,864 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:02:53,864 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:02:54,268 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:02:54,268 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:02:54,278 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13552 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:02:54,289 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:02:54,290 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:02:54,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:02:54,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:02:54,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:02:54,291 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:02:54,291 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:02:54,291 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:02:54,344 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:02:54,346 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:54,346 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:02:54,346 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:02:54,346 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:02:54,346 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:54,347 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:02:54,347 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:02:54,347 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:54,348 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:54,380 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:02:54,381 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 00:02:54,382 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3321/3530 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2986 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:02:54,385 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:54,399 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:02:54,573 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:02:54,573 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 227 [2022-12-06 00:02:54,573 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:02:54,573 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:02:54,573 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:02:54,574 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:02:54,574 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable211 [2022-12-06 00:02:54,574 INFO L420 AbstractCegarLoop]: === Iteration 213 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:02:54,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:02:54,574 INFO L85 PathProgramCache]: Analyzing trace with hash 340014024, now seen corresponding path program 1 times [2022-12-06 00:02:54,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:02:54,574 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624643076] [2022-12-06 00:02:54,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:02:54,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:02:54,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:02:54,658 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-06 00:02:54,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:02:54,658 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624643076] [2022-12-06 00:02:54,659 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1624643076] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:02:54,659 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:02:54,659 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:02:54,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451197085] [2022-12-06 00:02:54,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:02:54,659 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:02:54,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:02:54,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:02:54,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:02:54,660 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:02:54,660 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:02:54,660 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:02:54,660 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:02:54,660 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:02:55,025 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:02:55,025 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:02:55,036 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13565 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:02:55,046 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:02:55,046 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:02:55,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:02:55,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:02:55,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:02:55,047 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:02:55,047 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:02:55,047 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:02:55,102 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:02:55,104 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:55,104 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:02:55,104 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:02:55,104 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:02:55,104 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:55,105 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:02:55,105 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:02:55,105 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:55,106 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:55,143 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:02:55,143 INFO L131 PetriNetUnfolder]: For 3327/3536 co-relation queries the response was YES. [2022-12-06 00:02:55,145 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3327/3536 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2990 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:02:55,148 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:55,148 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:02:55,335 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:02:55,336 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 232 [2022-12-06 00:02:55,336 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:02:55,336 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:02:55,336 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:02:55,336 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:02:55,336 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable212 [2022-12-06 00:02:55,337 INFO L420 AbstractCegarLoop]: === Iteration 214 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:02:55,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:02:55,337 INFO L85 PathProgramCache]: Analyzing trace with hash 2082824359, now seen corresponding path program 1 times [2022-12-06 00:02:55,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:02:55,337 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333097130] [2022-12-06 00:02:55,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:02:55,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:02:55,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:02:55,410 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-06 00:02:55,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:02:55,410 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333097130] [2022-12-06 00:02:55,410 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1333097130] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:02:55,410 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:02:55,411 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:02:55,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038074109] [2022-12-06 00:02:55,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:02:55,411 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:02:55,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:02:55,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:02:55,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:02:55,411 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:02:55,411 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:02:55,412 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:02:55,412 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:02:55,412 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:02:55,797 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:02:55,798 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 00:02:55,808 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13557 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:02:55,820 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:02:55,820 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:02:55,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:02:55,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:02:55,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:02:55,821 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:02:55,821 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:02:55,821 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:02:55,871 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:02:55,873 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:55,873 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:02:55,873 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:02:55,873 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:02:55,873 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:55,874 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:02:55,874 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:02:55,874 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:55,875 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:55,915 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:02:55,915 INFO L131 PetriNetUnfolder]: For 3293/3500 co-relation queries the response was YES. [2022-12-06 00:02:55,917 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3293/3500 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2995 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:02:55,920 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:55,920 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:02:56,110 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:02:56,110 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 237 [2022-12-06 00:02:56,110 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:02:56,110 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:02:56,111 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:02:56,111 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:02:56,111 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable213 [2022-12-06 00:02:56,111 INFO L420 AbstractCegarLoop]: === Iteration 215 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:02:56,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:02:56,111 INFO L85 PathProgramCache]: Analyzing trace with hash -469332602, now seen corresponding path program 1 times [2022-12-06 00:02:56,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:02:56,111 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659955482] [2022-12-06 00:02:56,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:02:56,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:02:56,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:02:56,186 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-06 00:02:56,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:02:56,186 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659955482] [2022-12-06 00:02:56,186 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1659955482] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:02:56,186 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:02:56,186 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:02:56,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414292285] [2022-12-06 00:02:56,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:02:56,186 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:02:56,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:02:56,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:02:56,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:02:56,187 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:02:56,187 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:02:56,187 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:02:56,187 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:02:56,187 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:02:56,545 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:02:56,546 INFO L131 PetriNetUnfolder]: For 27136/27181 co-relation queries the response was YES. [2022-12-06 00:02:56,553 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27136/27181 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13529 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:02:56,564 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:02:56,564 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:02:56,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:02:56,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:02:56,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:02:56,583 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:02:56,583 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:02:56,584 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:02:56,656 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:02:56,658 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:56,658 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:02:56,658 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:02:56,658 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:02:56,658 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:56,659 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:02:56,659 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:02:56,659 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:56,660 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:56,692 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:02:56,692 INFO L131 PetriNetUnfolder]: For 3156/3296 co-relation queries the response was YES. [2022-12-06 00:02:56,693 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3156/3296 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2987 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:02:56,696 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:56,696 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:02:56,858 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:02:56,859 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 201 [2022-12-06 00:02:56,859 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:02:56,859 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:02:56,859 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:02:56,859 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:02:56,859 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable214 [2022-12-06 00:02:56,859 INFO L420 AbstractCegarLoop]: === Iteration 216 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:02:56,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:02:56,860 INFO L85 PathProgramCache]: Analyzing trace with hash 1273477733, now seen corresponding path program 1 times [2022-12-06 00:02:56,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:02:56,860 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174456714] [2022-12-06 00:02:56,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:02:56,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:02:56,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:02:56,954 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-06 00:02:56,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:02:56,955 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174456714] [2022-12-06 00:02:56,955 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [174456714] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:02:56,955 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:02:56,955 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:02:56,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664001965] [2022-12-06 00:02:56,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:02:56,955 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:02:56,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:02:56,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:02:56,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:02:56,956 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:02:56,956 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:02:56,956 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:02:56,956 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:02:56,956 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:02:57,345 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:02:57,346 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 00:02:57,354 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13570 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:02:57,364 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:02:57,365 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:02:57,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:02:57,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:02:57,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:02:57,366 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:02:57,366 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:02:57,366 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:02:57,411 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:02:57,413 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:57,413 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:02:57,413 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:02:57,413 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:02:57,413 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:57,414 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:02:57,414 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:02:57,414 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:57,415 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:57,447 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:02:57,447 INFO L131 PetriNetUnfolder]: For 3301/3509 co-relation queries the response was YES. [2022-12-06 00:02:57,449 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3301/3509 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2987 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:02:57,452 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:57,452 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:02:57,626 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:02:57,627 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 214 [2022-12-06 00:02:57,627 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:02:57,627 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:02:57,627 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:02:57,627 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:02:57,627 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable215 [2022-12-06 00:02:57,628 INFO L420 AbstractCegarLoop]: === Iteration 217 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:02:57,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:02:57,628 INFO L85 PathProgramCache]: Analyzing trace with hash -1278679228, now seen corresponding path program 1 times [2022-12-06 00:02:57,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:02:57,628 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439670424] [2022-12-06 00:02:57,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:02:57,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:02:57,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:02:57,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-06 00:02:57,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:02:57,726 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439670424] [2022-12-06 00:02:57,727 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1439670424] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:02:57,727 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:02:57,727 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:02:57,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328729386] [2022-12-06 00:02:57,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:02:57,727 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:02:57,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:02:57,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:02:57,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:02:57,728 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:02:57,728 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:02:57,728 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:02:57,728 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:02:57,728 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:02:58,084 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:02:58,084 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 00:02:58,091 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13569 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:02:58,101 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:02:58,101 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:02:58,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:02:58,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:02:58,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:02:58,102 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:02:58,102 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:02:58,102 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:02:58,163 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:02:58,165 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:58,165 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:02:58,166 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:02:58,166 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:02:58,166 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:58,166 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:02:58,167 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:02:58,167 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:58,168 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:58,202 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:02:58,202 INFO L131 PetriNetUnfolder]: For 3339/3551 co-relation queries the response was YES. [2022-12-06 00:02:58,203 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3339/3551 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2992 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:02:58,206 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:58,206 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:02:58,378 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:02:58,378 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 212 [2022-12-06 00:02:58,378 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:02:58,378 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:02:58,378 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:02:58,379 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:02:58,379 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable216 [2022-12-06 00:02:58,379 INFO L420 AbstractCegarLoop]: === Iteration 218 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:02:58,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:02:58,379 INFO L85 PathProgramCache]: Analyzing trace with hash 464131107, now seen corresponding path program 1 times [2022-12-06 00:02:58,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:02:58,379 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786773806] [2022-12-06 00:02:58,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:02:58,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:02:58,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:02:58,529 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-06 00:02:58,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:02:58,529 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786773806] [2022-12-06 00:02:58,529 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [786773806] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:02:58,529 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:02:58,529 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:02:58,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792600199] [2022-12-06 00:02:58,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:02:58,530 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:02:58,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:02:58,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:02:58,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:02:58,530 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:02:58,530 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:02:58,530 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:02:58,530 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:02:58,531 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:02:58,886 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:02:58,886 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:02:58,893 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13576 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:02:58,901 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:02:58,902 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:02:58,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:02:58,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:02:58,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:02:58,902 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:02:58,903 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:02:58,903 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:02:58,941 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:02:58,942 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:58,942 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:02:58,942 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:02:58,942 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:02:58,942 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:58,943 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:02:58,943 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:02:58,943 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:58,944 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:58,979 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:02:58,980 INFO L131 PetriNetUnfolder]: For 3301/3509 co-relation queries the response was YES. [2022-12-06 00:02:58,981 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3301/3509 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2987 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:02:58,984 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:58,984 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:02:59,184 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:02:59,185 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 243 [2022-12-06 00:02:59,185 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:02:59,185 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:02:59,185 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:02:59,185 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:02:59,185 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable217 [2022-12-06 00:02:59,185 INFO L420 AbstractCegarLoop]: === Iteration 219 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:02:59,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:02:59,185 INFO L85 PathProgramCache]: Analyzing trace with hash -2088025854, now seen corresponding path program 1 times [2022-12-06 00:02:59,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:02:59,186 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670097992] [2022-12-06 00:02:59,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:02:59,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:02:59,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:02:59,257 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:02:59,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:02:59,258 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670097992] [2022-12-06 00:02:59,258 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [670097992] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:02:59,258 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:02:59,258 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:02:59,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338487376] [2022-12-06 00:02:59,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:02:59,258 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:02:59,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:02:59,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:02:59,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:02:59,259 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:02:59,259 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:02:59,259 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:02:59,259 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:02:59,259 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:02:59,638 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:02:59,639 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:02:59,647 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13552 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:02:59,657 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:02:59,658 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:02:59,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:02:59,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:02:59,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:02:59,659 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:02:59,659 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:02:59,659 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:02:59,708 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:02:59,710 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:59,710 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:02:59,710 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:02:59,710 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:02:59,710 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:59,711 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:02:59,711 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:02:59,711 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:59,712 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:59,744 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:02:59,744 INFO L131 PetriNetUnfolder]: For 3310/3519 co-relation queries the response was YES. [2022-12-06 00:02:59,745 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3310/3519 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2978 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:02:59,748 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:02:59,748 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:02:59,932 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:02:59,932 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 222 [2022-12-06 00:02:59,932 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:02:59,932 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:02:59,932 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:02:59,933 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:02:59,933 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable218 [2022-12-06 00:02:59,933 INFO L420 AbstractCegarLoop]: === Iteration 220 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:02:59,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:02:59,933 INFO L85 PathProgramCache]: Analyzing trace with hash -345215519, now seen corresponding path program 1 times [2022-12-06 00:02:59,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:02:59,933 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972578099] [2022-12-06 00:02:59,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:02:59,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:02:59,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:03:00,048 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-06 00:03:00,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:03:00,049 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972578099] [2022-12-06 00:03:00,049 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [972578099] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:03:00,049 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:03:00,049 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:03:00,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356937191] [2022-12-06 00:03:00,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:03:00,049 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:03:00,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:03:00,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:03:00,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:03:00,063 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:03:00,063 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:03:00,063 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:03:00,063 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:03:00,064 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:03:00,468 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:03:00,468 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 00:03:00,477 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13574 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:03:00,488 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:03:00,488 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:03:00,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:03:00,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:03:00,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:03:00,489 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:03:00,489 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:03:00,489 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:03:00,582 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:03:00,584 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:00,585 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:03:00,585 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:03:00,585 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:03:00,585 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:00,586 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:03:00,586 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:03:00,586 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:00,587 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:00,621 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:03:00,621 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 00:03:00,623 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3321/3530 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2994 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:03:00,626 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:00,626 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:03:00,817 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:03:00,817 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 232 [2022-12-06 00:03:00,818 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:03:00,818 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:03:00,818 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:03:00,818 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:03:00,818 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable219 [2022-12-06 00:03:00,818 INFO L420 AbstractCegarLoop]: === Iteration 221 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:03:00,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:03:00,818 INFO L85 PathProgramCache]: Analyzing trace with hash 1397594816, now seen corresponding path program 1 times [2022-12-06 00:03:00,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:03:00,818 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74551382] [2022-12-06 00:03:00,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:03:00,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:03:00,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:03:00,903 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-06 00:03:00,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:03:00,903 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74551382] [2022-12-06 00:03:00,903 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [74551382] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:03:00,904 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:03:00,904 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:03:00,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122472750] [2022-12-06 00:03:00,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:03:00,904 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:03:00,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:03:00,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:03:00,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:03:00,905 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:03:00,905 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:03:00,905 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:03:00,905 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:03:00,905 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:03:01,299 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:03:01,299 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:03:01,308 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13548 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:03:01,320 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:03:01,320 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:03:01,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:03:01,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:03:01,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:03:01,321 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:03:01,321 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:03:01,321 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:03:01,374 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:03:01,376 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:01,376 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:03:01,376 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:03:01,376 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:03:01,376 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:01,377 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:03:01,377 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:03:01,377 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:01,378 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:01,410 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:03:01,410 INFO L131 PetriNetUnfolder]: For 3348/3558 co-relation queries the response was YES. [2022-12-06 00:03:01,412 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3348/3558 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2975 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:03:01,414 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:01,415 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:03:01,592 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:03:01,593 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 217 [2022-12-06 00:03:01,593 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:03:01,593 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:03:01,593 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:03:01,593 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:03:01,593 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable220 [2022-12-06 00:03:01,593 INFO L420 AbstractCegarLoop]: === Iteration 222 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:03:01,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:03:01,594 INFO L85 PathProgramCache]: Analyzing trace with hash -1154562145, now seen corresponding path program 1 times [2022-12-06 00:03:01,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:03:01,594 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299069143] [2022-12-06 00:03:01,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:03:01,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:03:01,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:03:01,700 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-06 00:03:01,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:03:01,700 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299069143] [2022-12-06 00:03:01,700 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1299069143] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:03:01,700 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:03:01,700 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:03:01,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718686744] [2022-12-06 00:03:01,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:03:01,701 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:03:01,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:03:01,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:03:01,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:03:01,701 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:03:01,701 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:03:01,701 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:03:01,701 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:03:01,702 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:03:02,083 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:03:02,083 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 00:03:02,092 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26965/27010 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13527 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:03:02,103 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:03:02,103 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:03:02,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:03:02,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:03:02,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:03:02,104 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:03:02,104 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:03:02,104 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:03:02,153 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:03:02,155 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:02,155 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:03:02,155 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:03:02,155 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:03:02,156 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:02,156 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:03:02,156 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:03:02,156 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:02,157 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:02,189 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:03:02,189 INFO L131 PetriNetUnfolder]: For 3134/3275 co-relation queries the response was YES. [2022-12-06 00:03:02,191 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3134/3275 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2980 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:03:02,193 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:02,193 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:03:02,372 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:03:02,373 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 218 [2022-12-06 00:03:02,373 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:03:02,373 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:03:02,373 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:03:02,373 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:03:02,373 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable221 [2022-12-06 00:03:02,373 INFO L420 AbstractCegarLoop]: === Iteration 223 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:03:02,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:03:02,373 INFO L85 PathProgramCache]: Analyzing trace with hash 588248190, now seen corresponding path program 1 times [2022-12-06 00:03:02,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:03:02,374 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895662413] [2022-12-06 00:03:02,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:03:02,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:03:02,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:03:02,459 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-06 00:03:02,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:03:02,460 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895662413] [2022-12-06 00:03:02,460 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1895662413] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:03:02,460 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:03:02,460 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:03:02,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075287773] [2022-12-06 00:03:02,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:03:02,460 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:03:02,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:03:02,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:03:02,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:03:02,461 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:03:02,461 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:03:02,461 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:03:02,461 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:03:02,461 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:03:03,063 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:03:03,064 INFO L131 PetriNetUnfolder]: For 27146/27191 co-relation queries the response was YES. [2022-12-06 00:03:03,071 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27146/27191 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13518 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:03:03,081 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:03:03,081 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:03:03,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:03:03,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:03:03,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:03:03,082 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:03:03,082 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:03:03,082 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:03:03,128 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:03:03,129 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:03,129 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:03:03,130 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:03:03,130 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:03:03,130 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:03,131 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:03:03,131 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:03:03,131 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:03,132 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:03,163 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:03:03,164 INFO L131 PetriNetUnfolder]: For 3156/3296 co-relation queries the response was YES. [2022-12-06 00:03:03,165 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3156/3296 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2974 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:03:03,167 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:03,168 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:03:03,338 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:03:03,338 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 208 [2022-12-06 00:03:03,338 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:03:03,338 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:03:03,338 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:03:03,338 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:03:03,339 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable222 [2022-12-06 00:03:03,339 INFO L420 AbstractCegarLoop]: === Iteration 224 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:03:03,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:03:03,339 INFO L85 PathProgramCache]: Analyzing trace with hash -1963908771, now seen corresponding path program 1 times [2022-12-06 00:03:03,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:03:03,339 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462503497] [2022-12-06 00:03:03,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:03:03,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:03:03,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:03:03,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-06 00:03:03,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:03:03,411 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462503497] [2022-12-06 00:03:03,411 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [462503497] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:03:03,411 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:03:03,411 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:03:03,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203069003] [2022-12-06 00:03:03,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:03:03,411 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:03:03,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:03:03,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:03:03,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:03:03,412 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:03:03,412 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:03:03,412 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:03:03,412 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:03:03,412 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:03:03,759 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:03:03,760 INFO L131 PetriNetUnfolder]: For 26955/27000 co-relation queries the response was YES. [2022-12-06 00:03:03,767 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26955/27000 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13512 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:03:03,777 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:03:03,777 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:03:03,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:03:03,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:03:03,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:03:03,778 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:03:03,778 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:03:03,778 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:03:03,827 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:03:03,828 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:03,829 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:03:03,829 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:03:03,829 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:03:03,829 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:03,830 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:03:03,830 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:03:03,830 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:03,830 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:03,865 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:03:03,865 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 00:03:03,867 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3133/3273 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2978 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:03:03,869 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:03,870 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:03:04,073 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:03:04,074 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 245 [2022-12-06 00:03:04,074 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:03:04,074 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:03:04,074 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:03:04,074 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:03:04,074 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable223 [2022-12-06 00:03:04,074 INFO L420 AbstractCegarLoop]: === Iteration 225 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:03:04,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:03:04,074 INFO L85 PathProgramCache]: Analyzing trace with hash -221098436, now seen corresponding path program 1 times [2022-12-06 00:03:04,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:03:04,075 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043223964] [2022-12-06 00:03:04,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:03:04,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:03:04,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:03:04,222 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-06 00:03:04,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:03:04,223 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043223964] [2022-12-06 00:03:04,223 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1043223964] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:03:04,223 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:03:04,223 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:03:04,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078842809] [2022-12-06 00:03:04,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:03:04,223 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:03:04,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:03:04,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:03:04,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:03:04,224 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:03:04,224 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:03:04,224 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:03:04,224 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:03:04,224 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:03:04,537 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:03:04,537 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:03:04,543 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13568 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:03:04,551 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:03:04,551 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:03:04,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:03:04,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:03:04,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:03:04,552 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:03:04,552 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:03:04,552 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:03:04,594 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:03:04,596 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:04,596 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:03:04,596 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:03:04,596 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:03:04,596 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:04,597 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:03:04,597 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:03:04,597 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:04,598 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:04,631 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:03:04,632 INFO L131 PetriNetUnfolder]: For 3327/3536 co-relation queries the response was YES. [2022-12-06 00:03:04,633 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3327/3536 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2967 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:03:04,636 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:04,637 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:03:04,860 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:03:04,861 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 265 [2022-12-06 00:03:04,861 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:03:04,861 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:03:04,861 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:03:04,861 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:03:04,861 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable224 [2022-12-06 00:03:04,861 INFO L420 AbstractCegarLoop]: === Iteration 226 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:03:04,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:03:04,862 INFO L85 PathProgramCache]: Analyzing trace with hash 1521711899, now seen corresponding path program 1 times [2022-12-06 00:03:04,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:03:04,862 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400295917] [2022-12-06 00:03:04,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:03:04,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:03:04,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:03:04,953 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-06 00:03:04,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:03:04,953 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400295917] [2022-12-06 00:03:04,953 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1400295917] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:03:04,953 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:03:04,953 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:03:04,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996513717] [2022-12-06 00:03:04,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:03:04,954 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:03:04,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:03:04,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:03:04,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:03:04,954 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:03:04,954 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:03:04,954 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:03:04,955 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:03:04,955 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:03:05,322 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:03:05,323 INFO L131 PetriNetUnfolder]: For 27136/27181 co-relation queries the response was YES. [2022-12-06 00:03:05,330 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27136/27181 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13529 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:03:05,338 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:03:05,339 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:03:05,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:03:05,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:03:05,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:03:05,340 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:03:05,340 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:03:05,340 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:03:05,385 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:03:05,386 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:05,386 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:03:05,387 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:03:05,387 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:03:05,387 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:05,387 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:03:05,387 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:03:05,388 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:05,388 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:05,422 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:03:05,423 INFO L131 PetriNetUnfolder]: For 3156/3296 co-relation queries the response was YES. [2022-12-06 00:03:05,424 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3156/3296 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 3002 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:03:05,426 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:05,426 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:03:05,583 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:03:05,584 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 197 [2022-12-06 00:03:05,584 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:03:05,584 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:03:05,584 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:03:05,584 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:03:05,584 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable225 [2022-12-06 00:03:05,584 INFO L420 AbstractCegarLoop]: === Iteration 227 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:03:05,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:03:05,585 INFO L85 PathProgramCache]: Analyzing trace with hash -1030445062, now seen corresponding path program 1 times [2022-12-06 00:03:05,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:03:05,585 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526809074] [2022-12-06 00:03:05,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:03:05,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:03:05,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:03:05,656 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-06 00:03:05,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:03:05,657 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526809074] [2022-12-06 00:03:05,657 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1526809074] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:03:05,657 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:03:05,657 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:03:05,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158474348] [2022-12-06 00:03:05,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:03:05,657 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:03:05,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:03:05,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:03:05,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:03:05,658 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:03:05,658 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:03:05,658 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:03:05,658 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:03:05,658 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:03:05,988 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:03:05,989 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:03:05,995 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13574 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:03:06,004 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:03:06,004 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:03:06,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:03:06,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:03:06,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:03:06,005 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:03:06,005 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:03:06,005 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:03:06,048 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:03:06,050 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:06,050 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:03:06,050 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:03:06,050 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:03:06,050 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:06,051 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:03:06,051 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:03:06,051 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:06,053 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:06,087 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:03:06,088 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 00:03:06,089 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3312/3520 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2978 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:03:06,091 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:06,091 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:03:06,276 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:03:06,278 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 228 [2022-12-06 00:03:06,278 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:03:06,278 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:03:06,278 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:03:06,278 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:03:06,278 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable226 [2022-12-06 00:03:06,278 INFO L420 AbstractCegarLoop]: === Iteration 228 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:03:06,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:03:06,278 INFO L85 PathProgramCache]: Analyzing trace with hash 712365273, now seen corresponding path program 1 times [2022-12-06 00:03:06,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:03:06,279 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761153020] [2022-12-06 00:03:06,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:03:06,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:03:06,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:03:06,370 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-06 00:03:06,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:03:06,370 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761153020] [2022-12-06 00:03:06,370 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1761153020] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:03:06,370 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:03:06,370 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:03:06,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577420449] [2022-12-06 00:03:06,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:03:06,371 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:03:06,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:03:06,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:03:06,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:03:06,371 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:03:06,372 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:03:06,372 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:03:06,372 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:03:06,372 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:03:06,748 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:03:06,748 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:03:06,753 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13576 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:03:06,760 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:03:06,760 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:03:06,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:03:06,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:03:06,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:03:06,761 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:03:06,761 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:03:06,761 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:03:06,801 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:03:06,804 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:06,804 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:03:06,804 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:03:06,804 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:03:06,804 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:06,805 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:03:06,805 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:03:06,805 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:06,806 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:06,842 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:03:06,842 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 00:03:06,844 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3321/3530 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2987 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:03:06,847 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:06,847 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:03:07,031 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:03:07,031 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 227 [2022-12-06 00:03:07,032 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:03:07,032 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:03:07,032 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:03:07,032 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:03:07,032 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable227 [2022-12-06 00:03:07,032 INFO L420 AbstractCegarLoop]: === Iteration 229 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:03:07,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:03:07,032 INFO L85 PathProgramCache]: Analyzing trace with hash -1839791688, now seen corresponding path program 1 times [2022-12-06 00:03:07,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:03:07,032 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932871648] [2022-12-06 00:03:07,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:03:07,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:03:07,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:03:07,130 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-06 00:03:07,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:03:07,132 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932871648] [2022-12-06 00:03:07,132 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [932871648] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:03:07,132 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:03:07,132 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:03:07,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323255983] [2022-12-06 00:03:07,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:03:07,133 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:03:07,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:03:07,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:03:07,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:03:07,133 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:03:07,133 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:03:07,133 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:03:07,133 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:03:07,133 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:03:07,445 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:03:07,445 INFO L131 PetriNetUnfolder]: For 27229/27274 co-relation queries the response was YES. [2022-12-06 00:03:07,451 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27229/27274 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13554 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:03:07,461 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:03:07,461 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:03:07,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:03:07,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:03:07,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:03:07,462 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:03:07,462 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:03:07,462 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:03:07,498 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:03:07,500 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:07,500 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:03:07,500 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:03:07,500 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:03:07,500 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:07,501 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:03:07,501 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:03:07,501 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:07,502 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:07,526 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:03:07,526 INFO L131 PetriNetUnfolder]: For 3338/3550 co-relation queries the response was YES. [2022-12-06 00:03:07,527 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3338/3550 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2986 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:03:07,529 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:07,529 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:03:07,702 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:03:07,702 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 202 [2022-12-06 00:03:07,702 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:03:07,702 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:03:07,702 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:03:07,702 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:03:07,703 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable228 [2022-12-06 00:03:07,703 INFO L420 AbstractCegarLoop]: === Iteration 230 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:03:07,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:03:07,703 INFO L85 PathProgramCache]: Analyzing trace with hash -96981353, now seen corresponding path program 1 times [2022-12-06 00:03:07,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:03:07,703 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462170356] [2022-12-06 00:03:07,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:03:07,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:03:07,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:03:07,769 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-06 00:03:07,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:03:07,770 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462170356] [2022-12-06 00:03:07,770 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [462170356] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:03:07,770 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:03:07,770 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:03:07,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361950147] [2022-12-06 00:03:07,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:03:07,770 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:03:07,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:03:07,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:03:07,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:03:07,770 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:03:07,771 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:03:07,771 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:03:07,771 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:03:07,771 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:03:08,090 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:03:08,090 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 00:03:08,096 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13571 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:03:08,104 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:03:08,104 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:03:08,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:03:08,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:03:08,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:03:08,105 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:03:08,105 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:03:08,105 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:03:08,147 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:03:08,148 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:08,148 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:03:08,149 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:03:08,149 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:03:08,149 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:08,149 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:03:08,149 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:03:08,149 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:08,150 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:08,176 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:03:08,176 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 00:03:08,177 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3312/3520 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2987 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:03:08,179 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:08,179 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:03:08,359 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:03:08,359 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 210 [2022-12-06 00:03:08,359 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:03:08,359 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:03:08,359 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:03:08,360 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:03:08,360 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable229 [2022-12-06 00:03:08,360 INFO L420 AbstractCegarLoop]: === Iteration 231 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:03:08,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:03:08,360 INFO L85 PathProgramCache]: Analyzing trace with hash 1645828982, now seen corresponding path program 1 times [2022-12-06 00:03:08,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:03:08,360 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075746274] [2022-12-06 00:03:08,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:03:08,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:03:08,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:03:08,453 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-06 00:03:08,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:03:08,453 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075746274] [2022-12-06 00:03:08,453 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1075746274] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:03:08,453 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:03:08,454 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:03:08,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303511561] [2022-12-06 00:03:08,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:03:08,454 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:03:08,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:03:08,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:03:08,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:03:08,454 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:03:08,455 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:03:08,455 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:03:08,455 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:03:08,455 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:03:08,780 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:03:08,781 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 00:03:08,789 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26965/27010 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13509 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:03:08,799 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:03:08,800 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:03:08,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:03:08,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:03:08,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:03:08,808 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:03:08,808 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:03:08,808 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:03:08,851 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:03:08,853 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:08,853 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:03:08,859 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:03:08,859 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:03:08,859 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:08,860 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:03:08,860 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:03:08,860 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:08,861 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:08,887 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:03:08,887 INFO L131 PetriNetUnfolder]: For 3122/3262 co-relation queries the response was YES. [2022-12-06 00:03:08,888 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3122/3262 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2987 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:03:08,890 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:08,890 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:03:09,067 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:03:09,067 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 208 [2022-12-06 00:03:09,067 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:03:09,067 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:03:09,068 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:03:09,068 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:03:09,068 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable230 [2022-12-06 00:03:09,068 INFO L420 AbstractCegarLoop]: === Iteration 232 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:03:09,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:03:09,068 INFO L85 PathProgramCache]: Analyzing trace with hash -906327979, now seen corresponding path program 1 times [2022-12-06 00:03:09,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:03:09,068 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965134696] [2022-12-06 00:03:09,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:03:09,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:03:09,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:03:09,148 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-06 00:03:09,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:03:09,148 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965134696] [2022-12-06 00:03:09,148 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [965134696] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:03:09,149 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:03:09,149 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:03:09,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038512423] [2022-12-06 00:03:09,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:03:09,149 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:03:09,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:03:09,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:03:09,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:03:09,149 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:03:09,150 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:03:09,150 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:03:09,150 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:03:09,150 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:03:09,471 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:03:09,471 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 00:03:09,478 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13582 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:03:09,486 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:03:09,487 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:03:09,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:03:09,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:03:09,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:03:09,488 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:03:09,488 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:03:09,488 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:03:09,538 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:03:09,540 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:09,540 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:03:09,540 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:03:09,540 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:03:09,540 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:09,541 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:03:09,541 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:03:09,541 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:09,542 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:09,574 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:03:09,575 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 00:03:09,576 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3321/3530 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2988 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:03:09,578 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:09,578 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:03:09,767 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:03:09,768 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 228 [2022-12-06 00:03:09,768 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:03:09,768 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:03:09,768 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:03:09,768 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:03:09,768 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable231 [2022-12-06 00:03:09,768 INFO L420 AbstractCegarLoop]: === Iteration 233 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:03:09,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:03:09,768 INFO L85 PathProgramCache]: Analyzing trace with hash 836482356, now seen corresponding path program 1 times [2022-12-06 00:03:09,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:03:09,769 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114500289] [2022-12-06 00:03:09,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:03:09,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:03:09,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:03:09,858 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-06 00:03:09,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:03:09,858 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114500289] [2022-12-06 00:03:09,858 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1114500289] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:03:09,858 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:03:09,858 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:03:09,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517308070] [2022-12-06 00:03:09,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:03:09,859 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:03:09,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:03:09,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:03:09,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:03:09,859 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:03:09,859 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:03:09,859 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:03:09,859 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:03:09,859 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:03:10,243 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:03:10,244 INFO L131 PetriNetUnfolder]: For 27146/27191 co-relation queries the response was YES. [2022-12-06 00:03:10,251 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27146/27191 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13548 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:03:10,261 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:03:10,262 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:03:10,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:03:10,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:03:10,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:03:10,262 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:03:10,263 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:03:10,263 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:03:10,309 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:03:10,311 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:10,311 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:03:10,311 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:03:10,311 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:03:10,311 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:10,312 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:03:10,312 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:03:10,312 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:10,313 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:10,349 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:03:10,349 INFO L131 PetriNetUnfolder]: For 3180/3321 co-relation queries the response was YES. [2022-12-06 00:03:10,350 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3180/3321 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2988 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:03:10,352 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:10,352 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:03:10,494 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:03:10,495 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 184 [2022-12-06 00:03:10,495 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:03:10,495 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:03:10,495 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:03:10,495 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:03:10,495 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable232 [2022-12-06 00:03:10,495 INFO L420 AbstractCegarLoop]: === Iteration 234 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:03:10,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:03:10,496 INFO L85 PathProgramCache]: Analyzing trace with hash -1715674605, now seen corresponding path program 1 times [2022-12-06 00:03:10,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:03:10,496 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674149606] [2022-12-06 00:03:10,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:03:10,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:03:10,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:03:10,564 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-06 00:03:10,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:03:10,564 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674149606] [2022-12-06 00:03:10,564 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1674149606] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:03:10,564 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:03:10,564 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:03:10,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117734361] [2022-12-06 00:03:10,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:03:10,564 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:03:10,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:03:10,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:03:10,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:03:10,565 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:03:10,565 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:03:10,565 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:03:10,565 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:03:10,565 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:03:10,877 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:03:10,877 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:03:10,884 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13582 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:03:10,894 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:03:10,894 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:03:10,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:03:10,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:03:10,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:03:10,895 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:03:10,895 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:03:10,895 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:03:10,942 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:03:10,943 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:10,944 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:03:10,944 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:03:10,944 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:03:10,944 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:10,945 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:03:10,945 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:03:10,945 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:10,946 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:10,978 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:03:10,978 INFO L131 PetriNetUnfolder]: For 3301/3509 co-relation queries the response was YES. [2022-12-06 00:03:10,979 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3301/3509 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2983 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:03:10,982 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:10,982 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:03:11,167 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:03:11,167 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 223 [2022-12-06 00:03:11,167 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:03:11,167 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:03:11,167 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:03:11,167 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:03:11,167 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable233 [2022-12-06 00:03:11,168 INFO L420 AbstractCegarLoop]: === Iteration 235 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:03:11,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:03:11,168 INFO L85 PathProgramCache]: Analyzing trace with hash 27135730, now seen corresponding path program 1 times [2022-12-06 00:03:11,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:03:11,168 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200743356] [2022-12-06 00:03:11,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:03:11,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:03:11,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:03:11,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-06 00:03:11,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:03:11,260 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200743356] [2022-12-06 00:03:11,260 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [200743356] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:03:11,260 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:03:11,260 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:03:11,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250069010] [2022-12-06 00:03:11,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:03:11,261 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:03:11,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:03:11,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:03:11,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:03:11,261 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:03:11,261 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:03:11,261 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:03:11,261 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:03:11,262 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:03:11,584 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:03:11,584 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:03:11,592 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13558 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:03:11,601 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:03:11,601 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:03:11,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:03:11,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:03:11,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:03:11,604 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:03:11,604 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:03:11,604 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:03:11,648 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:03:11,650 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:11,650 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:03:11,650 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:03:11,650 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:03:11,650 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:11,651 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:03:11,651 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:03:11,651 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:11,652 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:11,684 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:03:11,684 INFO L131 PetriNetUnfolder]: For 3310/3519 co-relation queries the response was YES. [2022-12-06 00:03:11,685 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3310/3519 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2969 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:03:11,687 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:11,687 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:03:11,830 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:03:11,831 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 181 [2022-12-06 00:03:11,831 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:03:11,831 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:03:11,831 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:03:11,831 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:03:11,831 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable234 [2022-12-06 00:03:11,831 INFO L420 AbstractCegarLoop]: === Iteration 236 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:03:11,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:03:11,831 INFO L85 PathProgramCache]: Analyzing trace with hash 1769946065, now seen corresponding path program 1 times [2022-12-06 00:03:11,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:03:11,832 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341496367] [2022-12-06 00:03:11,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:03:11,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:03:11,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:03:11,910 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-06 00:03:11,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:03:11,910 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341496367] [2022-12-06 00:03:11,910 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [341496367] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:03:11,910 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:03:11,910 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:03:11,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767780944] [2022-12-06 00:03:11,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:03:11,911 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:03:11,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:03:11,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:03:11,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:03:11,911 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:03:11,911 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:03:11,911 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:03:11,911 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:03:11,911 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:03:12,267 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:03:12,267 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 00:03:12,272 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13561 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:03:12,279 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:03:12,279 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:03:12,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:03:12,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:03:12,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:03:12,280 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:03:12,280 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:03:12,280 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:03:12,310 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:03:12,311 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:12,311 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:03:12,312 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:03:12,312 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:03:12,312 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:12,312 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:03:12,312 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:03:12,312 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:12,313 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:12,337 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:03:12,337 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 00:03:12,338 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3312/3520 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2981 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:03:12,340 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:12,340 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:03:12,502 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:03:12,502 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 190 [2022-12-06 00:03:12,502 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:03:12,502 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:03:12,502 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:03:12,502 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:03:12,502 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable235 [2022-12-06 00:03:12,502 INFO L420 AbstractCegarLoop]: === Iteration 237 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:03:12,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:03:12,503 INFO L85 PathProgramCache]: Analyzing trace with hash -782210896, now seen corresponding path program 1 times [2022-12-06 00:03:12,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:03:12,503 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855040540] [2022-12-06 00:03:12,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:03:12,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:03:12,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:03:12,599 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-06 00:03:12,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:03:12,599 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855040540] [2022-12-06 00:03:12,599 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [855040540] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:03:12,599 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:03:12,599 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:03:12,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056292719] [2022-12-06 00:03:12,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:03:12,600 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:03:12,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:03:12,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:03:12,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:03:12,600 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:03:12,600 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:03:12,600 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:03:12,600 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:03:12,600 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:03:12,937 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:03:12,937 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:03:12,942 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13549 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:03:12,952 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:03:12,953 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:03:12,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:03:12,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:03:12,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:03:12,955 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:03:12,955 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:03:12,955 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:03:13,005 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:03:13,006 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:13,006 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:03:13,006 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:03:13,007 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:03:13,007 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:13,007 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:03:13,007 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:03:13,007 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:13,008 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:13,041 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:03:13,041 INFO L131 PetriNetUnfolder]: For 3348/3558 co-relation queries the response was YES. [2022-12-06 00:03:13,042 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3348/3558 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2972 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:03:13,045 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:13,045 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:03:13,245 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:03:13,245 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 238 [2022-12-06 00:03:13,245 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:03:13,245 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:03:13,245 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:03:13,245 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:03:13,246 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable236 [2022-12-06 00:03:13,246 INFO L420 AbstractCegarLoop]: === Iteration 238 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:03:13,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:03:13,246 INFO L85 PathProgramCache]: Analyzing trace with hash 960599439, now seen corresponding path program 1 times [2022-12-06 00:03:13,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:03:13,246 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959839235] [2022-12-06 00:03:13,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:03:13,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:03:13,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:03:13,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-06 00:03:13,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:03:13,316 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959839235] [2022-12-06 00:03:13,316 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1959839235] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:03:13,316 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:03:13,316 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:03:13,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009163558] [2022-12-06 00:03:13,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:03:13,317 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:03:13,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:03:13,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:03:13,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:03:13,317 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:03:13,317 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:03:13,317 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:03:13,317 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:03:13,317 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:03:13,767 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:03:13,767 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:03:13,775 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13557 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:03:13,785 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:03:13,785 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:03:13,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:03:13,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:03:13,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:03:13,786 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:03:13,787 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:03:13,787 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:03:13,835 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:03:13,836 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:13,836 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:03:13,837 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:03:13,837 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:03:13,837 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:13,838 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:03:13,838 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:03:13,838 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:13,839 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:13,872 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:03:13,872 INFO L131 PetriNetUnfolder]: For 3309/3518 co-relation queries the response was YES. [2022-12-06 00:03:13,873 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3309/3518 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2996 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:03:13,876 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:13,876 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:03:14,067 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:03:14,067 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 230 [2022-12-06 00:03:14,067 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:03:14,067 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:03:14,067 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:03:14,068 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:03:14,068 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable237 [2022-12-06 00:03:14,068 INFO L420 AbstractCegarLoop]: === Iteration 239 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:03:14,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:03:14,068 INFO L85 PathProgramCache]: Analyzing trace with hash -1591557522, now seen corresponding path program 1 times [2022-12-06 00:03:14,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:03:14,068 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051867363] [2022-12-06 00:03:14,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:03:14,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:03:14,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:03:14,154 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-06 00:03:14,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:03:14,154 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051867363] [2022-12-06 00:03:14,155 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051867363] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:03:14,155 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:03:14,155 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:03:14,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443025159] [2022-12-06 00:03:14,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:03:14,155 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:03:14,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:03:14,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:03:14,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:03:14,156 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:03:14,156 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:03:14,156 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:03:14,156 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:03:14,156 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:03:14,592 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:03:14,593 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 00:03:14,602 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26965/27010 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13543 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:03:14,613 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:03:14,613 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:03:14,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:03:14,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:03:14,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:03:14,614 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:03:14,614 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:03:14,615 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:03:14,670 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:03:14,671 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:14,672 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:03:14,672 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:03:14,672 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:03:14,672 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:14,674 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:03:14,674 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:03:14,674 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:14,675 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:14,713 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:03:14,713 INFO L131 PetriNetUnfolder]: For 3122/3262 co-relation queries the response was YES. [2022-12-06 00:03:14,715 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3122/3262 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2961 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:03:14,718 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:14,718 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:03:14,913 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:03:14,913 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 241 [2022-12-06 00:03:14,913 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:03:14,914 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:03:14,914 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:03:14,914 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:03:14,914 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable238 [2022-12-06 00:03:14,914 INFO L420 AbstractCegarLoop]: === Iteration 240 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:03:14,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:03:14,914 INFO L85 PathProgramCache]: Analyzing trace with hash 151252813, now seen corresponding path program 1 times [2022-12-06 00:03:14,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:03:14,915 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595920033] [2022-12-06 00:03:14,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:03:14,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:03:14,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:03:15,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-06 00:03:15,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:03:15,005 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595920033] [2022-12-06 00:03:15,005 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1595920033] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:03:15,005 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:03:15,005 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:03:15,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608412248] [2022-12-06 00:03:15,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:03:15,005 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:03:15,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:03:15,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:03:15,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:03:15,006 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:03:15,006 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:03:15,006 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:03:15,006 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:03:15,006 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:03:15,375 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:03:15,376 INFO L131 PetriNetUnfolder]: For 27136/27181 co-relation queries the response was YES. [2022-12-06 00:03:15,384 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27136/27181 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13549 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:03:15,394 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:03:15,394 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:03:15,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:03:15,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:03:15,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:03:15,395 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:03:15,395 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:03:15,395 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:03:15,442 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:03:15,443 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:15,444 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:03:15,444 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:03:15,444 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:03:15,444 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:15,445 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:03:15,445 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:03:15,445 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:15,445 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:15,478 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:03:15,478 INFO L131 PetriNetUnfolder]: For 3167/3307 co-relation queries the response was YES. [2022-12-06 00:03:15,480 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3167/3307 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2983 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:03:15,482 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:15,482 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:03:15,682 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:03:15,683 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 239 [2022-12-06 00:03:15,683 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:03:15,683 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:03:15,683 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:03:15,684 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:03:15,684 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable239 [2022-12-06 00:03:15,684 INFO L420 AbstractCegarLoop]: === Iteration 241 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:03:15,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:03:15,684 INFO L85 PathProgramCache]: Analyzing trace with hash 1894063148, now seen corresponding path program 1 times [2022-12-06 00:03:15,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:03:15,684 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059190596] [2022-12-06 00:03:15,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:03:15,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:03:15,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:03:15,804 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-06 00:03:15,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:03:15,804 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059190596] [2022-12-06 00:03:15,804 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1059190596] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:03:15,804 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:03:15,805 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:03:15,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28173420] [2022-12-06 00:03:15,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:03:15,805 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:03:15,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:03:15,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:03:15,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:03:15,806 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:03:15,806 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:03:15,806 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:03:15,806 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:03:15,806 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:03:16,289 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:03:16,290 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:03:16,299 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13555 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:03:16,311 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:03:16,311 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:03:16,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:03:16,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:03:16,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:03:16,313 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:03:16,313 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:03:16,313 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:03:16,364 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:03:16,366 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:16,367 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:03:16,367 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:03:16,367 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:03:16,367 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:16,368 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:03:16,368 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:03:16,368 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:16,369 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:16,406 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:03:16,406 INFO L131 PetriNetUnfolder]: For 3338/3547 co-relation queries the response was YES. [2022-12-06 00:03:16,408 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3338/3547 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2975 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:03:16,410 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:16,411 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:03:16,618 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:03:16,618 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 251 [2022-12-06 00:03:16,618 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:03:16,619 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:03:16,619 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:03:16,619 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:03:16,619 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable240 [2022-12-06 00:03:16,619 INFO L420 AbstractCegarLoop]: === Iteration 242 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:03:16,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:03:16,619 INFO L85 PathProgramCache]: Analyzing trace with hash -658093813, now seen corresponding path program 1 times [2022-12-06 00:03:16,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:03:16,620 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419561005] [2022-12-06 00:03:16,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:03:16,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:03:16,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:03:16,712 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-06 00:03:16,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:03:16,712 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419561005] [2022-12-06 00:03:16,712 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1419561005] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:03:16,713 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:03:16,713 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:03:16,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29695285] [2022-12-06 00:03:16,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:03:16,714 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:03:16,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:03:16,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:03:16,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:03:16,714 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:03:16,714 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:03:16,714 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:03:16,714 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:03:16,715 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:03:17,115 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:03:17,115 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:03:17,124 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13558 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:03:17,135 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:03:17,135 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:03:17,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:03:17,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:03:17,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:03:17,136 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:03:17,136 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:03:17,136 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:03:17,182 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:03:17,183 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:17,183 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:03:17,184 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:03:17,184 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:03:17,184 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:17,184 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:03:17,184 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:03:17,185 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:17,185 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:17,217 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:03:17,217 INFO L131 PetriNetUnfolder]: For 3304/3511 co-relation queries the response was YES. [2022-12-06 00:03:17,219 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3304/3511 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2979 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:03:17,221 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:17,221 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:03:17,406 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:03:17,407 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 223 [2022-12-06 00:03:17,407 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:03:17,407 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:03:17,407 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:03:17,407 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:03:17,407 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable241 [2022-12-06 00:03:17,408 INFO L420 AbstractCegarLoop]: === Iteration 243 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:03:17,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:03:17,408 INFO L85 PathProgramCache]: Analyzing trace with hash 1084716522, now seen corresponding path program 1 times [2022-12-06 00:03:17,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:03:17,408 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070091331] [2022-12-06 00:03:17,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:03:17,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:03:17,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:03:17,493 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-06 00:03:17,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:03:17,493 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070091331] [2022-12-06 00:03:17,493 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1070091331] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:03:17,493 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:03:17,493 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:03:17,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704506584] [2022-12-06 00:03:17,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:03:17,494 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:03:17,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:03:17,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:03:17,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:03:17,494 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:03:17,494 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:03:17,494 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:03:17,494 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:03:17,494 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:03:17,871 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:03:17,871 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:03:17,880 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13554 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:03:17,890 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:03:17,890 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:03:17,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:03:17,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:03:17,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:03:17,892 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:03:17,892 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:03:17,892 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:03:17,945 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:03:17,947 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:17,947 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:03:17,947 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:03:17,947 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:03:17,947 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:17,948 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:03:17,948 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:03:17,948 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:17,949 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:17,984 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:03:17,984 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 00:03:17,985 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3321/3530 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2979 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:03:17,988 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:17,988 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:03:18,171 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:03:18,172 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 225 [2022-12-06 00:03:18,172 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:03:18,172 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:03:18,172 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:03:18,172 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:03:18,172 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable242 [2022-12-06 00:03:18,172 INFO L420 AbstractCegarLoop]: === Iteration 244 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:03:18,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:03:18,173 INFO L85 PathProgramCache]: Analyzing trace with hash -1467440439, now seen corresponding path program 1 times [2022-12-06 00:03:18,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:03:18,173 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006967745] [2022-12-06 00:03:18,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:03:18,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:03:18,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:03:18,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-06 00:03:18,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:03:18,269 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006967745] [2022-12-06 00:03:18,269 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2006967745] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:03:18,269 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:03:18,269 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:03:18,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883812525] [2022-12-06 00:03:18,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:03:18,269 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:03:18,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:03:18,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:03:18,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:03:18,270 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:03:18,270 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:03:18,270 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:03:18,270 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:03:18,270 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:03:18,662 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:03:18,662 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:03:18,670 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13565 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:03:18,681 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:03:18,682 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:03:18,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:03:18,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:03:18,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:03:18,683 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:03:18,683 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:03:18,683 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:03:18,731 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:03:18,733 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:18,733 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:03:18,733 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:03:18,733 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:03:18,733 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:18,734 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:03:18,734 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:03:18,734 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:18,735 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:18,767 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:03:18,767 INFO L131 PetriNetUnfolder]: For 3301/3509 co-relation queries the response was YES. [2022-12-06 00:03:18,769 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3301/3509 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2977 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:03:18,772 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:18,772 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:03:18,965 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:03:18,965 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 232 [2022-12-06 00:03:18,966 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:03:18,966 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:03:18,966 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:03:18,966 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:03:18,966 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable243 [2022-12-06 00:03:18,966 INFO L420 AbstractCegarLoop]: === Iteration 245 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:03:18,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:03:18,966 INFO L85 PathProgramCache]: Analyzing trace with hash 275369896, now seen corresponding path program 1 times [2022-12-06 00:03:18,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:03:18,966 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884822872] [2022-12-06 00:03:18,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:03:18,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:03:18,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:03:19,054 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-06 00:03:19,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:03:19,055 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884822872] [2022-12-06 00:03:19,055 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1884822872] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:03:19,055 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:03:19,055 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:03:19,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720654609] [2022-12-06 00:03:19,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:03:19,056 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:03:19,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:03:19,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:03:19,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:03:19,056 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:03:19,056 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:03:19,056 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:03:19,056 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:03:19,056 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:03:19,435 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:03:19,435 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:03:19,443 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13562 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:03:19,453 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:03:19,453 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:03:19,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:03:19,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:03:19,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:03:19,454 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:03:19,454 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:03:19,454 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:03:19,502 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:03:19,503 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:19,503 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:03:19,504 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:03:19,504 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:03:19,504 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:19,505 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:03:19,505 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:03:19,505 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:19,506 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:19,538 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:03:19,538 INFO L131 PetriNetUnfolder]: For 3327/3536 co-relation queries the response was YES. [2022-12-06 00:03:19,539 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3327/3536 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2985 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:03:19,542 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:19,542 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:03:19,725 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:03:19,726 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 222 [2022-12-06 00:03:19,726 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:03:19,726 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:03:19,726 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:03:19,727 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:03:19,727 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable244 [2022-12-06 00:03:19,727 INFO L420 AbstractCegarLoop]: === Iteration 246 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:03:19,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:03:19,727 INFO L85 PathProgramCache]: Analyzing trace with hash 2018180231, now seen corresponding path program 1 times [2022-12-06 00:03:19,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:03:19,727 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693368639] [2022-12-06 00:03:19,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:03:19,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:03:19,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:03:19,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-06 00:03:19,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:03:19,823 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693368639] [2022-12-06 00:03:19,823 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1693368639] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:03:19,823 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:03:19,823 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:03:19,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33686432] [2022-12-06 00:03:19,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:03:19,824 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:03:19,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:03:19,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:03:19,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:03:19,824 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:03:19,825 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:03:19,825 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:03:19,825 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:03:19,825 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:03:20,203 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:03:20,203 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 00:03:20,211 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13540 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:03:20,222 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:03:20,223 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:03:20,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:03:20,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:03:20,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:03:20,224 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:03:20,224 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:03:20,224 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:03:20,272 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:03:20,274 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:20,274 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:03:20,274 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:03:20,274 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:03:20,274 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:20,275 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:03:20,275 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:03:20,275 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:20,276 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:20,325 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:03:20,326 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 00:03:20,327 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3312/3520 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2987 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:03:20,330 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:20,330 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:03:20,501 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:03:20,502 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 228 [2022-12-06 00:03:20,502 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:03:20,502 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:03:20,502 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:03:20,502 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:03:20,502 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable245 [2022-12-06 00:03:20,502 INFO L420 AbstractCegarLoop]: === Iteration 247 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:03:20,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:03:20,503 INFO L85 PathProgramCache]: Analyzing trace with hash -533976730, now seen corresponding path program 1 times [2022-12-06 00:03:20,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:03:20,503 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86526107] [2022-12-06 00:03:20,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:03:20,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:03:20,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:03:20,594 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-06 00:03:20,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:03:20,595 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86526107] [2022-12-06 00:03:20,595 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [86526107] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:03:20,595 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:03:20,595 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:03:20,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902717536] [2022-12-06 00:03:20,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:03:20,595 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:03:20,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:03:20,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:03:20,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:03:20,596 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:03:20,596 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:03:20,596 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:03:20,596 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:03:20,596 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:03:20,979 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:03:20,980 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:03:20,988 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13559 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:03:20,999 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:03:20,999 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:03:21,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:03:21,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:03:21,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:03:21,000 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:03:21,000 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:03:21,000 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:03:21,053 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:03:21,055 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:21,055 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:03:21,055 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:03:21,055 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:03:21,055 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:21,056 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:03:21,056 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:03:21,056 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:21,057 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:21,092 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:03:21,092 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 00:03:21,093 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3321/3530 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2990 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:03:21,096 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:21,096 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:03:21,281 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:03:21,282 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 227 [2022-12-06 00:03:21,282 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:03:21,282 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:03:21,282 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:03:21,282 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:03:21,282 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable246 [2022-12-06 00:03:21,282 INFO L420 AbstractCegarLoop]: === Iteration 248 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:03:21,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:03:21,283 INFO L85 PathProgramCache]: Analyzing trace with hash 1208833605, now seen corresponding path program 1 times [2022-12-06 00:03:21,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:03:21,283 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594212029] [2022-12-06 00:03:21,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:03:21,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:03:21,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:03:21,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-06 00:03:21,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:03:21,356 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594212029] [2022-12-06 00:03:21,356 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [594212029] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:03:21,356 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:03:21,356 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:03:21,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876567034] [2022-12-06 00:03:21,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:03:21,356 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:03:21,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:03:21,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:03:21,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:03:21,357 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:03:21,357 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:03:21,357 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:03:21,357 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:03:21,357 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:03:21,777 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:03:21,777 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:03:21,785 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13554 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:03:21,795 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:03:21,796 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:03:21,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:03:21,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:03:21,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:03:21,797 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:03:21,797 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:03:21,797 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:03:21,844 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:03:21,845 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:21,845 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:03:21,846 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:03:21,846 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:03:21,846 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:21,846 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:03:21,846 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:03:21,847 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:21,847 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:21,881 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:03:21,882 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 00:03:21,883 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3321/3530 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2989 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:03:21,886 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:21,886 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:03:22,106 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:03:22,107 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 261 [2022-12-06 00:03:22,107 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:03:22,107 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:03:22,107 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:03:22,108 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:03:22,108 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable247 [2022-12-06 00:03:22,108 INFO L420 AbstractCegarLoop]: === Iteration 249 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:03:22,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:03:22,108 INFO L85 PathProgramCache]: Analyzing trace with hash -1343323356, now seen corresponding path program 1 times [2022-12-06 00:03:22,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:03:22,109 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192692979] [2022-12-06 00:03:22,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:03:22,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:03:22,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:03:22,208 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-06 00:03:22,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:03:22,208 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192692979] [2022-12-06 00:03:22,208 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [192692979] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:03:22,208 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:03:22,208 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:03:22,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505673525] [2022-12-06 00:03:22,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:03:22,209 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:03:22,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:03:22,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:03:22,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:03:22,209 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:03:22,209 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:03:22,209 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:03:22,209 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:03:22,210 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:03:22,668 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:03:22,668 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:03:22,674 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13554 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:03:22,684 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:03:22,684 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:03:22,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:03:22,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:03:22,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:03:22,685 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:03:22,685 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:03:22,685 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:03:22,732 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:03:22,734 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:22,734 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:03:22,734 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:03:22,735 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:03:22,735 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:22,735 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:03:22,735 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:03:22,736 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:22,736 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:22,771 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:03:22,771 INFO L131 PetriNetUnfolder]: For 3338/3547 co-relation queries the response was YES. [2022-12-06 00:03:22,773 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3338/3547 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2983 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:03:22,776 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:22,776 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:03:22,953 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:03:22,954 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 219 [2022-12-06 00:03:22,954 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:03:22,954 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:03:22,954 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:03:22,954 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:03:22,954 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable248 [2022-12-06 00:03:22,954 INFO L420 AbstractCegarLoop]: === Iteration 250 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:03:22,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:03:22,955 INFO L85 PathProgramCache]: Analyzing trace with hash 399486979, now seen corresponding path program 1 times [2022-12-06 00:03:22,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:03:22,955 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059101552] [2022-12-06 00:03:22,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:03:22,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:03:22,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:03:23,046 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-06 00:03:23,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:03:23,047 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059101552] [2022-12-06 00:03:23,047 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1059101552] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:03:23,047 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:03:23,047 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:03:23,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79053686] [2022-12-06 00:03:23,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:03:23,048 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:03:23,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:03:23,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:03:23,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:03:23,049 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:03:23,049 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:03:23,049 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:03:23,049 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:03:23,049 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:03:23,434 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:03:23,434 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 00:03:23,442 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26965/27010 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13532 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:03:23,452 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:03:23,452 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:03:23,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:03:23,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:03:23,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:03:23,464 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:03:23,464 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:03:23,464 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:03:23,515 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:03:23,516 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:23,516 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:03:23,517 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:03:23,517 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:03:23,517 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:23,517 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:03:23,518 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:03:23,518 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:23,518 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:23,551 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:03:23,552 INFO L131 PetriNetUnfolder]: For 3134/3275 co-relation queries the response was YES. [2022-12-06 00:03:23,553 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3134/3275 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2982 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:03:23,555 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:23,556 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:03:23,757 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:03:23,758 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 241 [2022-12-06 00:03:23,758 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:03:23,758 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:03:23,758 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:03:23,758 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:03:23,758 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable249 [2022-12-06 00:03:23,759 INFO L420 AbstractCegarLoop]: === Iteration 251 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:03:23,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:03:23,759 INFO L85 PathProgramCache]: Analyzing trace with hash 2142297314, now seen corresponding path program 1 times [2022-12-06 00:03:23,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:03:23,759 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667742237] [2022-12-06 00:03:23,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:03:23,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:03:23,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:03:23,847 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:03:23,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:03:23,847 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667742237] [2022-12-06 00:03:23,847 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [667742237] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:03:23,847 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:03:23,847 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:03:23,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259179541] [2022-12-06 00:03:23,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:03:23,848 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:03:23,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:03:23,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:03:23,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:03:23,848 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:03:23,848 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:03:23,849 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:03:23,849 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:03:23,849 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:03:24,226 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:03:24,227 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:03:24,235 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13553 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:03:24,245 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:03:24,246 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:03:24,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:03:24,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:03:24,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:03:24,247 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:03:24,247 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:03:24,247 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:03:24,294 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:03:24,296 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:24,296 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:03:24,297 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:03:24,297 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:03:24,297 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:24,297 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:03:24,298 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:03:24,298 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:24,299 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:24,337 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:03:24,337 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 00:03:24,338 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3312/3520 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2979 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:03:24,341 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:24,341 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:03:24,540 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:03:24,541 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 244 [2022-12-06 00:03:24,541 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:03:24,541 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:03:24,541 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:03:24,541 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:03:24,542 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable250 [2022-12-06 00:03:24,542 INFO L420 AbstractCegarLoop]: === Iteration 252 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:03:24,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:03:24,542 INFO L85 PathProgramCache]: Analyzing trace with hash -409859647, now seen corresponding path program 1 times [2022-12-06 00:03:24,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:03:24,542 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901842538] [2022-12-06 00:03:24,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:03:24,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:03:24,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:03:24,649 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-06 00:03:24,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:03:24,650 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901842538] [2022-12-06 00:03:24,650 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1901842538] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:03:24,650 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:03:24,650 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:03:24,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40121502] [2022-12-06 00:03:24,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:03:24,650 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:03:24,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:03:24,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:03:24,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:03:24,654 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:03:24,654 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:03:24,654 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:03:24,654 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:03:24,654 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:03:25,031 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:03:25,031 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 00:03:25,040 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26969/27014 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13528 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:03:25,052 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:03:25,052 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:03:25,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:03:25,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:03:25,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:03:25,053 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:03:25,053 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:03:25,053 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:03:25,103 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:03:25,105 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:25,105 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:03:25,105 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:03:25,106 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:03:25,106 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:25,106 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:03:25,106 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:03:25,106 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:25,107 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:25,140 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:03:25,140 INFO L131 PetriNetUnfolder]: For 3123/3264 co-relation queries the response was YES. [2022-12-06 00:03:25,142 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3123/3264 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2967 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:03:25,145 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:25,145 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:03:25,323 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:03:25,324 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 218 [2022-12-06 00:03:25,324 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:03:25,324 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:03:25,324 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:03:25,324 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:03:25,324 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable251 [2022-12-06 00:03:25,324 INFO L420 AbstractCegarLoop]: === Iteration 253 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:03:25,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:03:25,324 INFO L85 PathProgramCache]: Analyzing trace with hash 1332950688, now seen corresponding path program 1 times [2022-12-06 00:03:25,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:03:25,325 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59071940] [2022-12-06 00:03:25,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:03:25,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:03:25,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:03:25,421 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-06 00:03:25,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:03:25,422 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [59071940] [2022-12-06 00:03:25,422 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [59071940] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:03:25,422 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:03:25,422 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:03:25,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053265623] [2022-12-06 00:03:25,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:03:25,422 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:03:25,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:03:25,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:03:25,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:03:25,423 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:03:25,423 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:03:25,423 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:03:25,423 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:03:25,423 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:03:25,794 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:03:25,794 INFO L131 PetriNetUnfolder]: For 27136/27181 co-relation queries the response was YES. [2022-12-06 00:03:25,802 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27136/27181 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13519 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:03:25,813 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:03:25,813 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:03:25,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:03:25,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:03:25,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:03:25,814 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:03:25,814 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:03:25,814 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:03:25,865 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:03:25,866 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:25,866 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:03:25,867 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:03:25,867 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:03:25,867 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:25,867 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:03:25,867 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:03:25,867 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:25,868 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:25,900 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:03:25,900 INFO L131 PetriNetUnfolder]: For 3174/3317 co-relation queries the response was YES. [2022-12-06 00:03:25,902 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3174/3317 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2997 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:03:25,905 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:25,905 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:03:26,100 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:03:26,100 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 233 [2022-12-06 00:03:26,101 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:03:26,101 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:03:26,101 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:03:26,101 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:03:26,101 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable252 [2022-12-06 00:03:26,101 INFO L420 AbstractCegarLoop]: === Iteration 254 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:03:26,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:03:26,101 INFO L85 PathProgramCache]: Analyzing trace with hash -1219206273, now seen corresponding path program 1 times [2022-12-06 00:03:26,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:03:26,102 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145713355] [2022-12-06 00:03:26,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:03:26,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:03:26,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:03:26,200 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-06 00:03:26,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:03:26,200 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145713355] [2022-12-06 00:03:26,200 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [145713355] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:03:26,200 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:03:26,200 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:03:26,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971167302] [2022-12-06 00:03:26,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:03:26,202 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:03:26,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:03:26,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:03:26,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:03:26,202 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:03:26,209 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:03:26,209 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:03:26,210 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:03:26,210 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:03:26,644 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:03:26,644 INFO L131 PetriNetUnfolder]: For 27136/27181 co-relation queries the response was YES. [2022-12-06 00:03:26,650 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27136/27181 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13555 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:03:26,657 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:03:26,658 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:03:26,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:03:26,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:03:26,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:03:26,659 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:03:26,659 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:03:26,659 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:03:26,699 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:03:26,700 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:26,700 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:03:26,701 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:03:26,701 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:03:26,701 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:26,702 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:03:26,702 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:03:26,702 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:26,703 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:26,735 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:03:26,735 INFO L131 PetriNetUnfolder]: For 3167/3307 co-relation queries the response was YES. [2022-12-06 00:03:26,736 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3167/3307 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 3006 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:03:26,739 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:26,739 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:03:26,909 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:03:26,910 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 209 [2022-12-06 00:03:26,910 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:03:26,910 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:03:26,910 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:03:26,910 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:03:26,910 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable253 [2022-12-06 00:03:26,910 INFO L420 AbstractCegarLoop]: === Iteration 255 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:03:26,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:03:26,911 INFO L85 PathProgramCache]: Analyzing trace with hash 523604062, now seen corresponding path program 1 times [2022-12-06 00:03:26,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:03:26,911 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212676313] [2022-12-06 00:03:26,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:03:26,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:03:26,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:03:26,994 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-06 00:03:26,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:03:26,995 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212676313] [2022-12-06 00:03:26,995 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [212676313] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:03:26,995 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:03:26,995 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:03:26,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859092795] [2022-12-06 00:03:26,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:03:26,995 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:03:26,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:03:26,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:03:26,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:03:26,996 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:03:26,996 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:03:26,996 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:03:26,996 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:03:26,996 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:03:27,386 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:03:27,386 INFO L131 PetriNetUnfolder]: For 27229/27274 co-relation queries the response was YES. [2022-12-06 00:03:27,395 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27229/27274 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13551 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:03:27,404 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:03:27,405 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:03:27,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:03:27,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:03:27,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:03:27,406 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:03:27,406 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:03:27,406 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:03:27,455 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:03:27,457 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:27,457 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:03:27,457 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:03:27,457 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:03:27,457 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:27,458 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:03:27,458 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:03:27,458 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:27,459 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:27,492 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:03:27,493 INFO L131 PetriNetUnfolder]: For 3301/3509 co-relation queries the response was YES. [2022-12-06 00:03:27,494 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3301/3509 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2993 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:03:27,498 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:27,498 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:03:27,677 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:03:27,678 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 221 [2022-12-06 00:03:27,678 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:03:27,678 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:03:27,678 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:03:27,678 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:03:27,678 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable254 [2022-12-06 00:03:27,678 INFO L420 AbstractCegarLoop]: === Iteration 256 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:03:27,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:03:27,679 INFO L85 PathProgramCache]: Analyzing trace with hash -2028552899, now seen corresponding path program 1 times [2022-12-06 00:03:27,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:03:27,679 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908663549] [2022-12-06 00:03:27,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:03:27,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:03:27,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:03:27,752 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-06 00:03:27,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:03:27,752 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908663549] [2022-12-06 00:03:27,752 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [908663549] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:03:27,752 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:03:27,752 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:03:27,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788756146] [2022-12-06 00:03:27,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:03:27,753 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:03:27,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:03:27,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:03:27,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:03:27,753 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:03:27,753 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:03:27,753 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:03:27,754 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:03:27,754 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:03:28,119 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:03:28,119 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 00:03:28,127 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13547 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:03:28,136 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:03:28,137 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:03:28,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:03:28,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:03:28,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:03:28,138 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:03:28,138 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:03:28,138 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:03:28,185 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:03:28,186 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:28,187 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:03:28,187 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:03:28,187 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:03:28,187 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:28,188 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:03:28,188 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:03:28,188 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:28,189 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:28,221 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:03:28,222 INFO L131 PetriNetUnfolder]: For 3301/3509 co-relation queries the response was YES. [2022-12-06 00:03:28,223 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3301/3509 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 3002 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:03:28,226 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:28,226 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:03:28,401 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:03:28,401 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 214 [2022-12-06 00:03:28,401 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:03:28,402 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:03:28,402 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:03:28,402 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:03:28,402 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable255 [2022-12-06 00:03:28,402 INFO L420 AbstractCegarLoop]: === Iteration 257 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:03:28,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:03:28,402 INFO L85 PathProgramCache]: Analyzing trace with hash -285742564, now seen corresponding path program 1 times [2022-12-06 00:03:28,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:03:28,402 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247083922] [2022-12-06 00:03:28,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:03:28,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:03:28,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:03:28,475 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-06 00:03:28,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:03:28,476 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247083922] [2022-12-06 00:03:28,476 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1247083922] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:03:28,476 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:03:28,476 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:03:28,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851953283] [2022-12-06 00:03:28,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:03:28,476 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:03:28,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:03:28,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:03:28,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:03:28,477 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:03:28,477 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:03:28,477 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:03:28,477 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:03:28,477 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:03:28,894 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:03:28,894 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 00:03:28,901 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13564 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:03:28,912 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:03:28,912 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:03:28,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:03:28,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:03:28,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:03:28,913 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:03:28,913 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:03:28,913 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:03:28,957 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:03:28,958 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:28,958 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:03:28,959 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:03:28,959 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:03:28,959 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:28,959 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:03:28,960 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:03:28,960 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:28,961 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:28,992 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:03:28,992 INFO L131 PetriNetUnfolder]: For 3349/3561 co-relation queries the response was YES. [2022-12-06 00:03:28,994 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3349/3561 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2982 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:03:28,996 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:28,996 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:03:29,194 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:03:29,194 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 235 [2022-12-06 00:03:29,195 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:03:29,195 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:03:29,195 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:03:29,195 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:03:29,195 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable256 [2022-12-06 00:03:29,195 INFO L420 AbstractCegarLoop]: === Iteration 258 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:03:29,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:03:29,195 INFO L85 PathProgramCache]: Analyzing trace with hash 1457067771, now seen corresponding path program 1 times [2022-12-06 00:03:29,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:03:29,196 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064125859] [2022-12-06 00:03:29,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:03:29,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:03:29,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:03:29,262 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-06 00:03:29,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:03:29,263 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064125859] [2022-12-06 00:03:29,263 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1064125859] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:03:29,263 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:03:29,263 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:03:29,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524911545] [2022-12-06 00:03:29,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:03:29,263 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:03:29,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:03:29,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:03:29,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:03:29,264 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:03:29,264 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:03:29,264 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:03:29,264 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:03:29,264 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:03:29,623 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:03:29,624 INFO L131 PetriNetUnfolder]: For 27229/27274 co-relation queries the response was YES. [2022-12-06 00:03:29,632 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27229/27274 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13544 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:03:29,642 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:03:29,643 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:03:29,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:03:29,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:03:29,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:03:29,644 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:03:29,644 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:03:29,644 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:03:29,691 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:03:29,693 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:29,693 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:03:29,693 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:03:29,693 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:03:29,693 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:29,694 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:03:29,694 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:03:29,694 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:29,695 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:29,730 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:03:29,731 INFO L131 PetriNetUnfolder]: For 3304/3511 co-relation queries the response was YES. [2022-12-06 00:03:29,732 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3304/3511 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2973 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:03:29,735 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:29,735 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:03:29,916 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:03:29,917 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 224 [2022-12-06 00:03:29,917 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:03:29,917 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:03:29,917 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:03:29,917 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:03:29,917 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable257 [2022-12-06 00:03:29,917 INFO L420 AbstractCegarLoop]: === Iteration 259 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:03:29,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:03:29,917 INFO L85 PathProgramCache]: Analyzing trace with hash -1095089190, now seen corresponding path program 1 times [2022-12-06 00:03:29,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:03:29,918 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857026940] [2022-12-06 00:03:29,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:03:29,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:03:29,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:03:29,998 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-06 00:03:29,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:03:29,999 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857026940] [2022-12-06 00:03:29,999 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [857026940] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:03:29,999 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:03:29,999 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:03:30,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331378253] [2022-12-06 00:03:30,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:03:30,003 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:03:30,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:03:30,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:03:30,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:03:30,003 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:03:30,004 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:03:30,004 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:03:30,004 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:03:30,004 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:03:30,374 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:03:30,374 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 00:03:30,382 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26969/27014 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13540 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:03:30,392 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:03:30,392 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:03:30,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:03:30,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:03:30,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:03:30,393 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:03:30,393 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:03:30,393 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:03:30,447 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:03:30,449 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:30,449 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:03:30,449 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:03:30,450 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:03:30,450 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:30,450 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:03:30,450 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:03:30,450 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:30,451 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:30,484 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:03:30,485 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 00:03:30,486 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3133/3273 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2979 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:03:30,489 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:30,489 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:03:30,763 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:03:30,764 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 314 [2022-12-06 00:03:30,764 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:03:30,764 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:03:30,764 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:03:30,764 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:03:30,764 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable258 [2022-12-06 00:03:30,764 INFO L420 AbstractCegarLoop]: === Iteration 260 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:03:30,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:03:30,764 INFO L85 PathProgramCache]: Analyzing trace with hash 647721145, now seen corresponding path program 1 times [2022-12-06 00:03:30,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:03:30,765 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529016568] [2022-12-06 00:03:30,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:03:30,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:03:30,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:03:30,852 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-06 00:03:30,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:03:30,852 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529016568] [2022-12-06 00:03:30,852 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1529016568] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:03:30,853 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:03:30,853 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:03:30,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420755598] [2022-12-06 00:03:30,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:03:30,853 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:03:30,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:03:30,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:03:30,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:03:30,853 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:03:30,854 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:03:30,854 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:03:30,854 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:03:30,854 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:03:31,220 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:03:31,220 INFO L131 PetriNetUnfolder]: For 27150/27195 co-relation queries the response was YES. [2022-12-06 00:03:31,228 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27150/27195 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13515 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:03:31,239 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:03:31,239 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:03:31,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:03:31,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:03:31,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:03:31,240 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:03:31,240 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:03:31,240 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:03:31,284 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:03:31,286 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:31,286 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:03:31,286 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:03:31,286 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:03:31,286 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:31,287 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:03:31,287 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:03:31,287 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:31,288 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:31,320 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:03:31,320 INFO L131 PetriNetUnfolder]: For 3168/3309 co-relation queries the response was YES. [2022-12-06 00:03:31,321 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3168/3309 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2993 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:03:31,324 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:31,325 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:03:31,541 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:03:31,541 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 255 [2022-12-06 00:03:31,541 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:03:31,541 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:03:31,542 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:03:31,542 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:03:31,542 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable259 [2022-12-06 00:03:31,542 INFO L420 AbstractCegarLoop]: === Iteration 261 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:03:31,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:03:31,542 INFO L85 PathProgramCache]: Analyzing trace with hash -1904435816, now seen corresponding path program 1 times [2022-12-06 00:03:31,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:03:31,542 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636595601] [2022-12-06 00:03:31,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:03:31,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:03:31,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:03:31,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-06 00:03:31,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:03:31,613 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636595601] [2022-12-06 00:03:31,613 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [636595601] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:03:31,613 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:03:31,613 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:03:31,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595231027] [2022-12-06 00:03:31,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:03:31,613 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:03:31,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:03:31,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:03:31,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:03:31,614 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:03:31,614 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:03:31,614 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:03:31,614 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:03:31,614 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:03:32,000 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:03:32,000 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:03:32,008 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13551 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:03:32,018 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:03:32,018 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:03:32,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:03:32,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:03:32,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:03:32,019 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:03:32,019 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:03:32,019 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:03:32,068 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:03:32,069 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:32,069 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:03:32,069 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:03:32,070 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:03:32,070 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:32,070 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:03:32,070 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:03:32,070 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:32,071 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:32,103 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:03:32,103 INFO L131 PetriNetUnfolder]: For 3348/3558 co-relation queries the response was YES. [2022-12-06 00:03:32,105 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3348/3558 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2972 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:03:32,108 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:32,108 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:03:32,342 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:03:32,342 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 272 [2022-12-06 00:03:32,342 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:03:32,343 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:03:32,343 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:03:32,343 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:03:32,343 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable260 [2022-12-06 00:03:32,343 INFO L420 AbstractCegarLoop]: === Iteration 262 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:03:32,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:03:32,343 INFO L85 PathProgramCache]: Analyzing trace with hash -161625481, now seen corresponding path program 1 times [2022-12-06 00:03:32,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:03:32,343 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131593271] [2022-12-06 00:03:32,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:03:32,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:03:32,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:03:32,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-06 00:03:32,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:03:32,442 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131593271] [2022-12-06 00:03:32,443 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2131593271] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:03:32,443 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:03:32,443 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:03:32,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543952896] [2022-12-06 00:03:32,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:03:32,443 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:03:32,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:03:32,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:03:32,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:03:32,444 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:03:32,444 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:03:32,444 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:03:32,444 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:03:32,444 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:03:32,850 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:03:32,850 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:03:32,857 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13567 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:03:32,866 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:03:32,867 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:03:32,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:03:32,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:03:32,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:03:32,868 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:03:32,868 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:03:32,868 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:03:32,909 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:03:32,911 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:32,911 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:03:32,911 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:03:32,911 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:03:32,911 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:32,912 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:03:32,912 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:03:32,912 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:32,913 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:32,943 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:03:32,944 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 00:03:32,945 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3312/3520 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2986 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:03:32,947 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:32,947 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:03:33,128 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:03:33,129 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 218 [2022-12-06 00:03:33,129 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:03:33,129 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:03:33,129 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:03:33,129 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:03:33,129 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable261 [2022-12-06 00:03:33,130 INFO L420 AbstractCegarLoop]: === Iteration 263 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:03:33,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:03:33,130 INFO L85 PathProgramCache]: Analyzing trace with hash 1581184854, now seen corresponding path program 1 times [2022-12-06 00:03:33,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:03:33,130 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512951186] [2022-12-06 00:03:33,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:03:33,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:03:33,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:03:33,216 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-06 00:03:33,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:03:33,216 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512951186] [2022-12-06 00:03:33,216 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1512951186] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:03:33,216 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:03:33,216 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:03:33,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614586380] [2022-12-06 00:03:33,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:03:33,217 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:03:33,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:03:33,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:03:33,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:03:33,217 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:03:33,217 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:03:33,217 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:03:33,217 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:03:33,217 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:03:33,580 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:03:33,580 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:03:33,588 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13560 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:03:33,598 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:03:33,598 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:03:33,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:03:33,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:03:33,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:03:33,599 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:03:33,599 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:03:33,599 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:03:33,648 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:03:33,650 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:33,650 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:03:33,650 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:03:33,650 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:03:33,650 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:33,651 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:03:33,651 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:03:33,651 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:33,652 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:33,686 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:03:33,686 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 00:03:33,688 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3321/3530 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2981 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:03:33,690 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:33,691 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:03:33,871 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:03:33,872 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 222 [2022-12-06 00:03:33,872 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:03:33,872 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:03:33,872 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:03:33,872 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:03:33,872 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable262 [2022-12-06 00:03:33,872 INFO L420 AbstractCegarLoop]: === Iteration 264 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:03:33,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:03:33,873 INFO L85 PathProgramCache]: Analyzing trace with hash -970972107, now seen corresponding path program 1 times [2022-12-06 00:03:33,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:03:33,873 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490984701] [2022-12-06 00:03:33,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:03:33,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:03:33,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:03:34,003 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-06 00:03:34,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:03:34,003 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490984701] [2022-12-06 00:03:34,003 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [490984701] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:03:34,003 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:03:34,004 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:03:34,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535248978] [2022-12-06 00:03:34,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:03:34,004 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:03:34,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:03:34,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:03:34,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:03:34,004 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:03:34,005 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:03:34,005 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:03:34,005 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:03:34,005 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:03:34,376 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:03:34,376 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 00:03:34,383 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26969/27014 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13534 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:03:34,394 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:03:34,394 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:03:34,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:03:34,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:03:34,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:03:34,395 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:03:34,395 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:03:34,395 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:03:34,451 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:03:34,453 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:34,453 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:03:34,453 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:03:34,454 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:03:34,454 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:34,454 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:03:34,454 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:03:34,455 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:34,456 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:34,495 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:03:34,495 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 00:03:34,497 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3133/3273 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2977 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:03:34,500 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:34,500 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:03:34,708 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:03:34,709 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 256 [2022-12-06 00:03:34,709 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:03:34,709 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:03:34,709 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:03:34,709 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:03:34,709 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable263 [2022-12-06 00:03:34,709 INFO L420 AbstractCegarLoop]: === Iteration 265 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:03:34,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:03:34,709 INFO L85 PathProgramCache]: Analyzing trace with hash 771838228, now seen corresponding path program 1 times [2022-12-06 00:03:34,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:03:34,710 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522780818] [2022-12-06 00:03:34,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:03:34,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:03:34,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:03:34,830 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-06 00:03:34,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:03:34,830 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522780818] [2022-12-06 00:03:34,830 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [522780818] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:03:34,830 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:03:34,830 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:03:34,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859351740] [2022-12-06 00:03:34,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:03:34,831 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:03:34,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:03:34,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:03:34,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:03:34,831 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:03:34,831 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:03:34,831 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:03:34,831 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:03:34,831 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:03:35,196 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:03:35,196 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 00:03:35,204 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26965/27010 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13522 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:03:35,215 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:03:35,215 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:03:35,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:03:35,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:03:35,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:03:35,224 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:03:35,224 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:03:35,224 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:03:35,271 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:03:35,273 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:35,273 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:03:35,273 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:03:35,273 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:03:35,273 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:35,274 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:03:35,274 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:03:35,274 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:35,275 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:35,308 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:03:35,308 INFO L131 PetriNetUnfolder]: For 3135/3276 co-relation queries the response was YES. [2022-12-06 00:03:35,310 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3135/3276 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2964 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:03:35,312 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:35,313 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:03:35,540 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:03:35,541 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 268 [2022-12-06 00:03:35,541 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:03:35,541 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:03:35,541 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:03:35,541 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:03:35,541 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable264 [2022-12-06 00:03:35,541 INFO L420 AbstractCegarLoop]: === Iteration 266 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:03:35,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:03:35,542 INFO L85 PathProgramCache]: Analyzing trace with hash -1780318733, now seen corresponding path program 1 times [2022-12-06 00:03:35,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:03:35,542 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122500104] [2022-12-06 00:03:35,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:03:35,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:03:35,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:03:35,623 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-06 00:03:35,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:03:35,624 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122500104] [2022-12-06 00:03:35,624 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1122500104] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:03:35,624 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:03:35,624 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:03:35,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302943749] [2022-12-06 00:03:35,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:03:35,624 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:03:35,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:03:35,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:03:35,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:03:35,625 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:03:35,625 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:03:35,625 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:03:35,625 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:03:35,625 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:03:36,031 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:03:36,031 INFO L131 PetriNetUnfolder]: For 26955/27000 co-relation queries the response was YES. [2022-12-06 00:03:36,040 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26955/27000 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13542 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:03:36,049 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:03:36,049 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:03:36,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:03:36,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:03:36,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:03:36,050 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:03:36,050 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:03:36,050 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:03:36,099 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:03:36,100 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:36,102 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:03:36,102 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:03:36,103 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:03:36,103 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:36,103 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:03:36,103 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:03:36,103 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:36,104 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:36,136 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:03:36,136 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 00:03:36,137 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3133/3273 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2974 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:03:36,140 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:36,140 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:03:36,330 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:03:36,331 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 228 [2022-12-06 00:03:36,331 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:03:36,331 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:03:36,331 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:03:36,332 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:03:36,332 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable265 [2022-12-06 00:03:36,332 INFO L420 AbstractCegarLoop]: === Iteration 267 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:03:36,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:03:36,332 INFO L85 PathProgramCache]: Analyzing trace with hash -37508398, now seen corresponding path program 1 times [2022-12-06 00:03:36,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:03:36,332 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123546543] [2022-12-06 00:03:36,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:03:36,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:03:36,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:03:36,424 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-06 00:03:36,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:03:36,424 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123546543] [2022-12-06 00:03:36,424 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [123546543] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:03:36,424 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:03:36,425 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:03:36,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597539109] [2022-12-06 00:03:36,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:03:36,425 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:03:36,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:03:36,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:03:36,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:03:36,425 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:03:36,425 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:03:36,426 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:03:36,426 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:03:36,426 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:03:36,787 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:03:36,787 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:03:36,824 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13541 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:03:36,831 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:03:36,831 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:03:36,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:03:36,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:03:36,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:03:36,832 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:03:36,832 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:03:36,832 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:03:36,870 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:03:36,871 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:36,872 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:03:36,872 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:03:36,872 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:03:36,872 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:36,873 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:03:36,873 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:03:36,873 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:36,873 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:36,907 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:03:36,907 INFO L131 PetriNetUnfolder]: For 3318/3528 co-relation queries the response was YES. [2022-12-06 00:03:36,909 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3318/3528 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2980 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:03:36,911 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:36,911 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:03:37,085 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:03:37,086 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 214 [2022-12-06 00:03:37,086 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:03:37,086 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:03:37,086 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:03:37,086 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:03:37,086 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable266 [2022-12-06 00:03:37,086 INFO L420 AbstractCegarLoop]: === Iteration 268 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:03:37,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:03:37,087 INFO L85 PathProgramCache]: Analyzing trace with hash 1705301937, now seen corresponding path program 1 times [2022-12-06 00:03:37,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:03:37,087 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756519781] [2022-12-06 00:03:37,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:03:37,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:03:37,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:03:37,158 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-06 00:03:37,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:03:37,159 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756519781] [2022-12-06 00:03:37,159 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1756519781] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:03:37,159 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:03:37,159 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:03:37,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29912840] [2022-12-06 00:03:37,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:03:37,159 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:03:37,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:03:37,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:03:37,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:03:37,160 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:03:37,160 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:03:37,160 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:03:37,160 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:03:37,160 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:03:37,556 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:03:37,557 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 00:03:37,562 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26969/27014 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13519 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:03:37,571 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:03:37,571 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:03:37,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:03:37,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:03:37,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:03:37,572 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:03:37,572 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:03:37,572 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:03:37,611 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:03:37,613 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:37,613 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:03:37,613 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:03:37,613 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:03:37,613 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:37,614 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:03:37,614 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:03:37,614 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:37,615 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:37,652 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:03:37,652 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 00:03:37,654 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3133/3273 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2982 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:03:37,657 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:37,657 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:03:37,847 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:03:37,848 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 235 [2022-12-06 00:03:37,848 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:03:37,848 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:03:37,848 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:03:37,848 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:03:37,848 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable267 [2022-12-06 00:03:37,848 INFO L420 AbstractCegarLoop]: === Iteration 269 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:03:37,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:03:37,848 INFO L85 PathProgramCache]: Analyzing trace with hash -846855024, now seen corresponding path program 1 times [2022-12-06 00:03:37,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:03:37,849 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096654251] [2022-12-06 00:03:37,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:03:37,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:03:37,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:03:37,930 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-06 00:03:37,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:03:37,931 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096654251] [2022-12-06 00:03:37,931 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2096654251] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:03:37,931 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:03:37,931 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:03:37,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219259595] [2022-12-06 00:03:37,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:03:37,931 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:03:37,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:03:37,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:03:37,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:03:37,931 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:03:37,932 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:03:37,932 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:03:37,932 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:03:37,932 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:03:38,271 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:03:38,272 INFO L131 PetriNetUnfolder]: For 27146/27191 co-relation queries the response was YES. [2022-12-06 00:03:38,278 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27146/27191 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13523 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:03:38,286 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:03:38,286 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:03:38,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:03:38,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:03:38,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:03:38,287 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:03:38,287 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:03:38,287 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:03:38,320 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:03:38,321 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:38,322 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:03:38,322 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:03:38,322 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:03:38,322 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:38,322 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:03:38,322 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:03:38,323 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:38,323 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:38,347 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:03:38,347 INFO L131 PetriNetUnfolder]: For 3169/3310 co-relation queries the response was YES. [2022-12-06 00:03:38,348 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3169/3310 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 3004 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:03:38,350 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:38,350 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:03:38,533 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:03:38,533 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 211 [2022-12-06 00:03:38,533 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:03:38,534 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:03:38,534 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:03:38,534 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:03:38,534 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable268 [2022-12-06 00:03:38,534 INFO L420 AbstractCegarLoop]: === Iteration 270 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:03:38,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:03:38,534 INFO L85 PathProgramCache]: Analyzing trace with hash 895955311, now seen corresponding path program 1 times [2022-12-06 00:03:38,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:03:38,534 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510526237] [2022-12-06 00:03:38,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:03:38,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:03:38,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:03:38,598 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-06 00:03:38,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:03:38,598 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510526237] [2022-12-06 00:03:38,598 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1510526237] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:03:38,598 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:03:38,598 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:03:38,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736060293] [2022-12-06 00:03:38,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:03:38,598 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:03:38,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:03:38,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:03:38,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:03:38,599 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:03:38,599 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:03:38,599 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:03:38,599 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:03:38,599 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:03:38,946 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:03:38,946 INFO L131 PetriNetUnfolder]: For 27136/27181 co-relation queries the response was YES. [2022-12-06 00:03:38,953 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27136/27181 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13522 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:03:38,961 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:03:38,962 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:03:38,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:03:38,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:03:38,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:03:38,963 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:03:38,963 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:03:38,963 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:03:39,005 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:03:39,007 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:39,007 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:03:39,007 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:03:39,007 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:03:39,007 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:39,008 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:03:39,008 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:03:39,008 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:39,008 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:39,042 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:03:39,042 INFO L131 PetriNetUnfolder]: For 3167/3307 co-relation queries the response was YES. [2022-12-06 00:03:39,044 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3167/3307 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 3008 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:03:39,047 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:39,047 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:03:39,262 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:03:39,263 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 256 [2022-12-06 00:03:39,263 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:03:39,263 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:03:39,263 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:03:39,263 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:03:39,263 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable269 [2022-12-06 00:03:39,263 INFO L420 AbstractCegarLoop]: === Iteration 271 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:03:39,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:03:39,264 INFO L85 PathProgramCache]: Analyzing trace with hash -1656201650, now seen corresponding path program 1 times [2022-12-06 00:03:39,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:03:39,264 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407283371] [2022-12-06 00:03:39,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:03:39,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:03:39,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:03:39,363 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-06 00:03:39,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:03:39,364 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407283371] [2022-12-06 00:03:39,364 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [407283371] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:03:39,364 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:03:39,364 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:03:39,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030599199] [2022-12-06 00:03:39,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:03:39,364 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:03:39,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:03:39,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:03:39,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:03:39,365 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:03:39,365 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:03:39,365 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:03:39,365 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:03:39,365 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:03:39,716 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:03:39,716 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:03:39,722 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13559 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:03:39,729 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:03:39,729 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:03:39,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:03:39,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:03:39,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:03:39,730 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:03:39,730 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:03:39,731 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:03:39,776 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:03:39,777 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:39,777 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:03:39,778 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:03:39,778 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:03:39,778 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:39,778 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:03:39,779 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:03:39,779 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:39,779 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:39,814 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:03:39,814 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 00:03:39,816 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3312/3520 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 3004 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:03:39,818 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:39,818 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:03:39,998 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:03:39,999 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 221 [2022-12-06 00:03:39,999 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:03:39,999 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:03:39,999 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:03:39,999 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:03:39,999 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable270 [2022-12-06 00:03:39,999 INFO L420 AbstractCegarLoop]: === Iteration 272 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:03:39,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:03:39,999 INFO L85 PathProgramCache]: Analyzing trace with hash 86608685, now seen corresponding path program 1 times [2022-12-06 00:03:40,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:03:40,000 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054091552] [2022-12-06 00:03:40,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:03:40,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:03:40,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:03:40,086 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-06 00:03:40,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:03:40,087 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054091552] [2022-12-06 00:03:40,087 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1054091552] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:03:40,087 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:03:40,087 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:03:40,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164934938] [2022-12-06 00:03:40,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:03:40,087 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:03:40,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:03:40,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:03:40,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:03:40,088 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:03:40,088 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:03:40,088 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:03:40,088 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:03:40,088 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:03:40,463 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:03:40,464 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:03:40,472 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13583 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:03:40,481 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:03:40,481 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:03:40,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:03:40,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:03:40,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:03:40,482 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:03:40,482 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:03:40,482 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:03:40,515 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:03:40,516 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:40,516 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:03:40,517 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:03:40,517 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:03:40,517 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:40,517 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:03:40,517 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:03:40,517 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:40,518 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:40,542 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:03:40,542 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 00:03:40,543 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3321/3530 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2981 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:03:40,554 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:40,554 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:03:40,756 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:03:40,757 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 240 [2022-12-06 00:03:40,757 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:03:40,757 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:03:40,757 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:03:40,757 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:03:40,757 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable271 [2022-12-06 00:03:40,757 INFO L420 AbstractCegarLoop]: === Iteration 273 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:03:40,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:03:40,758 INFO L85 PathProgramCache]: Analyzing trace with hash 1829419020, now seen corresponding path program 1 times [2022-12-06 00:03:40,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:03:40,758 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24388237] [2022-12-06 00:03:40,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:03:40,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:03:40,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:03:40,843 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-06 00:03:40,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:03:40,844 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24388237] [2022-12-06 00:03:40,844 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [24388237] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:03:40,844 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:03:40,844 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:03:40,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051943748] [2022-12-06 00:03:40,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:03:40,844 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:03:40,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:03:40,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:03:40,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:03:40,845 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:03:40,845 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:03:40,845 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:03:40,845 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:03:40,845 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:03:41,205 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:03:41,205 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 00:03:41,211 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26969/27014 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13522 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:03:41,219 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:03:41,219 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:03:41,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:03:41,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:03:41,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:03:41,220 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:03:41,220 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:03:41,220 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:03:41,257 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:03:41,258 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:41,259 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:03:41,259 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:03:41,259 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:03:41,259 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:41,259 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:03:41,259 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:03:41,259 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:41,260 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:41,284 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:03:41,285 INFO L131 PetriNetUnfolder]: For 3140/3283 co-relation queries the response was YES. [2022-12-06 00:03:41,285 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3140/3283 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2957 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:03:41,287 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:41,287 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:03:41,443 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:03:41,443 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 184 [2022-12-06 00:03:41,443 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:03:41,444 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:03:41,444 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:03:41,444 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:03:41,444 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable272 [2022-12-06 00:03:41,444 INFO L420 AbstractCegarLoop]: === Iteration 274 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:03:41,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:03:41,444 INFO L85 PathProgramCache]: Analyzing trace with hash -722737941, now seen corresponding path program 1 times [2022-12-06 00:03:41,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:03:41,444 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783828865] [2022-12-06 00:03:41,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:03:41,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:03:41,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:03:41,517 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-06 00:03:41,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:03:41,518 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783828865] [2022-12-06 00:03:41,518 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [783828865] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:03:41,518 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:03:41,518 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:03:41,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310206237] [2022-12-06 00:03:41,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:03:41,518 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:03:41,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:03:41,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:03:41,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:03:41,519 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:03:41,519 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:03:41,519 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:03:41,519 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:03:41,519 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:03:41,832 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:03:41,832 INFO L131 PetriNetUnfolder]: For 26955/27000 co-relation queries the response was YES. [2022-12-06 00:03:41,839 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26955/27000 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13528 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:03:41,849 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:03:41,849 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:03:41,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:03:41,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:03:41,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:03:41,850 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:03:41,850 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:03:41,851 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:03:41,896 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:03:41,898 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:41,898 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:03:41,898 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:03:41,898 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:03:41,898 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:41,899 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:03:41,899 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:03:41,899 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:41,900 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:41,928 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:03:41,928 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 00:03:41,929 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3133/3273 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2980 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:03:41,931 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:41,931 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:03:42,106 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:03:42,106 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 208 [2022-12-06 00:03:42,106 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:03:42,106 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:03:42,106 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:03:42,106 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:03:42,107 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable273 [2022-12-06 00:03:42,107 INFO L420 AbstractCegarLoop]: === Iteration 275 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:03:42,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:03:42,107 INFO L85 PathProgramCache]: Analyzing trace with hash 1020072394, now seen corresponding path program 1 times [2022-12-06 00:03:42,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:03:42,107 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101642705] [2022-12-06 00:03:42,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:03:42,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:03:42,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:03:42,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-06 00:03:42,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:03:42,189 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101642705] [2022-12-06 00:03:42,189 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2101642705] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:03:42,190 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:03:42,190 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:03:42,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698795809] [2022-12-06 00:03:42,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:03:42,190 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:03:42,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:03:42,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:03:42,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:03:42,191 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:03:42,191 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:03:42,191 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:03:42,191 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:03:42,191 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:03:42,529 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:03:42,529 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 00:03:42,536 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26969/27014 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13536 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:03:42,546 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:03:42,546 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:03:42,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:03:42,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:03:42,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:03:42,547 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:03:42,548 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:03:42,548 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:03:42,590 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:03:42,591 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:42,591 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:03:42,591 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:03:42,591 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:03:42,591 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:42,592 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:03:42,592 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:03:42,592 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:42,593 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:42,622 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:03:42,622 INFO L131 PetriNetUnfolder]: For 3123/3264 co-relation queries the response was YES. [2022-12-06 00:03:42,623 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3123/3264 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2992 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:03:42,625 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:42,625 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:03:42,798 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:03:42,799 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 208 [2022-12-06 00:03:42,799 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:03:42,799 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:03:42,799 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:03:42,799 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:03:42,799 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable274 [2022-12-06 00:03:42,799 INFO L420 AbstractCegarLoop]: === Iteration 276 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:03:42,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:03:42,799 INFO L85 PathProgramCache]: Analyzing trace with hash -1532084567, now seen corresponding path program 1 times [2022-12-06 00:03:42,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:03:42,799 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695754525] [2022-12-06 00:03:42,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:03:42,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:03:42,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:03:42,857 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-06 00:03:42,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:03:42,857 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695754525] [2022-12-06 00:03:42,857 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1695754525] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:03:42,857 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:03:42,857 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:03:42,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778723940] [2022-12-06 00:03:42,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:03:42,857 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:03:42,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:03:42,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:03:42,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:03:42,858 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:03:42,858 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:03:42,858 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:03:42,858 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:03:42,858 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:03:43,186 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:03:43,186 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 00:03:43,192 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26969/27014 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13539 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:03:43,199 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:03:43,200 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:03:43,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:03:43,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:03:43,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:03:43,200 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:03:43,200 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:03:43,200 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:03:43,235 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:03:43,237 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:43,237 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:03:43,237 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:03:43,237 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:03:43,237 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:43,238 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:03:43,238 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:03:43,238 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:43,238 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:43,264 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:03:43,264 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 00:03:43,265 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3133/3273 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2966 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:03:43,267 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:43,267 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:03:43,430 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:03:43,431 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 194 [2022-12-06 00:03:43,431 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:03:43,431 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:03:43,431 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:03:43,431 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:03:43,431 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable275 [2022-12-06 00:03:43,431 INFO L420 AbstractCegarLoop]: === Iteration 277 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:03:43,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:03:43,431 INFO L85 PathProgramCache]: Analyzing trace with hash 210725768, now seen corresponding path program 1 times [2022-12-06 00:03:43,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:03:43,431 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551222633] [2022-12-06 00:03:43,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:03:43,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:03:43,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:03:43,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:03:43,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:03:43,516 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551222633] [2022-12-06 00:03:43,516 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [551222633] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:03:43,516 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:03:43,516 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:03:43,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544537092] [2022-12-06 00:03:43,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:03:43,517 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:03:43,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:03:43,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:03:43,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:03:43,517 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:03:43,517 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:03:43,517 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:03:43,518 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:03:43,518 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:03:43,827 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:03:43,827 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:03:43,833 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13571 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:03:43,841 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:03:43,841 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:03:43,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:03:43,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:03:43,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:03:43,842 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:03:43,842 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:03:43,842 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:03:43,882 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:03:43,884 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:43,884 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:03:43,884 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:03:43,884 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:03:43,885 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:43,885 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:03:43,885 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:03:43,885 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:43,886 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:43,915 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:03:43,915 INFO L131 PetriNetUnfolder]: For 3349/3561 co-relation queries the response was YES. [2022-12-06 00:03:43,917 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3349/3561 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2982 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:03:43,919 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:43,919 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:03:44,084 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:03:44,085 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 201 [2022-12-06 00:03:44,085 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:03:44,085 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:03:44,085 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:03:44,085 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:03:44,085 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable276 [2022-12-06 00:03:44,085 INFO L420 AbstractCegarLoop]: === Iteration 278 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:03:44,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:03:44,085 INFO L85 PathProgramCache]: Analyzing trace with hash 1953536103, now seen corresponding path program 1 times [2022-12-06 00:03:44,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:03:44,086 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398297873] [2022-12-06 00:03:44,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:03:44,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:03:44,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:03:44,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-06 00:03:44,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:03:44,142 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398297873] [2022-12-06 00:03:44,142 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [398297873] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:03:44,142 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:03:44,142 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:03:44,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699634381] [2022-12-06 00:03:44,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:03:44,142 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:03:44,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:03:44,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:03:44,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:03:44,143 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:03:44,143 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:03:44,143 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:03:44,143 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:03:44,143 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:03:44,480 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:03:44,481 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:03:44,488 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13560 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:03:44,497 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:03:44,497 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:03:44,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:03:44,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:03:44,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:03:44,498 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:03:44,498 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:03:44,498 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:03:44,540 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:03:44,541 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:44,541 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:03:44,541 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:03:44,542 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:03:44,542 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:44,542 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:03:44,542 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:03:44,542 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:44,543 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:44,571 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:03:44,571 INFO L131 PetriNetUnfolder]: For 3304/3511 co-relation queries the response was YES. [2022-12-06 00:03:44,572 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3304/3511 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2977 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:03:44,575 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:44,575 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:03:44,750 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:03:44,750 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 208 [2022-12-06 00:03:44,751 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:03:44,751 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:03:44,751 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:03:44,751 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:03:44,751 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable277 [2022-12-06 00:03:44,751 INFO L420 AbstractCegarLoop]: === Iteration 279 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:03:44,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:03:44,751 INFO L85 PathProgramCache]: Analyzing trace with hash -598620858, now seen corresponding path program 1 times [2022-12-06 00:03:44,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:03:44,751 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859171956] [2022-12-06 00:03:44,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:03:44,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:03:44,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:03:44,816 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-06 00:03:44,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:03:44,817 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859171956] [2022-12-06 00:03:44,817 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1859171956] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:03:44,817 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:03:44,817 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:03:44,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216903197] [2022-12-06 00:03:44,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:03:44,817 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:03:44,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:03:44,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:03:44,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:03:44,817 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:03:44,818 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:03:44,818 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:03:44,818 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:03:44,818 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:03:45,173 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:03:45,173 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:03:45,181 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13566 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:03:45,192 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:03:45,193 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:03:45,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:03:45,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:03:45,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:03:45,193 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:03:45,194 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:03:45,194 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:03:45,239 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:03:45,251 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:45,251 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:03:45,252 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:03:45,252 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:03:45,252 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:45,252 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:03:45,252 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:03:45,253 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:45,253 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:45,285 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:03:45,285 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 00:03:45,286 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3312/3520 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2984 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:03:45,289 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:45,289 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:03:45,592 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:03:45,593 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 341 [2022-12-06 00:03:45,593 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:03:45,593 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:03:45,593 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:03:45,593 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:03:45,593 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable278 [2022-12-06 00:03:45,594 INFO L420 AbstractCegarLoop]: === Iteration 280 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:03:45,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:03:45,594 INFO L85 PathProgramCache]: Analyzing trace with hash 1144189477, now seen corresponding path program 1 times [2022-12-06 00:03:45,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:03:45,594 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742858859] [2022-12-06 00:03:45,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:03:45,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:03:45,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:03:45,678 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-06 00:03:45,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:03:45,678 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742858859] [2022-12-06 00:03:45,678 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [742858859] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:03:45,678 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:03:45,678 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:03:45,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782563918] [2022-12-06 00:03:45,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:03:45,679 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:03:45,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:03:45,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:03:45,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:03:45,679 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:03:45,679 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:03:45,679 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:03:45,679 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:03:45,679 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:03:46,062 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:03:46,062 INFO L131 PetriNetUnfolder]: For 27146/27191 co-relation queries the response was YES. [2022-12-06 00:03:46,071 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27146/27191 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13537 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:03:46,081 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:03:46,082 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:03:46,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:03:46,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:03:46,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:03:46,083 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:03:46,083 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:03:46,083 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:03:46,132 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:03:46,134 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:46,134 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:03:46,134 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:03:46,134 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:03:46,135 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:46,135 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:03:46,135 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:03:46,135 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:46,136 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:46,191 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:03:46,191 INFO L131 PetriNetUnfolder]: For 3168/3309 co-relation queries the response was YES. [2022-12-06 00:03:46,193 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3168/3309 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 3003 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:03:46,195 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:46,195 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:03:46,373 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:03:46,374 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 240 [2022-12-06 00:03:46,374 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:03:46,374 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:03:46,374 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:03:46,374 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:03:46,374 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable279 [2022-12-06 00:03:46,374 INFO L420 AbstractCegarLoop]: === Iteration 281 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:03:46,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:03:46,375 INFO L85 PathProgramCache]: Analyzing trace with hash -1407967484, now seen corresponding path program 1 times [2022-12-06 00:03:46,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:03:46,375 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373706499] [2022-12-06 00:03:46,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:03:46,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:03:46,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:03:46,469 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-06 00:03:46,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:03:46,469 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373706499] [2022-12-06 00:03:46,469 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [373706499] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:03:46,469 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:03:46,470 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:03:46,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866718714] [2022-12-06 00:03:46,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:03:46,470 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:03:46,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:03:46,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:03:46,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:03:46,470 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:03:46,470 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:03:46,470 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:03:46,471 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:03:46,471 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:03:46,842 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:03:46,842 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:03:46,850 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13569 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:03:46,861 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:03:46,861 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:03:46,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:03:46,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:03:46,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:03:46,862 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:03:46,862 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:03:46,862 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:03:46,909 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:03:46,911 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:46,911 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:03:46,911 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:03:46,911 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:03:46,911 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:46,912 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:03:46,912 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:03:46,912 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:46,913 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:46,947 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:03:46,948 INFO L131 PetriNetUnfolder]: For 3327/3536 co-relation queries the response was YES. [2022-12-06 00:03:46,950 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3327/3536 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2974 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:03:46,952 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:46,953 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:03:47,182 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:03:47,182 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 271 [2022-12-06 00:03:47,182 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:03:47,183 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:03:47,183 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:03:47,183 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:03:47,183 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable280 [2022-12-06 00:03:47,183 INFO L420 AbstractCegarLoop]: === Iteration 282 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:03:47,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:03:47,183 INFO L85 PathProgramCache]: Analyzing trace with hash 334842851, now seen corresponding path program 1 times [2022-12-06 00:03:47,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:03:47,183 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422404382] [2022-12-06 00:03:47,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:03:47,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:03:47,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:03:47,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-06 00:03:47,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:03:47,265 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422404382] [2022-12-06 00:03:47,265 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [422404382] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:03:47,265 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:03:47,265 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:03:47,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875116000] [2022-12-06 00:03:47,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:03:47,266 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:03:47,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:03:47,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:03:47,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:03:47,266 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:03:47,266 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:03:47,266 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:03:47,266 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:03:47,266 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:03:47,635 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:03:47,635 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:03:47,644 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13560 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:03:47,655 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:03:47,656 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:03:47,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:03:47,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:03:47,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:03:47,657 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:03:47,657 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:03:47,657 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:03:47,706 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:03:47,708 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:47,708 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:03:47,708 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:03:47,708 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:03:47,708 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:47,718 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:03:47,718 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:03:47,718 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:47,719 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:47,752 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:03:47,753 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 00:03:47,754 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3312/3520 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2993 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:03:47,758 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:47,758 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:03:47,968 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:03:47,968 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 260 [2022-12-06 00:03:47,969 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:03:47,969 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:03:47,969 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:03:47,969 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:03:47,969 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable281 [2022-12-06 00:03:47,969 INFO L420 AbstractCegarLoop]: === Iteration 283 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:03:47,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:03:47,969 INFO L85 PathProgramCache]: Analyzing trace with hash 2077653186, now seen corresponding path program 1 times [2022-12-06 00:03:47,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:03:47,969 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84884433] [2022-12-06 00:03:47,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:03:47,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:03:47,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:03:48,073 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:03:48,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:03:48,074 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84884433] [2022-12-06 00:03:48,074 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [84884433] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:03:48,074 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:03:48,074 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:03:48,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531492602] [2022-12-06 00:03:48,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:03:48,074 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:03:48,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:03:48,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:03:48,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:03:48,075 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:03:48,075 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:03:48,075 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:03:48,075 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:03:48,075 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:03:48,502 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:03:48,502 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:03:48,510 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13561 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:03:48,521 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:03:48,521 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:03:48,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:03:48,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:03:48,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:03:48,522 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:03:48,522 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:03:48,522 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:03:48,569 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:03:48,571 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:48,571 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:03:48,571 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:03:48,571 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:03:48,572 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:48,572 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:03:48,572 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:03:48,572 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:48,573 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:48,607 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:03:48,607 INFO L131 PetriNetUnfolder]: For 3310/3519 co-relation queries the response was YES. [2022-12-06 00:03:48,609 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3310/3519 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2978 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:03:48,611 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:48,612 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:03:48,813 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:03:48,814 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 243 [2022-12-06 00:03:48,814 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:03:48,814 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:03:48,814 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:03:48,814 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:03:48,814 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable282 [2022-12-06 00:03:48,815 INFO L420 AbstractCegarLoop]: === Iteration 284 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:03:48,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:03:48,815 INFO L85 PathProgramCache]: Analyzing trace with hash -474503775, now seen corresponding path program 1 times [2022-12-06 00:03:48,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:03:48,815 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306727000] [2022-12-06 00:03:48,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:03:48,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:03:48,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:03:48,890 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-06 00:03:48,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:03:48,890 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306727000] [2022-12-06 00:03:48,890 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [306727000] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:03:48,890 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:03:48,890 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:03:48,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249637656] [2022-12-06 00:03:48,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:03:48,892 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:03:48,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:03:48,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:03:48,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:03:48,893 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:03:48,893 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:03:48,893 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:03:48,893 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:03:48,894 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:03:49,273 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:03:49,273 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 00:03:49,282 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13551 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:03:49,292 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:03:49,292 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:03:49,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:03:49,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:03:49,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:03:49,293 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:03:49,293 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:03:49,293 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:03:49,339 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:03:49,356 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:49,356 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:03:49,356 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:03:49,357 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:03:49,357 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:49,357 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:03:49,357 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:03:49,357 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:49,358 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:49,424 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:03:49,425 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 00:03:49,426 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3312/3520 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2984 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:03:49,429 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:49,429 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:03:49,626 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:03:49,627 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 270 [2022-12-06 00:03:49,627 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:03:49,627 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:03:49,627 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:03:49,628 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:03:49,628 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable283 [2022-12-06 00:03:49,628 INFO L420 AbstractCegarLoop]: === Iteration 285 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:03:49,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:03:49,628 INFO L85 PathProgramCache]: Analyzing trace with hash 1268306560, now seen corresponding path program 1 times [2022-12-06 00:03:49,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:03:49,628 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097101732] [2022-12-06 00:03:49,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:03:49,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:03:49,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:03:49,704 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-06 00:03:49,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:03:49,704 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097101732] [2022-12-06 00:03:49,704 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1097101732] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:03:49,704 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:03:49,704 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:03:49,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635367674] [2022-12-06 00:03:49,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:03:49,705 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:03:49,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:03:49,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:03:49,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:03:49,705 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:03:49,705 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:03:49,705 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:03:49,705 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:03:49,705 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:03:50,086 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:03:50,086 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 00:03:50,095 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26965/27010 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13552 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:03:50,106 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:03:50,106 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:03:50,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:03:50,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:03:50,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:03:50,107 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:03:50,107 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:03:50,108 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:03:50,155 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:03:50,157 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:50,157 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:03:50,157 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:03:50,157 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:03:50,157 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:50,158 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:03:50,158 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:03:50,158 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:50,159 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:50,191 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:03:50,192 INFO L131 PetriNetUnfolder]: For 3146/3287 co-relation queries the response was YES. [2022-12-06 00:03:50,193 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3146/3287 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2995 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:03:50,196 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:50,196 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:03:50,385 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:03:50,385 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 228 [2022-12-06 00:03:50,385 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:03:50,385 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:03:50,385 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:03:50,386 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:03:50,386 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable284 [2022-12-06 00:03:50,386 INFO L420 AbstractCegarLoop]: === Iteration 286 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:03:50,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:03:50,386 INFO L85 PathProgramCache]: Analyzing trace with hash -1283850401, now seen corresponding path program 1 times [2022-12-06 00:03:50,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:03:50,386 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442206755] [2022-12-06 00:03:50,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:03:50,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:03:50,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:03:50,488 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-06 00:03:50,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:03:50,489 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442206755] [2022-12-06 00:03:50,489 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [442206755] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:03:50,489 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:03:50,489 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:03:50,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850719574] [2022-12-06 00:03:50,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:03:50,490 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:03:50,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:03:50,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:03:50,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:03:50,490 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:03:50,490 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:03:50,490 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:03:50,490 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:03:50,491 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:03:50,872 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:03:50,873 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:03:50,880 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13548 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:03:50,891 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:03:50,891 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:03:50,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:03:50,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:03:50,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:03:50,892 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:03:50,892 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:03:50,892 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:03:50,939 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:03:50,940 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:50,941 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:03:50,941 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:03:50,941 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:03:50,941 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:50,942 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:03:50,942 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:03:50,942 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:50,943 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:50,979 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:03:50,979 INFO L131 PetriNetUnfolder]: For 3298/3507 co-relation queries the response was YES. [2022-12-06 00:03:50,981 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3298/3507 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2991 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:03:50,984 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:50,984 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:03:51,180 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:03:51,180 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 239 [2022-12-06 00:03:51,180 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:03:51,180 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:03:51,181 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:03:51,181 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:03:51,181 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable285 [2022-12-06 00:03:51,181 INFO L420 AbstractCegarLoop]: === Iteration 287 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:03:51,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:03:51,181 INFO L85 PathProgramCache]: Analyzing trace with hash 458959934, now seen corresponding path program 1 times [2022-12-06 00:03:51,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:03:51,181 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747511373] [2022-12-06 00:03:51,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:03:51,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:03:51,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:03:51,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-06 00:03:51,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:03:51,250 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747511373] [2022-12-06 00:03:51,250 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1747511373] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:03:51,250 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:03:51,251 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:03:51,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948807698] [2022-12-06 00:03:51,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:03:51,251 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:03:51,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:03:51,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:03:51,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:03:51,251 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:03:51,251 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:03:51,252 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:03:51,252 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:03:51,252 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:03:51,660 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:03:51,661 INFO L131 PetriNetUnfolder]: For 26955/27000 co-relation queries the response was YES. [2022-12-06 00:03:51,669 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26955/27000 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13524 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:03:51,680 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:03:51,680 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:03:51,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:03:51,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:03:51,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:03:51,681 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:03:51,681 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:03:51,681 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:03:51,733 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:03:51,735 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:51,735 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:03:51,736 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:03:51,736 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:03:51,736 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:51,736 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:03:51,737 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:03:51,737 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:51,738 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:51,777 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:03:51,778 INFO L131 PetriNetUnfolder]: For 3122/3262 co-relation queries the response was YES. [2022-12-06 00:03:51,780 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3122/3262 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2980 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:03:51,782 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:51,782 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:03:51,992 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:03:51,992 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 256 [2022-12-06 00:03:51,992 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:03:51,993 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:03:51,993 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:03:51,993 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:03:51,993 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable286 [2022-12-06 00:03:51,993 INFO L420 AbstractCegarLoop]: === Iteration 288 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:03:51,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:03:51,993 INFO L85 PathProgramCache]: Analyzing trace with hash -2093197027, now seen corresponding path program 1 times [2022-12-06 00:03:51,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:03:51,993 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628591765] [2022-12-06 00:03:51,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:03:51,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:03:52,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:03:52,074 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-06 00:03:52,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:03:52,074 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628591765] [2022-12-06 00:03:52,075 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1628591765] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:03:52,075 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:03:52,075 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:03:52,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443159323] [2022-12-06 00:03:52,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:03:52,075 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:03:52,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:03:52,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:03:52,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:03:52,076 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:03:52,076 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:03:52,076 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:03:52,076 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:03:52,076 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:03:52,466 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:03:52,466 INFO L131 PetriNetUnfolder]: For 26955/27000 co-relation queries the response was YES. [2022-12-06 00:03:52,474 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26955/27000 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13534 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:03:52,485 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:03:52,485 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:03:52,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:03:52,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:03:52,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:03:52,486 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:03:52,486 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:03:52,486 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:03:52,589 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:03:52,590 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:52,590 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:03:52,591 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:03:52,591 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:03:52,591 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:52,591 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:03:52,591 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:03:52,592 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:52,592 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:52,627 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:03:52,627 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 00:03:52,628 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3133/3273 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2980 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:03:52,631 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:52,631 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:03:52,825 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:03:52,826 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 235 [2022-12-06 00:03:52,826 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:03:52,826 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:03:52,826 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:03:52,826 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:03:52,826 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable287 [2022-12-06 00:03:52,826 INFO L420 AbstractCegarLoop]: === Iteration 289 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:03:52,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:03:52,826 INFO L85 PathProgramCache]: Analyzing trace with hash -350386692, now seen corresponding path program 1 times [2022-12-06 00:03:52,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:03:52,827 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276924555] [2022-12-06 00:03:52,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:03:52,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:03:52,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:03:52,915 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-06 00:03:52,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:03:52,915 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276924555] [2022-12-06 00:03:52,915 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1276924555] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:03:52,915 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:03:52,916 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:03:52,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767573528] [2022-12-06 00:03:52,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:03:52,916 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:03:52,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:03:52,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:03:52,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:03:52,916 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:03:52,916 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:03:52,917 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:03:52,917 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:03:52,917 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:03:53,298 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:03:53,298 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:03:53,306 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13563 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:03:53,317 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:03:53,318 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:03:53,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:03:53,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:03:53,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:03:53,319 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:03:53,319 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:03:53,319 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:03:53,372 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:03:53,374 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:53,374 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:03:53,374 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:03:53,374 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:03:53,374 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:53,375 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:03:53,375 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:03:53,375 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:53,376 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:53,411 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:03:53,411 INFO L131 PetriNetUnfolder]: For 3337/3547 co-relation queries the response was YES. [2022-12-06 00:03:53,412 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3337/3547 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2977 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:03:53,415 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:53,415 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:03:53,598 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:03:53,599 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 225 [2022-12-06 00:03:53,599 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:03:53,599 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:03:53,599 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:03:53,599 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:03:53,599 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable288 [2022-12-06 00:03:53,600 INFO L420 AbstractCegarLoop]: === Iteration 290 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:03:53,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:03:53,600 INFO L85 PathProgramCache]: Analyzing trace with hash 1392423643, now seen corresponding path program 1 times [2022-12-06 00:03:53,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:03:53,600 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204007982] [2022-12-06 00:03:53,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:03:53,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:03:53,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:03:53,685 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:03:53,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:03:53,685 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204007982] [2022-12-06 00:03:53,685 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [204007982] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:03:53,685 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:03:53,685 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:03:53,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877169524] [2022-12-06 00:03:53,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:03:53,686 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:03:53,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:03:53,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:03:53,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:03:53,686 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:03:53,687 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:03:53,687 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:03:53,687 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:03:53,687 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:03:54,059 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:03:54,060 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 00:03:54,068 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13553 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:03:54,078 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:03:54,079 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:03:54,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:03:54,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:03:54,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:03:54,080 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:03:54,080 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:03:54,080 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:03:54,130 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:03:54,132 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:54,132 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:03:54,132 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:03:54,132 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:03:54,132 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:54,133 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:03:54,133 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:03:54,133 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:54,134 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:54,168 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:03:54,168 INFO L131 PetriNetUnfolder]: For 3304/3511 co-relation queries the response was YES. [2022-12-06 00:03:54,169 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3304/3511 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2998 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:03:54,172 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:54,172 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:03:54,394 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:03:54,395 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 263 [2022-12-06 00:03:54,395 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:03:54,395 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:03:54,395 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:03:54,395 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:03:54,395 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable289 [2022-12-06 00:03:54,395 INFO L420 AbstractCegarLoop]: === Iteration 291 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:03:54,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:03:54,396 INFO L85 PathProgramCache]: Analyzing trace with hash -1159733318, now seen corresponding path program 1 times [2022-12-06 00:03:54,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:03:54,396 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639496647] [2022-12-06 00:03:54,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:03:54,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:03:54,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:03:54,469 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-06 00:03:54,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:03:54,469 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639496647] [2022-12-06 00:03:54,469 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [639496647] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:03:54,469 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:03:54,469 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:03:54,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317213625] [2022-12-06 00:03:54,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:03:54,470 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:03:54,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:03:54,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:03:54,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:03:54,470 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:03:54,470 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:03:54,470 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:03:54,470 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:03:54,470 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:03:54,866 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:03:54,866 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 00:03:54,874 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26969/27014 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13559 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:03:54,885 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:03:54,885 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:03:54,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:03:54,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:03:54,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:03:54,886 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:03:54,886 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:03:54,886 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:03:54,932 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:03:54,933 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:54,934 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:03:54,934 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:03:54,934 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:03:54,934 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:54,935 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:03:54,935 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:03:54,935 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:54,935 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:54,968 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:03:54,968 INFO L131 PetriNetUnfolder]: For 3123/3264 co-relation queries the response was YES. [2022-12-06 00:03:54,969 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3123/3264 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2981 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:03:54,972 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:54,972 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:03:55,151 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:03:55,152 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 218 [2022-12-06 00:03:55,152 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:03:55,152 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:03:55,152 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:03:55,152 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:03:55,152 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable290 [2022-12-06 00:03:55,152 INFO L420 AbstractCegarLoop]: === Iteration 292 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:03:55,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:03:55,153 INFO L85 PathProgramCache]: Analyzing trace with hash 583077017, now seen corresponding path program 1 times [2022-12-06 00:03:55,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:03:55,153 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345196803] [2022-12-06 00:03:55,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:03:55,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:03:55,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:03:55,224 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-06 00:03:55,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:03:55,224 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345196803] [2022-12-06 00:03:55,224 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1345196803] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:03:55,224 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:03:55,224 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:03:55,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340728840] [2022-12-06 00:03:55,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:03:55,225 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:03:55,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:03:55,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:03:55,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:03:55,225 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:03:55,225 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:03:55,225 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:03:55,225 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:03:55,225 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:03:55,591 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:03:55,591 INFO L131 PetriNetUnfolder]: For 27136/27181 co-relation queries the response was YES. [2022-12-06 00:03:55,601 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27136/27181 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13522 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:03:55,612 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:03:55,612 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:03:55,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:03:55,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:03:55,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:03:55,613 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:03:55,613 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:03:55,613 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:03:55,665 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:03:55,667 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:55,667 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:03:55,669 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:03:55,669 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:03:55,669 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:55,670 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:03:55,670 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:03:55,670 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:55,671 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:55,704 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:03:55,704 INFO L131 PetriNetUnfolder]: For 3167/3307 co-relation queries the response was YES. [2022-12-06 00:03:55,706 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3167/3307 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 3003 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:03:55,708 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:55,708 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:03:55,889 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:03:55,889 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 220 [2022-12-06 00:03:55,889 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:03:55,889 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:03:55,890 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:03:55,890 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:03:55,890 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable291 [2022-12-06 00:03:55,890 INFO L420 AbstractCegarLoop]: === Iteration 293 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:03:55,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:03:55,890 INFO L85 PathProgramCache]: Analyzing trace with hash -1969079944, now seen corresponding path program 1 times [2022-12-06 00:03:55,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:03:55,890 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399173517] [2022-12-06 00:03:55,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:03:55,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:03:55,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:03:55,965 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-06 00:03:55,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:03:55,965 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399173517] [2022-12-06 00:03:55,965 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [399173517] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:03:55,965 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:03:55,966 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:03:55,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836049428] [2022-12-06 00:03:55,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:03:55,966 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:03:55,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:03:55,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:03:55,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:03:55,966 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:03:55,966 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:03:55,967 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:03:55,967 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:03:55,967 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:03:56,340 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:03:56,340 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 00:03:56,349 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26965/27010 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13516 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:03:56,359 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:03:56,359 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:03:56,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:03:56,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:03:56,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:03:56,360 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:03:56,360 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:03:56,360 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:03:56,408 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:03:56,409 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:56,410 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:03:56,410 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:03:56,411 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:03:56,411 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:56,411 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:03:56,411 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:03:56,411 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:56,412 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:56,445 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:03:56,445 INFO L131 PetriNetUnfolder]: For 3146/3287 co-relation queries the response was YES. [2022-12-06 00:03:56,447 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3146/3287 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2978 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:03:56,450 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:56,450 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:03:56,620 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:03:56,620 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 209 [2022-12-06 00:03:56,620 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:03:56,620 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:03:56,621 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:03:56,621 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:03:56,621 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable292 [2022-12-06 00:03:56,621 INFO L420 AbstractCegarLoop]: === Iteration 294 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:03:56,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:03:56,621 INFO L85 PathProgramCache]: Analyzing trace with hash -226269609, now seen corresponding path program 1 times [2022-12-06 00:03:56,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:03:56,621 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243994484] [2022-12-06 00:03:56,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:03:56,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:03:56,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:03:56,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-06 00:03:56,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:03:56,707 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243994484] [2022-12-06 00:03:56,707 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1243994484] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:03:56,707 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:03:56,707 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:03:56,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541803934] [2022-12-06 00:03:56,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:03:56,707 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:03:56,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:03:56,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:03:56,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:03:56,708 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:03:56,708 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:03:56,708 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:03:56,708 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:03:56,708 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:03:57,068 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:03:57,069 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 00:03:57,076 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26969/27014 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13527 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:03:57,085 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:03:57,085 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:03:57,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:03:57,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:03:57,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:03:57,086 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:03:57,086 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:03:57,086 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:03:57,136 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:03:57,138 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:57,138 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:03:57,138 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:03:57,138 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:03:57,138 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:57,139 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:03:57,139 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:03:57,139 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:57,140 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:57,172 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:03:57,173 INFO L131 PetriNetUnfolder]: For 3122/3262 co-relation queries the response was YES. [2022-12-06 00:03:57,174 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3122/3262 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2986 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:03:57,176 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:57,176 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:03:57,362 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:03:57,362 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 224 [2022-12-06 00:03:57,362 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:03:57,362 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:03:57,362 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:03:57,363 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:03:57,363 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable293 [2022-12-06 00:03:57,363 INFO L420 AbstractCegarLoop]: === Iteration 295 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:03:57,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:03:57,363 INFO L85 PathProgramCache]: Analyzing trace with hash 1516540726, now seen corresponding path program 1 times [2022-12-06 00:03:57,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:03:57,363 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123504253] [2022-12-06 00:03:57,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:03:57,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:03:57,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:03:57,454 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:03:57,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:03:57,454 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123504253] [2022-12-06 00:03:57,454 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2123504253] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:03:57,454 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:03:57,454 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:03:57,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67803302] [2022-12-06 00:03:57,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:03:57,455 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:03:57,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:03:57,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:03:57,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:03:57,455 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:03:57,456 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:03:57,456 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:03:57,456 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:03:57,456 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:03:57,826 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:03:57,826 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 00:03:57,833 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13556 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:03:57,843 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:03:57,843 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:03:57,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:03:57,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:03:57,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:03:57,844 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:03:57,844 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:03:57,844 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:03:57,893 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:03:57,894 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:57,894 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:03:57,894 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:03:57,894 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:03:57,895 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:57,895 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:03:57,895 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:03:57,895 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:57,896 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:57,929 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:03:57,930 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 00:03:57,931 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3312/3520 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2994 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:03:57,934 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:57,934 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:03:58,138 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:03:58,139 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 245 [2022-12-06 00:03:58,139 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:03:58,139 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:03:58,139 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:03:58,139 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:03:58,139 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable294 [2022-12-06 00:03:58,139 INFO L420 AbstractCegarLoop]: === Iteration 296 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:03:58,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:03:58,140 INFO L85 PathProgramCache]: Analyzing trace with hash -1035616235, now seen corresponding path program 1 times [2022-12-06 00:03:58,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:03:58,140 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266901599] [2022-12-06 00:03:58,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:03:58,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:03:58,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:03:58,211 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-06 00:03:58,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:03:58,212 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266901599] [2022-12-06 00:03:58,212 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1266901599] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:03:58,212 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:03:58,212 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:03:58,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840788441] [2022-12-06 00:03:58,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:03:58,212 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:03:58,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:03:58,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:03:58,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:03:58,213 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:03:58,213 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:03:58,213 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:03:58,213 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:03:58,213 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:03:58,643 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:03:58,644 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 00:03:58,650 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26965/27010 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13488 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:03:58,660 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:03:58,661 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:03:58,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:03:58,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:03:58,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:03:58,661 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:03:58,662 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:03:58,662 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:03:58,705 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:03:58,707 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:58,707 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:03:58,707 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:03:58,707 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:03:58,707 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:58,708 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:03:58,708 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:03:58,708 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:58,709 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:58,742 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:03:58,742 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 00:03:58,743 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3133/3273 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2959 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:03:58,746 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:58,746 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:03:58,915 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:03:58,916 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 209 [2022-12-06 00:03:58,916 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:03:58,916 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:03:58,916 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:03:58,916 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:03:58,916 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable295 [2022-12-06 00:03:58,917 INFO L420 AbstractCegarLoop]: === Iteration 297 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:03:58,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:03:58,917 INFO L85 PathProgramCache]: Analyzing trace with hash 707194100, now seen corresponding path program 1 times [2022-12-06 00:03:58,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:03:58,917 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549204923] [2022-12-06 00:03:58,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:03:58,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:03:58,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:03:58,999 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-06 00:03:58,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:03:59,000 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549204923] [2022-12-06 00:03:59,000 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [549204923] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:03:59,000 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:03:59,000 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:03:59,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305503139] [2022-12-06 00:03:59,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:03:59,000 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:03:59,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:03:59,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:03:59,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:03:59,001 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:03:59,001 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:03:59,001 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:03:59,001 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:03:59,001 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:03:59,353 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:03:59,353 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:03:59,360 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13553 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:03:59,370 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:03:59,370 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:03:59,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:03:59,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:03:59,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:03:59,371 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:03:59,371 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:03:59,371 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:03:59,415 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:03:59,417 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:59,417 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:03:59,417 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:03:59,417 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:03:59,417 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:59,418 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:03:59,418 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:03:59,418 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:59,419 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:59,451 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:03:59,452 INFO L131 PetriNetUnfolder]: For 3348/3558 co-relation queries the response was YES. [2022-12-06 00:03:59,453 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3348/3558 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2976 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:03:59,456 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:03:59,456 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:03:59,646 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:03:59,647 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 230 [2022-12-06 00:03:59,647 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:03:59,647 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:03:59,647 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:03:59,647 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:03:59,647 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable296 [2022-12-06 00:03:59,647 INFO L420 AbstractCegarLoop]: === Iteration 298 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:03:59,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:03:59,648 INFO L85 PathProgramCache]: Analyzing trace with hash -1844962861, now seen corresponding path program 1 times [2022-12-06 00:03:59,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:03:59,648 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775037304] [2022-12-06 00:03:59,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:03:59,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:03:59,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:03:59,731 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-06 00:03:59,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:03:59,734 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775037304] [2022-12-06 00:03:59,734 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1775037304] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:03:59,734 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:03:59,734 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:03:59,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861809072] [2022-12-06 00:03:59,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:03:59,734 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:03:59,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:03:59,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:03:59,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:03:59,735 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:03:59,735 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:03:59,735 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:03:59,735 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:03:59,735 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:04:00,090 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:04:00,090 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:04:00,098 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13574 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:04:00,108 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:04:00,108 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:04:00,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:04:00,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:04:00,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:04:00,109 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:04:00,109 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:04:00,109 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:04:00,161 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:04:00,163 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:00,163 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:04:00,163 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:04:00,163 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:04:00,163 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:00,164 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:04:00,164 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:04:00,164 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:00,165 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:00,197 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:04:00,197 INFO L131 PetriNetUnfolder]: For 3309/3518 co-relation queries the response was YES. [2022-12-06 00:04:00,198 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3309/3518 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2977 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:04:00,201 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:00,201 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:04:00,380 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:04:00,381 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 218 [2022-12-06 00:04:00,381 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:04:00,381 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:04:00,381 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:04:00,381 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:04:00,381 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable297 [2022-12-06 00:04:00,381 INFO L420 AbstractCegarLoop]: === Iteration 299 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:04:00,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:04:00,382 INFO L85 PathProgramCache]: Analyzing trace with hash -102152526, now seen corresponding path program 1 times [2022-12-06 00:04:00,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:04:00,382 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806249128] [2022-12-06 00:04:00,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:04:00,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:04:00,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:04:00,455 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-06 00:04:00,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:04:00,455 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806249128] [2022-12-06 00:04:00,455 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [806249128] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:04:00,456 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:04:00,456 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:04:00,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4526272] [2022-12-06 00:04:00,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:04:00,456 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:04:00,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:04:00,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:04:00,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:04:00,456 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:04:00,457 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:04:00,457 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:04:00,457 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:04:00,457 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:04:00,826 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:04:00,827 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 00:04:00,834 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26969/27014 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13514 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:04:00,844 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:04:00,844 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:04:00,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:04:00,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:04:00,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:04:00,845 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:04:00,845 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:04:00,845 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:04:00,893 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:04:00,894 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:00,894 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:04:00,895 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:04:00,895 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:04:00,895 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:00,895 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:04:00,895 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:04:00,896 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:00,896 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:00,928 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:04:00,929 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 00:04:00,930 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3133/3273 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 3001 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:04:00,933 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:00,933 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:04:01,130 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:04:01,131 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 236 [2022-12-06 00:04:01,131 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:04:01,131 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:04:01,131 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:04:01,131 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:04:01,131 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable298 [2022-12-06 00:04:01,131 INFO L420 AbstractCegarLoop]: === Iteration 300 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:04:01,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:04:01,132 INFO L85 PathProgramCache]: Analyzing trace with hash 1640657809, now seen corresponding path program 1 times [2022-12-06 00:04:01,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:04:01,132 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857213106] [2022-12-06 00:04:01,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:04:01,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:04:01,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:04:01,201 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-06 00:04:01,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:04:01,201 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857213106] [2022-12-06 00:04:01,201 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [857213106] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:04:01,201 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:04:01,201 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:04:01,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439167912] [2022-12-06 00:04:01,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:04:01,202 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:04:01,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:04:01,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:04:01,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:04:01,202 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:04:01,202 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:04:01,202 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:04:01,202 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:04:01,202 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:04:01,579 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:04:01,579 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 00:04:01,587 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26965/27010 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13542 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:04:01,598 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:04:01,598 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:04:01,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:04:01,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:04:01,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:04:01,599 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:04:01,599 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:04:01,599 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:04:01,651 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:04:01,652 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:01,652 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:04:01,653 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:04:01,653 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:04:01,653 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:01,654 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:04:01,654 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:04:01,654 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:01,655 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:01,688 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:04:01,688 INFO L131 PetriNetUnfolder]: For 3134/3275 co-relation queries the response was YES. [2022-12-06 00:04:01,690 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3134/3275 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2974 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:04:01,693 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:01,693 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:04:01,929 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:04:01,930 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 277 [2022-12-06 00:04:01,930 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:04:01,930 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:04:01,930 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:04:01,930 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:04:01,930 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable299 [2022-12-06 00:04:01,930 INFO L420 AbstractCegarLoop]: === Iteration 301 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:04:01,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:04:01,931 INFO L85 PathProgramCache]: Analyzing trace with hash -911499152, now seen corresponding path program 1 times [2022-12-06 00:04:01,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:04:01,931 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029935263] [2022-12-06 00:04:01,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:04:01,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:04:01,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:04:02,003 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-06 00:04:02,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:04:02,004 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029935263] [2022-12-06 00:04:02,004 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1029935263] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:04:02,004 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:04:02,004 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:04:02,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640858360] [2022-12-06 00:04:02,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:04:02,004 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:04:02,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:04:02,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:04:02,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:04:02,005 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:04:02,005 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:04:02,005 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:04:02,005 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:04:02,005 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:04:02,361 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:04:02,361 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:04:02,368 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13568 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:04:02,378 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:04:02,378 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:04:02,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:04:02,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:04:02,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:04:02,379 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:04:02,379 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:04:02,379 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:04:02,424 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:04:02,426 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:02,426 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:04:02,427 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:04:02,427 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:04:02,427 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:02,427 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:04:02,427 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:04:02,428 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:02,428 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:02,460 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:04:02,461 INFO L131 PetriNetUnfolder]: For 3338/3547 co-relation queries the response was YES. [2022-12-06 00:04:02,462 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3338/3547 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2974 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:04:02,483 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:02,483 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:04:02,763 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:04:02,763 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 336 [2022-12-06 00:04:02,763 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:04:02,763 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:04:02,764 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:04:02,764 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:04:02,764 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable300 [2022-12-06 00:04:02,764 INFO L420 AbstractCegarLoop]: === Iteration 302 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:04:02,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:04:02,764 INFO L85 PathProgramCache]: Analyzing trace with hash 831311183, now seen corresponding path program 1 times [2022-12-06 00:04:02,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:04:02,764 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813958928] [2022-12-06 00:04:02,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:04:02,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:04:02,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:04:02,868 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-06 00:04:02,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:04:02,869 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813958928] [2022-12-06 00:04:02,869 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [813958928] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:04:02,869 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:04:02,869 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:04:02,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92721940] [2022-12-06 00:04:02,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:04:02,869 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:04:02,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:04:02,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:04:02,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:04:02,870 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:04:02,870 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:04:02,870 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:04:02,870 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:04:02,870 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:04:03,232 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:04:03,232 INFO L131 PetriNetUnfolder]: For 27229/27274 co-relation queries the response was YES. [2022-12-06 00:04:03,240 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27229/27274 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13546 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:04:03,250 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:04:03,250 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:04:03,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:04:03,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:04:03,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:04:03,251 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:04:03,251 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:04:03,251 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:04:03,303 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:04:03,304 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:03,304 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:04:03,304 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:04:03,305 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:04:03,305 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:03,305 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:04:03,305 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:04:03,305 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:03,306 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:03,338 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:04:03,339 INFO L131 PetriNetUnfolder]: For 3293/3500 co-relation queries the response was YES. [2022-12-06 00:04:03,340 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3293/3500 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2994 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:04:03,343 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:03,343 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:04:03,523 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:04:03,523 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 218 [2022-12-06 00:04:03,524 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:04:03,524 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:04:03,524 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:04:03,524 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:04:03,524 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable301 [2022-12-06 00:04:03,524 INFO L420 AbstractCegarLoop]: === Iteration 303 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:04:03,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:04:03,524 INFO L85 PathProgramCache]: Analyzing trace with hash -1720845778, now seen corresponding path program 1 times [2022-12-06 00:04:03,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:04:03,524 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623339748] [2022-12-06 00:04:03,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:04:03,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:04:03,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:04:03,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:04:03,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:04:03,663 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623339748] [2022-12-06 00:04:03,663 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1623339748] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:04:03,663 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:04:03,663 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:04:03,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511949741] [2022-12-06 00:04:03,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:04:03,664 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:04:03,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:04:03,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:04:03,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:04:03,664 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:04:03,664 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:04:03,664 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:04:03,664 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:04:03,664 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:04:04,053 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:04:04,054 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 00:04:04,061 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13577 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:04:04,069 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:04:04,070 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:04:04,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:04:04,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:04:04,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:04:04,070 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:04:04,071 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:04:04,071 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:04:04,118 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:04:04,119 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:04,119 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:04:04,120 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:04:04,120 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:04:04,120 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:04,120 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:04:04,120 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:04:04,121 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:04,121 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:04,153 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:04:04,153 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 00:04:04,155 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3312/3520 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 3003 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:04:04,157 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:04,157 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:04:04,347 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:04:04,348 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 228 [2022-12-06 00:04:04,348 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:04:04,348 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:04:04,348 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:04:04,348 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:04:04,348 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable302 [2022-12-06 00:04:04,348 INFO L420 AbstractCegarLoop]: === Iteration 304 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:04:04,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:04:04,348 INFO L85 PathProgramCache]: Analyzing trace with hash 21964557, now seen corresponding path program 1 times [2022-12-06 00:04:04,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:04:04,349 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912545189] [2022-12-06 00:04:04,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:04:04,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:04:04,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:04:04,420 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-06 00:04:04,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:04:04,421 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912545189] [2022-12-06 00:04:04,421 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [912545189] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:04:04,421 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:04:04,421 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:04:04,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017884952] [2022-12-06 00:04:04,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:04:04,421 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:04:04,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:04:04,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:04:04,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:04:04,422 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:04:04,422 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:04:04,422 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:04:04,422 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:04:04,422 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:04:04,806 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:04:04,806 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:04:04,813 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13557 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:04:04,821 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:04:04,821 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:04:04,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:04:04,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:04:04,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:04:04,822 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:04:04,822 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:04:04,822 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:04:04,865 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:04:04,866 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:04,867 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:04:04,867 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:04:04,867 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:04:04,867 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:04,868 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:04:04,868 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:04:04,868 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:04,868 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:04,900 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:04:04,900 INFO L131 PetriNetUnfolder]: For 3318/3528 co-relation queries the response was YES. [2022-12-06 00:04:04,901 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3318/3528 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2993 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:04:04,904 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:04,904 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:04:05,093 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:04:05,094 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 227 [2022-12-06 00:04:05,094 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:04:05,094 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:04:05,094 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:04:05,094 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:04:05,095 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable303 [2022-12-06 00:04:05,095 INFO L420 AbstractCegarLoop]: === Iteration 305 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:04:05,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:04:05,095 INFO L85 PathProgramCache]: Analyzing trace with hash 1764774892, now seen corresponding path program 1 times [2022-12-06 00:04:05,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:04:05,095 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230753487] [2022-12-06 00:04:05,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:04:05,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:04:05,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:04:05,181 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-06 00:04:05,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:04:05,181 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230753487] [2022-12-06 00:04:05,181 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230753487] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:04:05,181 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:04:05,181 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:04:05,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947807344] [2022-12-06 00:04:05,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:04:05,182 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:04:05,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:04:05,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:04:05,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:04:05,182 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:04:05,182 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:04:05,182 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:04:05,182 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:04:05,182 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:04:05,544 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:04:05,544 INFO L131 PetriNetUnfolder]: For 27229/27274 co-relation queries the response was YES. [2022-12-06 00:04:05,551 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27229/27274 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13570 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:04:05,561 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:04:05,562 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:04:05,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:04:05,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:04:05,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:04:05,562 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:04:05,563 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:04:05,563 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:04:05,610 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:04:05,612 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:05,612 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:04:05,612 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:04:05,612 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:04:05,612 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:05,613 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:04:05,613 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:04:05,613 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:05,614 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:05,646 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:04:05,647 INFO L131 PetriNetUnfolder]: For 3339/3551 co-relation queries the response was YES. [2022-12-06 00:04:05,648 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3339/3551 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2986 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:04:05,651 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:05,651 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:04:05,840 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:04:05,841 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 229 [2022-12-06 00:04:05,841 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:04:05,841 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:04:05,841 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:04:05,841 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:04:05,841 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable304 [2022-12-06 00:04:05,842 INFO L420 AbstractCegarLoop]: === Iteration 306 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:04:05,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:04:05,842 INFO L85 PathProgramCache]: Analyzing trace with hash -787382069, now seen corresponding path program 1 times [2022-12-06 00:04:05,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:04:05,842 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562734085] [2022-12-06 00:04:05,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:04:05,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:04:05,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:04:05,914 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-06 00:04:05,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:04:05,914 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562734085] [2022-12-06 00:04:05,914 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1562734085] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:04:05,914 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:04:05,914 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:04:05,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941623138] [2022-12-06 00:04:05,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:04:05,915 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:04:05,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:04:05,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:04:05,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:04:05,915 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:04:05,915 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:04:05,915 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:04:05,916 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:04:05,916 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:04:06,272 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:04:06,273 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 00:04:06,280 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26969/27014 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13520 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:04:06,290 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:04:06,290 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:04:06,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:04:06,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:04:06,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:04:06,291 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:04:06,291 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:04:06,291 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:04:06,335 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:04:06,356 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:06,356 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:04:06,356 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:04:06,356 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:04:06,356 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:06,357 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:04:06,357 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:04:06,357 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:06,358 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:06,391 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:04:06,391 INFO L131 PetriNetUnfolder]: For 3122/3262 co-relation queries the response was YES. [2022-12-06 00:04:06,392 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3122/3262 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2985 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:04:06,395 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:06,395 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:04:06,578 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:04:06,578 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 222 [2022-12-06 00:04:06,578 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:04:06,578 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:04:06,578 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:04:06,579 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:04:06,579 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable305 [2022-12-06 00:04:06,579 INFO L420 AbstractCegarLoop]: === Iteration 307 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:04:06,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:04:06,579 INFO L85 PathProgramCache]: Analyzing trace with hash 955428266, now seen corresponding path program 1 times [2022-12-06 00:04:06,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:04:06,579 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715597388] [2022-12-06 00:04:06,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:04:06,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:04:06,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:04:06,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-06 00:04:06,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:04:06,706 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715597388] [2022-12-06 00:04:06,706 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [715597388] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:04:06,706 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:04:06,706 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:04:06,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855958644] [2022-12-06 00:04:06,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:04:06,707 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:04:06,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:04:06,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:04:06,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:04:06,707 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:04:06,707 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:04:06,707 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:04:06,708 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:04:06,708 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:04:07,081 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:04:07,081 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 00:04:07,089 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13574 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:04:07,099 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:04:07,100 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:04:07,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:04:07,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:04:07,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:04:07,100 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:04:07,100 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:04:07,101 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:04:07,148 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:04:07,150 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:07,150 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:04:07,150 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:04:07,150 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:04:07,150 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:07,151 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:04:07,151 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:04:07,151 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:07,152 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:07,182 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:04:07,182 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 00:04:07,183 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3321/3530 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2974 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:04:07,186 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:07,186 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:04:07,377 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:04:07,377 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 227 [2022-12-06 00:04:07,377 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:04:07,378 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:04:07,378 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:04:07,378 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:04:07,378 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable306 [2022-12-06 00:04:07,378 INFO L420 AbstractCegarLoop]: === Iteration 308 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:04:07,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:04:07,378 INFO L85 PathProgramCache]: Analyzing trace with hash -1596728695, now seen corresponding path program 1 times [2022-12-06 00:04:07,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:04:07,378 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457768498] [2022-12-06 00:04:07,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:04:07,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:04:07,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:04:07,445 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-06 00:04:07,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:04:07,445 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457768498] [2022-12-06 00:04:07,445 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [457768498] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:04:07,445 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:04:07,445 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:04:07,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803935508] [2022-12-06 00:04:07,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:04:07,445 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:04:07,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:04:07,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:04:07,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:04:07,446 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:04:07,446 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:04:07,446 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:04:07,446 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:04:07,446 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:04:07,792 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:04:07,792 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 00:04:07,798 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26969/27014 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13535 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:04:07,806 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:04:07,807 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:04:07,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:04:07,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:04:07,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:04:07,807 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:04:07,808 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:04:07,808 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:04:07,849 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:04:07,851 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:07,851 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:04:07,851 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:04:07,851 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:04:07,851 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:07,852 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:04:07,852 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:04:07,852 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:07,853 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:07,878 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:04:07,878 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 00:04:07,879 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3133/3273 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2978 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:04:07,881 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:07,881 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:04:08,045 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:04:08,045 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 194 [2022-12-06 00:04:08,045 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:04:08,045 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:04:08,045 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:04:08,045 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:04:08,045 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable307 [2022-12-06 00:04:08,045 INFO L420 AbstractCegarLoop]: === Iteration 309 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:04:08,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:04:08,046 INFO L85 PathProgramCache]: Analyzing trace with hash 146081640, now seen corresponding path program 1 times [2022-12-06 00:04:08,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:04:08,046 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818375585] [2022-12-06 00:04:08,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:04:08,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:04:08,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:04:08,105 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-06 00:04:08,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:04:08,105 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818375585] [2022-12-06 00:04:08,105 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [818375585] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:04:08,105 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:04:08,105 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:04:08,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551386227] [2022-12-06 00:04:08,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:04:08,105 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:04:08,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:04:08,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:04:08,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:04:08,106 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:04:08,106 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:04:08,106 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:04:08,106 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:04:08,106 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:04:08,408 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:04:08,408 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:04:08,416 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13577 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:04:08,485 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:04:08,485 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:04:08,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:04:08,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:04:08,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:04:08,486 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:04:08,486 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:04:08,486 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:04:08,529 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:04:08,530 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:08,530 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:04:08,531 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:04:08,531 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:04:08,531 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:08,531 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:04:08,531 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:04:08,531 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:08,532 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:08,557 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:04:08,558 INFO L131 PetriNetUnfolder]: For 3338/3547 co-relation queries the response was YES. [2022-12-06 00:04:08,559 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3338/3547 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2981 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:04:08,561 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:08,561 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:04:08,710 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:04:08,710 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 179 [2022-12-06 00:04:08,710 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:04:08,711 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:04:08,711 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:04:08,711 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:04:08,711 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable308 [2022-12-06 00:04:08,711 INFO L420 AbstractCegarLoop]: === Iteration 310 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:04:08,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:04:08,711 INFO L85 PathProgramCache]: Analyzing trace with hash 1888891975, now seen corresponding path program 1 times [2022-12-06 00:04:08,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:04:08,711 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866537317] [2022-12-06 00:04:08,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:04:08,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:04:08,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:04:08,773 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-06 00:04:08,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:04:08,773 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866537317] [2022-12-06 00:04:08,773 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1866537317] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:04:08,773 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:04:08,773 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:04:08,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539925749] [2022-12-06 00:04:08,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:04:08,773 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:04:08,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:04:08,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:04:08,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:04:08,774 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:04:08,774 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:04:08,774 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:04:08,774 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:04:08,774 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:04:09,095 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:04:09,096 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 00:04:09,104 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26969/27014 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13525 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:04:09,114 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:04:09,114 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:04:09,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:04:09,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:04:09,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:04:09,115 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:04:09,115 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:04:09,115 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:04:09,164 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:04:09,166 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:09,166 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:04:09,166 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:04:09,166 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:04:09,166 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:09,167 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:04:09,167 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:04:09,167 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:09,168 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:09,202 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:04:09,202 INFO L131 PetriNetUnfolder]: For 3122/3262 co-relation queries the response was YES. [2022-12-06 00:04:09,203 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3122/3262 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2970 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:04:09,206 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:09,206 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:04:09,419 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:04:09,420 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 254 [2022-12-06 00:04:09,420 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:04:09,420 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:04:09,420 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:04:09,420 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:04:09,420 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable309 [2022-12-06 00:04:09,420 INFO L420 AbstractCegarLoop]: === Iteration 311 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:04:09,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:04:09,420 INFO L85 PathProgramCache]: Analyzing trace with hash -663264986, now seen corresponding path program 1 times [2022-12-06 00:04:09,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:04:09,420 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941601818] [2022-12-06 00:04:09,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:04:09,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:04:09,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:04:09,497 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-06 00:04:09,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:04:09,498 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941601818] [2022-12-06 00:04:09,498 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1941601818] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:04:09,498 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:04:09,498 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:04:09,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514299] [2022-12-06 00:04:09,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:04:09,498 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:04:09,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:04:09,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:04:09,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:04:09,499 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:04:09,499 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:04:09,499 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:04:09,499 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:04:09,499 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:04:09,822 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:04:09,822 INFO L131 PetriNetUnfolder]: For 27136/27181 co-relation queries the response was YES. [2022-12-06 00:04:09,829 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27136/27181 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13528 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:04:09,839 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:04:09,839 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:04:09,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:04:09,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:04:09,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:04:09,840 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:04:09,840 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:04:09,840 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:04:09,874 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:04:09,875 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:09,876 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:04:09,876 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:04:09,876 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:04:09,876 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:09,876 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:04:09,876 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:04:09,877 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:09,877 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:09,901 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:04:09,901 INFO L131 PetriNetUnfolder]: For 3157/3298 co-relation queries the response was YES. [2022-12-06 00:04:09,902 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3157/3298 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 3008 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:04:09,904 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:09,904 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:04:10,087 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:04:10,088 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 212 [2022-12-06 00:04:10,088 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:04:10,088 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:04:10,088 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:04:10,088 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:04:10,088 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable310 [2022-12-06 00:04:10,088 INFO L420 AbstractCegarLoop]: === Iteration 312 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:04:10,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:04:10,089 INFO L85 PathProgramCache]: Analyzing trace with hash 1079545349, now seen corresponding path program 1 times [2022-12-06 00:04:10,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:04:10,089 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981181880] [2022-12-06 00:04:10,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:04:10,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:04:10,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:04:10,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-06 00:04:10,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:04:10,161 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981181880] [2022-12-06 00:04:10,161 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [981181880] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:04:10,162 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:04:10,162 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:04:10,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561687343] [2022-12-06 00:04:10,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:04:10,162 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:04:10,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:04:10,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:04:10,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:04:10,162 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:04:10,162 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:04:10,162 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:04:10,162 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:04:10,162 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:04:10,514 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:04:10,514 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:04:10,521 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13565 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:04:10,528 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:04:10,528 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:04:10,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:04:10,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:04:10,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:04:10,529 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:04:10,529 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:04:10,529 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:04:10,572 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:04:10,574 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:10,574 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:04:10,574 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:04:10,574 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:04:10,574 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:10,575 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:04:10,575 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:04:10,575 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:10,576 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:10,604 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:04:10,605 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 00:04:10,606 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3321/3530 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2972 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:04:10,608 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:10,608 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:04:10,772 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:04:10,772 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 198 [2022-12-06 00:04:10,772 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:04:10,772 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:04:10,772 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:04:10,772 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:04:10,772 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable311 [2022-12-06 00:04:10,773 INFO L420 AbstractCegarLoop]: === Iteration 313 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:04:10,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:04:10,773 INFO L85 PathProgramCache]: Analyzing trace with hash -1472611612, now seen corresponding path program 1 times [2022-12-06 00:04:10,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:04:10,773 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829080699] [2022-12-06 00:04:10,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:04:10,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:04:10,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:04:10,832 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-06 00:04:10,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:04:10,833 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829080699] [2022-12-06 00:04:10,833 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1829080699] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:04:10,833 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:04:10,833 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:04:10,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771649231] [2022-12-06 00:04:10,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:04:10,833 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:04:10,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:04:10,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:04:10,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:04:10,833 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:04:10,833 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:04:10,834 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:04:10,834 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:04:10,834 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:04:11,135 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:04:11,135 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:04:11,141 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13559 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:04:11,148 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:04:11,149 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:04:11,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:04:11,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:04:11,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:04:11,149 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:04:11,150 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:04:11,150 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:04:11,185 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:04:11,187 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:11,187 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:04:11,187 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:04:11,187 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:04:11,187 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:11,187 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:04:11,187 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:04:11,188 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:11,188 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:11,214 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:04:11,214 INFO L131 PetriNetUnfolder]: For 3348/3558 co-relation queries the response was YES. [2022-12-06 00:04:11,215 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3348/3558 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2960 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:04:11,217 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:11,217 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:04:11,366 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:04:11,367 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 180 [2022-12-06 00:04:11,367 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:04:11,367 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:04:11,367 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:04:11,367 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:04:11,367 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable312 [2022-12-06 00:04:11,367 INFO L420 AbstractCegarLoop]: === Iteration 314 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:04:11,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:04:11,367 INFO L85 PathProgramCache]: Analyzing trace with hash 270198723, now seen corresponding path program 1 times [2022-12-06 00:04:11,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:04:11,367 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812723486] [2022-12-06 00:04:11,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:04:11,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:04:11,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:04:11,425 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-06 00:04:11,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:04:11,425 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812723486] [2022-12-06 00:04:11,426 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1812723486] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:04:11,426 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:04:11,426 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:04:11,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230399941] [2022-12-06 00:04:11,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:04:11,426 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:04:11,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:04:11,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:04:11,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:04:11,426 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:04:11,426 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:04:11,426 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:04:11,426 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:04:11,427 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:04:11,741 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:04:11,741 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:04:11,748 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13545 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:04:11,756 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:04:11,757 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:04:11,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:04:11,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:04:11,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:04:11,757 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:04:11,757 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:04:11,758 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:04:11,790 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:04:11,791 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:11,791 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:04:11,791 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:04:11,791 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:04:11,792 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:11,792 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:04:11,792 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:04:11,792 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:11,793 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:11,821 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:04:11,821 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 00:04:11,821 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3312/3520 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2982 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:04:11,823 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:11,823 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:04:11,971 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:04:11,971 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 180 [2022-12-06 00:04:11,971 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:04:11,971 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:04:11,971 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:04:11,971 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:04:11,972 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable313 [2022-12-06 00:04:11,972 INFO L420 AbstractCegarLoop]: === Iteration 315 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:04:11,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:04:11,972 INFO L85 PathProgramCache]: Analyzing trace with hash 2013009058, now seen corresponding path program 1 times [2022-12-06 00:04:11,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:04:11,972 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327769509] [2022-12-06 00:04:11,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:04:11,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:04:11,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:04:12,037 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-06 00:04:12,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:04:12,037 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327769509] [2022-12-06 00:04:12,037 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [327769509] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:04:12,037 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:04:12,037 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:04:12,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456175264] [2022-12-06 00:04:12,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:04:12,038 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:04:12,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:04:12,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:04:12,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:04:12,038 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:04:12,038 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:04:12,038 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:04:12,038 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:04:12,038 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:04:12,346 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:04:12,346 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:04:12,352 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13550 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:04:12,363 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:04:12,363 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:04:12,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:04:12,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:04:12,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:04:12,366 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:04:12,366 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:04:12,367 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:04:12,399 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:04:12,401 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:12,401 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:04:12,401 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:04:12,401 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:04:12,401 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:12,401 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:04:12,401 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:04:12,402 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:12,402 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:12,426 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:04:12,426 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 00:04:12,427 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3321/3530 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2975 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:04:12,429 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:12,429 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:04:12,598 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:04:12,598 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 197 [2022-12-06 00:04:12,598 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:04:12,599 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:04:12,599 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:04:12,599 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:04:12,599 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable314 [2022-12-06 00:04:12,599 INFO L420 AbstractCegarLoop]: === Iteration 316 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:04:12,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:04:12,599 INFO L85 PathProgramCache]: Analyzing trace with hash -539147903, now seen corresponding path program 1 times [2022-12-06 00:04:12,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:04:12,599 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037116537] [2022-12-06 00:04:12,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:04:12,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:04:12,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:04:12,667 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-06 00:04:12,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:04:12,667 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037116537] [2022-12-06 00:04:12,667 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1037116537] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:04:12,667 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:04:12,667 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:04:12,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335004016] [2022-12-06 00:04:12,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:04:12,667 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:04:12,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:04:12,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:04:12,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:04:12,668 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:04:12,668 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:04:12,668 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:04:12,668 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:04:12,668 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:04:13,000 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:04:13,000 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:04:13,007 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13578 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:04:13,017 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:04:13,017 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:04:13,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:04:13,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:04:13,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:04:13,018 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:04:13,018 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:04:13,018 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:04:13,054 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:04:13,055 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:13,055 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:04:13,055 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:04:13,055 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:04:13,055 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:13,056 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:04:13,056 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:04:13,056 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:13,057 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:13,085 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:04:13,085 INFO L131 PetriNetUnfolder]: For 3310/3519 co-relation queries the response was YES. [2022-12-06 00:04:13,086 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3310/3519 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2982 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:04:13,088 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:13,088 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:04:13,252 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:04:13,252 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 197 [2022-12-06 00:04:13,252 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:04:13,252 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:04:13,252 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:04:13,252 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:04:13,253 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable315 [2022-12-06 00:04:13,253 INFO L420 AbstractCegarLoop]: === Iteration 317 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:04:13,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:04:13,253 INFO L85 PathProgramCache]: Analyzing trace with hash 1203662432, now seen corresponding path program 1 times [2022-12-06 00:04:13,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:04:13,253 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469337761] [2022-12-06 00:04:13,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:04:13,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:04:13,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:04:13,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-06 00:04:13,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:04:13,313 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469337761] [2022-12-06 00:04:13,313 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [469337761] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:04:13,313 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:04:13,313 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:04:13,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135302097] [2022-12-06 00:04:13,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:04:13,313 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:04:13,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:04:13,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:04:13,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:04:13,313 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:04:13,313 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:04:13,313 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:04:13,314 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:04:13,314 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:04:13,717 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:04:13,717 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 00:04:13,723 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13582 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:04:13,731 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:04:13,731 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:04:13,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:04:13,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:04:13,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:04:13,732 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:04:13,732 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:04:13,732 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:04:13,774 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:04:13,776 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:13,776 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:04:13,776 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:04:13,776 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:04:13,776 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:13,777 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:04:13,777 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:04:13,777 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:13,778 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:13,810 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:04:13,810 INFO L131 PetriNetUnfolder]: For 3348/3558 co-relation queries the response was YES. [2022-12-06 00:04:13,812 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3348/3558 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2997 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:04:13,814 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:13,814 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:04:14,023 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:04:14,024 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 248 [2022-12-06 00:04:14,024 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:04:14,024 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:04:14,024 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:04:14,024 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:04:14,024 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable316 [2022-12-06 00:04:14,025 INFO L420 AbstractCegarLoop]: === Iteration 318 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:04:14,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:04:14,025 INFO L85 PathProgramCache]: Analyzing trace with hash -1348494529, now seen corresponding path program 1 times [2022-12-06 00:04:14,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:04:14,025 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747197464] [2022-12-06 00:04:14,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:04:14,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:04:14,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:04:14,104 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-06 00:04:14,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:04:14,105 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747197464] [2022-12-06 00:04:14,105 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [747197464] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:04:14,105 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:04:14,105 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:04:14,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219619134] [2022-12-06 00:04:14,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:04:14,105 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:04:14,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:04:14,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:04:14,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:04:14,106 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:04:14,106 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:04:14,106 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:04:14,106 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:04:14,106 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:04:14,456 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:04:14,456 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:04:14,464 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13562 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:04:14,473 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:04:14,473 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:04:14,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:04:14,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:04:14,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:04:14,474 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:04:14,474 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:04:14,474 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:04:14,524 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:04:14,525 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:14,525 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:04:14,526 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:04:14,526 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:04:14,526 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:14,526 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:04:14,526 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:04:14,527 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:14,527 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:14,560 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:04:14,561 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 00:04:14,562 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3312/3520 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2991 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:04:14,565 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:14,565 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:04:14,750 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:04:14,750 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 224 [2022-12-06 00:04:14,750 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:04:14,751 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:04:14,751 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:04:14,751 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:04:14,751 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable317 [2022-12-06 00:04:14,751 INFO L420 AbstractCegarLoop]: === Iteration 319 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:04:14,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:04:14,751 INFO L85 PathProgramCache]: Analyzing trace with hash 394315806, now seen corresponding path program 1 times [2022-12-06 00:04:14,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:04:14,751 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028463798] [2022-12-06 00:04:14,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:04:14,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:04:14,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:04:14,821 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-06 00:04:14,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:04:14,822 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028463798] [2022-12-06 00:04:14,822 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1028463798] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:04:14,822 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:04:14,822 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:04:14,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788608538] [2022-12-06 00:04:14,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:04:14,822 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:04:14,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:04:14,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:04:14,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:04:14,823 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:04:14,823 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:04:14,823 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:04:14,823 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:04:14,823 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:04:15,195 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:04:15,195 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 00:04:15,203 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26965/27010 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13521 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:04:15,213 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:04:15,213 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:04:15,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:04:15,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:04:15,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:04:15,214 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:04:15,214 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:04:15,214 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:04:15,265 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:04:15,267 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:15,267 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:04:15,267 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:04:15,267 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:04:15,267 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:15,268 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:04:15,268 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:04:15,268 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:15,269 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:15,304 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:04:15,304 INFO L131 PetriNetUnfolder]: For 3122/3262 co-relation queries the response was YES. [2022-12-06 00:04:15,306 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3122/3262 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2972 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:04:15,309 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:15,309 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:04:15,507 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:04:15,507 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 240 [2022-12-06 00:04:15,507 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:04:15,507 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:04:15,508 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:04:15,508 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:04:15,508 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable318 [2022-12-06 00:04:15,508 INFO L420 AbstractCegarLoop]: === Iteration 320 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:04:15,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:04:15,508 INFO L85 PathProgramCache]: Analyzing trace with hash 2137126141, now seen corresponding path program 1 times [2022-12-06 00:04:15,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:04:15,508 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341529342] [2022-12-06 00:04:15,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:04:15,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:04:15,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:04:15,588 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-06 00:04:15,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:04:15,588 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341529342] [2022-12-06 00:04:15,588 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1341529342] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:04:15,588 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:04:15,588 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:04:15,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673321392] [2022-12-06 00:04:15,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:04:15,589 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:04:15,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:04:15,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:04:15,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:04:15,590 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:04:15,590 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:04:15,590 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:04:15,590 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:04:15,590 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:04:15,965 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:04:15,965 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 00:04:15,973 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26969/27014 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13506 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:04:15,983 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:04:15,983 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:04:15,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:04:15,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:04:15,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:04:15,984 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:04:15,984 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:04:15,984 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:04:16,031 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:04:16,033 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:16,033 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:04:16,033 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:04:16,034 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:04:16,034 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:16,034 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:04:16,034 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:04:16,034 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:16,035 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:16,068 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:04:16,068 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 00:04:16,070 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3133/3273 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2980 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:04:16,072 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:16,072 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:04:16,255 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:04:16,256 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 222 [2022-12-06 00:04:16,256 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:04:16,256 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:04:16,256 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:04:16,256 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:04:16,256 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable319 [2022-12-06 00:04:16,256 INFO L420 AbstractCegarLoop]: === Iteration 321 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:04:16,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:04:16,257 INFO L85 PathProgramCache]: Analyzing trace with hash -415030820, now seen corresponding path program 1 times [2022-12-06 00:04:16,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:04:16,257 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616051941] [2022-12-06 00:04:16,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:04:16,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:04:16,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:04:16,341 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-06 00:04:16,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:04:16,342 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616051941] [2022-12-06 00:04:16,342 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1616051941] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:04:16,342 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:04:16,342 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:04:16,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171764955] [2022-12-06 00:04:16,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:04:16,342 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:04:16,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:04:16,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:04:16,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:04:16,343 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:04:16,343 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:04:16,343 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:04:16,343 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:04:16,343 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:04:16,733 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:04:16,733 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:04:16,740 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13575 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:04:16,752 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:04:16,752 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:04:16,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:04:16,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:04:16,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:04:16,753 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:04:16,753 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:04:16,753 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:04:16,801 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:04:16,828 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:16,828 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:04:16,828 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:04:16,828 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:04:16,828 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:16,829 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:04:16,829 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:04:16,829 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:16,830 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:16,877 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:04:16,877 INFO L131 PetriNetUnfolder]: For 3338/3547 co-relation queries the response was YES. [2022-12-06 00:04:16,879 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3338/3547 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2988 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:04:16,886 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:16,886 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:04:17,266 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:04:17,267 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 439 [2022-12-06 00:04:17,267 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:04:17,267 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:04:17,267 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:04:17,267 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:04:17,267 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable320 [2022-12-06 00:04:17,267 INFO L420 AbstractCegarLoop]: === Iteration 322 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:04:17,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:04:17,268 INFO L85 PathProgramCache]: Analyzing trace with hash 1327779515, now seen corresponding path program 1 times [2022-12-06 00:04:17,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:04:17,268 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17572723] [2022-12-06 00:04:17,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:04:17,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:04:17,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:04:17,408 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-06 00:04:17,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:04:17,408 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17572723] [2022-12-06 00:04:17,408 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [17572723] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:04:17,408 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:04:17,408 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:04:17,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335861458] [2022-12-06 00:04:17,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:04:17,409 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:04:17,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:04:17,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:04:17,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:04:17,409 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:04:17,409 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:04:17,409 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:04:17,409 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:04:17,409 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:04:17,956 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:04:17,956 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:04:17,962 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13559 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:04:17,971 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:04:17,971 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:04:17,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:04:17,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:04:17,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:04:17,972 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:04:17,972 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:04:17,972 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:04:18,012 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:04:18,014 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:18,014 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:04:18,014 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:04:18,014 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:04:18,014 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:18,015 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:04:18,015 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:04:18,015 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:18,015 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:18,048 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:04:18,048 INFO L131 PetriNetUnfolder]: For 3304/3511 co-relation queries the response was YES. [2022-12-06 00:04:18,049 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3304/3511 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2984 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:04:18,051 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:18,051 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:04:18,208 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:04:18,208 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 194 [2022-12-06 00:04:18,209 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:04:18,209 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:04:18,209 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:04:18,209 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:04:18,209 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable321 [2022-12-06 00:04:18,209 INFO L420 AbstractCegarLoop]: === Iteration 323 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:04:18,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:04:18,209 INFO L85 PathProgramCache]: Analyzing trace with hash -1224377446, now seen corresponding path program 1 times [2022-12-06 00:04:18,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:04:18,209 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667336167] [2022-12-06 00:04:18,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:04:18,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:04:18,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:04:18,267 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-06 00:04:18,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:04:18,268 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667336167] [2022-12-06 00:04:18,268 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1667336167] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:04:18,268 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:04:18,268 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:04:18,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274177877] [2022-12-06 00:04:18,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:04:18,268 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:04:18,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:04:18,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:04:18,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:04:18,268 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:04:18,269 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:04:18,269 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:04:18,269 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:04:18,269 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:04:18,548 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:04:18,548 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:04:18,553 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13559 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:04:18,561 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:04:18,561 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:04:18,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:04:18,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:04:18,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:04:18,561 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:04:18,561 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:04:18,562 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:04:18,600 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:04:18,601 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:18,601 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:04:18,601 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:04:18,601 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:04:18,601 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:18,602 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:04:18,602 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:04:18,602 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:18,602 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:18,629 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:04:18,629 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 00:04:18,631 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3321/3530 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2969 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:04:18,633 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:18,633 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:04:18,806 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:04:18,806 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 205 [2022-12-06 00:04:18,806 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:04:18,806 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:04:18,806 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:04:18,807 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:04:18,807 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable322 [2022-12-06 00:04:18,807 INFO L420 AbstractCegarLoop]: === Iteration 324 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:04:18,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:04:18,807 INFO L85 PathProgramCache]: Analyzing trace with hash 518432889, now seen corresponding path program 1 times [2022-12-06 00:04:18,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:04:18,807 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807832932] [2022-12-06 00:04:18,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:04:18,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:04:18,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:04:18,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-06 00:04:18,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:04:18,866 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807832932] [2022-12-06 00:04:18,866 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [807832932] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:04:18,866 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:04:18,866 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:04:18,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036697877] [2022-12-06 00:04:18,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:04:18,867 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:04:18,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:04:18,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:04:18,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:04:18,867 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:04:18,867 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:04:18,867 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:04:18,867 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:04:18,867 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:04:19,177 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:04:19,177 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:04:19,183 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13568 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:04:19,191 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:04:19,191 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:04:19,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:04:19,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:04:19,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:04:19,192 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:04:19,192 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:04:19,192 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:04:19,228 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:04:19,229 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:19,229 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:04:19,229 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:04:19,229 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:04:19,229 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:19,230 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:04:19,230 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:04:19,230 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:19,231 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:19,260 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:04:19,260 INFO L131 PetriNetUnfolder]: For 3318/3528 co-relation queries the response was YES. [2022-12-06 00:04:19,261 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3318/3528 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2983 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:04:19,264 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:19,264 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:04:19,411 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:04:19,412 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 183 [2022-12-06 00:04:19,412 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:04:19,412 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:04:19,412 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:04:19,412 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:04:19,412 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable323 [2022-12-06 00:04:19,412 INFO L420 AbstractCegarLoop]: === Iteration 325 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:04:19,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:04:19,412 INFO L85 PathProgramCache]: Analyzing trace with hash -2033724072, now seen corresponding path program 1 times [2022-12-06 00:04:19,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:04:19,412 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127907748] [2022-12-06 00:04:19,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:04:19,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:04:19,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:04:19,469 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-06 00:04:19,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:04:19,470 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127907748] [2022-12-06 00:04:19,470 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2127907748] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:04:19,470 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:04:19,470 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:04:19,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105789477] [2022-12-06 00:04:19,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:04:19,470 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:04:19,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:04:19,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:04:19,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:04:19,471 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:04:19,471 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:04:19,471 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:04:19,471 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:04:19,471 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:04:19,750 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:04:19,750 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:04:19,755 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13575 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:04:19,761 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:04:19,761 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:04:19,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:04:19,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:04:19,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:04:19,762 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:04:19,762 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:04:19,762 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:04:19,792 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:04:19,793 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:19,793 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:04:19,793 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:04:19,793 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:04:19,793 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:19,794 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:04:19,794 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:04:19,794 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:19,794 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:19,819 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:04:19,819 INFO L131 PetriNetUnfolder]: For 3338/3547 co-relation queries the response was YES. [2022-12-06 00:04:19,820 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3338/3547 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2980 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:04:19,822 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:19,822 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:04:19,975 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:04:19,975 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 182 [2022-12-06 00:04:19,975 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:04:19,975 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:04:19,975 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:04:19,975 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:04:19,975 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable324 [2022-12-06 00:04:19,976 INFO L420 AbstractCegarLoop]: === Iteration 326 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:04:19,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:04:19,976 INFO L85 PathProgramCache]: Analyzing trace with hash -290913737, now seen corresponding path program 1 times [2022-12-06 00:04:19,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:04:19,976 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736867595] [2022-12-06 00:04:19,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:04:19,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:04:19,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:04:20,033 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-06 00:04:20,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:04:20,034 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736867595] [2022-12-06 00:04:20,034 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [736867595] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:04:20,034 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:04:20,034 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:04:20,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699543020] [2022-12-06 00:04:20,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:04:20,034 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:04:20,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:04:20,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:04:20,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:04:20,034 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:04:20,035 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:04:20,035 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:04:20,035 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:04:20,035 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:04:20,392 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:04:20,392 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:04:20,400 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13551 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:04:20,410 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:04:20,411 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:04:20,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:04:20,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:04:20,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:04:20,412 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:04:20,412 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:04:20,412 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:04:20,460 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:04:20,462 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:20,462 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:04:20,462 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:04:20,462 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:04:20,462 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:20,463 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:04:20,463 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:04:20,463 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:20,464 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:20,495 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:04:20,495 INFO L131 PetriNetUnfolder]: For 3309/3518 co-relation queries the response was YES. [2022-12-06 00:04:20,497 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3309/3518 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2984 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:04:20,499 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:20,499 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:04:20,674 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:04:20,674 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 212 [2022-12-06 00:04:20,674 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:04:20,675 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:04:20,675 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:04:20,675 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:04:20,675 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable325 [2022-12-06 00:04:20,675 INFO L420 AbstractCegarLoop]: === Iteration 327 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:04:20,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:04:20,675 INFO L85 PathProgramCache]: Analyzing trace with hash 1451896598, now seen corresponding path program 1 times [2022-12-06 00:04:20,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:04:20,675 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034836485] [2022-12-06 00:04:20,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:04:20,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:04:20,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:04:20,751 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-06 00:04:20,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:04:20,752 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034836485] [2022-12-06 00:04:20,752 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2034836485] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:04:20,752 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:04:20,752 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:04:20,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674887277] [2022-12-06 00:04:20,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:04:20,752 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:04:20,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:04:20,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:04:20,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:04:20,753 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:04:20,753 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:04:20,753 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:04:20,753 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:04:20,753 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:04:21,132 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:04:21,132 INFO L131 PetriNetUnfolder]: For 27150/27195 co-relation queries the response was YES. [2022-12-06 00:04:21,140 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27150/27195 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13518 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:04:21,150 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:04:21,150 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:04:21,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:04:21,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:04:21,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:04:21,151 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:04:21,151 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:04:21,151 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:04:21,196 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:04:21,197 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:21,198 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:04:21,198 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:04:21,198 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:04:21,198 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:21,199 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:04:21,199 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:04:21,199 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:21,200 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:21,233 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:04:21,233 INFO L131 PetriNetUnfolder]: For 3167/3307 co-relation queries the response was YES. [2022-12-06 00:04:21,234 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3167/3307 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2983 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:04:21,237 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:21,237 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:04:21,434 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:04:21,435 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 237 [2022-12-06 00:04:21,435 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:04:21,435 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:04:21,435 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:04:21,435 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:04:21,435 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable326 [2022-12-06 00:04:21,435 INFO L420 AbstractCegarLoop]: === Iteration 328 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:04:21,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:04:21,436 INFO L85 PathProgramCache]: Analyzing trace with hash -1100260363, now seen corresponding path program 1 times [2022-12-06 00:04:21,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:04:21,436 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500822021] [2022-12-06 00:04:21,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:04:21,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:04:21,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:04:21,512 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-06 00:04:21,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:04:21,512 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500822021] [2022-12-06 00:04:21,512 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1500822021] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:04:21,512 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:04:21,512 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:04:21,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80129302] [2022-12-06 00:04:21,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:04:21,512 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:04:21,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:04:21,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:04:21,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:04:21,513 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:04:21,513 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:04:21,513 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:04:21,513 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:04:21,513 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:04:21,899 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:04:21,899 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 00:04:21,908 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26965/27010 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13512 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:04:21,919 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:04:21,919 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:04:21,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:04:21,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:04:21,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:04:21,920 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:04:21,920 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:04:21,920 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:04:21,970 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:04:21,971 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:21,972 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:04:21,972 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:04:21,972 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:04:21,972 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:21,973 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:04:21,973 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:04:21,973 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:21,974 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:22,008 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:04:22,009 INFO L131 PetriNetUnfolder]: For 3122/3262 co-relation queries the response was YES. [2022-12-06 00:04:22,010 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3122/3262 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2994 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:04:22,013 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:22,013 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:04:22,206 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:04:22,207 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 235 [2022-12-06 00:04:22,207 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:04:22,207 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:04:22,207 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:04:22,207 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:04:22,207 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable327 [2022-12-06 00:04:22,208 INFO L420 AbstractCegarLoop]: === Iteration 329 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:04:22,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:04:22,208 INFO L85 PathProgramCache]: Analyzing trace with hash 642549972, now seen corresponding path program 1 times [2022-12-06 00:04:22,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:04:22,208 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048995208] [2022-12-06 00:04:22,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:04:22,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:04:22,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:04:22,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-06 00:04:22,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:04:22,295 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048995208] [2022-12-06 00:04:22,295 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1048995208] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:04:22,295 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:04:22,295 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:04:22,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644785727] [2022-12-06 00:04:22,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:04:22,296 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:04:22,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:04:22,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:04:22,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:04:22,296 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:04:22,296 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:04:22,297 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:04:22,297 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:04:22,297 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:04:22,673 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:04:22,674 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 00:04:22,682 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13576 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:04:22,693 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:04:22,693 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:04:22,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:04:22,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:04:22,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:04:22,694 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:04:22,694 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:04:22,694 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:04:22,743 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:04:22,745 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:22,745 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:04:22,745 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:04:22,745 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:04:22,745 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:22,746 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:04:22,746 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:04:22,746 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:22,747 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:22,781 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:04:22,781 INFO L131 PetriNetUnfolder]: For 3338/3550 co-relation queries the response was YES. [2022-12-06 00:04:22,783 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3338/3550 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2978 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:04:22,785 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:22,786 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:04:22,976 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:04:22,977 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 232 [2022-12-06 00:04:22,977 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:04:22,977 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:04:22,977 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:04:22,977 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:04:22,977 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable328 [2022-12-06 00:04:22,978 INFO L420 AbstractCegarLoop]: === Iteration 330 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:04:22,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:04:22,978 INFO L85 PathProgramCache]: Analyzing trace with hash -1909606989, now seen corresponding path program 1 times [2022-12-06 00:04:22,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:04:22,978 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284677567] [2022-12-06 00:04:22,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:04:22,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:04:22,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:04:23,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-06 00:04:23,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:04:23,063 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284677567] [2022-12-06 00:04:23,063 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1284677567] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:04:23,063 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:04:23,063 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:04:23,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813941578] [2022-12-06 00:04:23,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:04:23,064 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:04:23,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:04:23,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:04:23,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:04:23,064 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:04:23,064 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:04:23,064 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:04:23,064 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:04:23,064 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:04:23,521 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:04:23,521 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:04:23,529 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13570 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:04:23,583 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:04:23,583 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:04:23,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:04:23,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:04:23,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:04:23,585 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:04:23,585 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:04:23,585 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:04:23,624 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:04:23,626 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:23,626 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:04:23,626 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:04:23,626 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:04:23,626 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:23,627 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:04:23,627 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:04:23,627 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:23,628 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:23,660 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:04:23,660 INFO L131 PetriNetUnfolder]: For 3304/3511 co-relation queries the response was YES. [2022-12-06 00:04:23,661 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3304/3511 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2982 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:04:23,664 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:23,664 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:04:23,839 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:04:23,840 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 214 [2022-12-06 00:04:23,840 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:04:23,840 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:04:23,840 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:04:23,840 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:04:23,840 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable329 [2022-12-06 00:04:23,841 INFO L420 AbstractCegarLoop]: === Iteration 331 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:04:23,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:04:23,841 INFO L85 PathProgramCache]: Analyzing trace with hash -166796654, now seen corresponding path program 1 times [2022-12-06 00:04:23,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:04:23,841 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661092514] [2022-12-06 00:04:23,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:04:23,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:04:23,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:04:23,947 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-06 00:04:23,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:04:23,947 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661092514] [2022-12-06 00:04:23,947 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [661092514] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:04:23,947 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:04:23,947 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:04:23,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992724276] [2022-12-06 00:04:23,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:04:23,948 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:04:23,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:04:23,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:04:23,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:04:23,948 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:04:23,948 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:04:23,948 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:04:23,948 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:04:23,949 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:04:24,265 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:04:24,266 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:04:24,271 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13573 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:04:24,278 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:04:24,279 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:04:24,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:04:24,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:04:24,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:04:24,279 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:04:24,279 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:04:24,279 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:04:24,313 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:04:24,314 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:24,314 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:04:24,315 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:04:24,315 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:04:24,315 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:24,315 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:04:24,315 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:04:24,315 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:24,316 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:24,341 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:04:24,341 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 00:04:24,342 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3312/3520 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2968 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:04:24,344 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:24,344 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:04:24,486 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:04:24,486 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 171 [2022-12-06 00:04:24,487 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:04:24,487 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:04:24,487 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:04:24,487 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:04:24,487 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable330 [2022-12-06 00:04:24,487 INFO L420 AbstractCegarLoop]: === Iteration 332 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:04:24,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:04:24,487 INFO L85 PathProgramCache]: Analyzing trace with hash 1576013681, now seen corresponding path program 1 times [2022-12-06 00:04:24,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:04:24,487 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544236514] [2022-12-06 00:04:24,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:04:24,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:04:24,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:04:24,554 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-06 00:04:24,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:04:24,554 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544236514] [2022-12-06 00:04:24,554 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [544236514] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:04:24,554 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:04:24,554 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:04:24,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494699417] [2022-12-06 00:04:24,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:04:24,555 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:04:24,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:04:24,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:04:24,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:04:24,555 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:04:24,555 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:04:24,555 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:04:24,555 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:04:24,555 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:04:24,841 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:04:24,841 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:04:24,848 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13563 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:04:24,857 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:04:24,857 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:04:24,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:04:24,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:04:24,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:04:24,857 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:04:24,858 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:04:24,858 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:04:24,893 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:04:24,894 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:24,894 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:04:24,895 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:04:24,895 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:04:24,895 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:24,895 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:04:24,895 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:04:24,895 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:24,896 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:24,921 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:04:24,921 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 00:04:24,922 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3321/3530 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2967 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:04:24,924 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:24,924 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:04:25,084 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:04:25,085 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 190 [2022-12-06 00:04:25,085 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:04:25,085 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:04:25,085 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:04:25,085 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:04:25,085 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable331 [2022-12-06 00:04:25,085 INFO L420 AbstractCegarLoop]: === Iteration 333 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:04:25,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:04:25,086 INFO L85 PathProgramCache]: Analyzing trace with hash -976143280, now seen corresponding path program 1 times [2022-12-06 00:04:25,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:04:25,086 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213892821] [2022-12-06 00:04:25,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:04:25,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:04:25,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:04:25,164 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-06 00:04:25,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:04:25,165 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213892821] [2022-12-06 00:04:25,165 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1213892821] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:04:25,165 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:04:25,165 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:04:25,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261650802] [2022-12-06 00:04:25,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:04:25,165 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:04:25,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:04:25,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:04:25,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:04:25,166 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:04:25,166 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:04:25,166 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:04:25,166 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:04:25,166 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:04:25,467 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:04:25,467 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 00:04:25,473 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26965/27010 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13544 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:04:25,480 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:04:25,480 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:04:25,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:04:25,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:04:25,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:04:25,481 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:04:25,481 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:04:25,481 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:04:25,512 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:04:25,513 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:25,513 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:04:25,513 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:04:25,513 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:04:25,513 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:25,514 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:04:25,514 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:04:25,514 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:25,514 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:25,539 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:04:25,539 INFO L131 PetriNetUnfolder]: For 3140/3283 co-relation queries the response was YES. [2022-12-06 00:04:25,540 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3140/3283 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2970 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:04:25,542 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:25,542 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:04:25,680 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:04:25,681 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 168 [2022-12-06 00:04:25,681 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:04:25,681 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:04:25,681 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:04:25,681 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:04:25,681 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable332 [2022-12-06 00:04:25,681 INFO L420 AbstractCegarLoop]: === Iteration 334 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:04:25,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:04:25,681 INFO L85 PathProgramCache]: Analyzing trace with hash 766667055, now seen corresponding path program 1 times [2022-12-06 00:04:25,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:04:25,682 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808050021] [2022-12-06 00:04:25,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:04:25,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:04:25,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:04:25,741 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-06 00:04:25,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:04:25,741 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808050021] [2022-12-06 00:04:25,741 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1808050021] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:04:25,742 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:04:25,742 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:04:25,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759737960] [2022-12-06 00:04:25,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:04:25,742 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:04:25,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:04:25,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:04:25,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:04:25,742 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:04:25,742 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:04:25,742 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:04:25,742 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:04:25,742 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:04:26,035 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:04:26,035 INFO L131 PetriNetUnfolder]: For 26955/27000 co-relation queries the response was YES. [2022-12-06 00:04:26,041 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26955/27000 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13545 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:04:26,047 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:04:26,048 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:04:26,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:04:26,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:04:26,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:04:26,048 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:04:26,048 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:04:26,048 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:04:26,084 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:04:26,085 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:26,085 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:04:26,085 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:04:26,085 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:04:26,085 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:26,086 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:04:26,086 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:04:26,086 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:26,086 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:26,110 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:04:26,110 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 00:04:26,111 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3133/3273 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2995 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:04:26,113 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:26,113 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:04:26,265 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:04:26,265 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 180 [2022-12-06 00:04:26,265 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:04:26,266 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:04:26,266 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:04:26,266 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:04:26,266 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable333 [2022-12-06 00:04:26,266 INFO L420 AbstractCegarLoop]: === Iteration 335 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:04:26,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:04:26,266 INFO L85 PathProgramCache]: Analyzing trace with hash -1785489906, now seen corresponding path program 1 times [2022-12-06 00:04:26,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:04:26,266 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645913901] [2022-12-06 00:04:26,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:04:26,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:04:26,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:04:26,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-06 00:04:26,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:04:26,333 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645913901] [2022-12-06 00:04:26,333 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1645913901] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:04:26,333 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:04:26,333 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:04:26,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219527746] [2022-12-06 00:04:26,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:04:26,333 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:04:26,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:04:26,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:04:26,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:04:26,334 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:04:26,334 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:04:26,334 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:04:26,334 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:04:26,334 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:04:26,636 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:04:26,637 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 00:04:26,642 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26965/27010 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13523 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:04:26,650 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:04:26,650 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:04:26,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:04:26,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:04:26,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:04:26,650 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:04:26,651 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:04:26,651 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:04:26,685 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:04:26,686 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:26,686 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:04:26,687 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:04:26,687 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:04:26,687 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:26,687 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:04:26,687 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:04:26,687 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:26,688 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:26,720 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:04:26,721 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 00:04:26,721 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3133/3273 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2980 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:04:26,723 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:26,723 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:04:26,876 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:04:26,876 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 189 [2022-12-06 00:04:26,876 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:04:26,876 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:04:26,877 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:04:26,877 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:04:26,877 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable334 [2022-12-06 00:04:26,877 INFO L420 AbstractCegarLoop]: === Iteration 336 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:04:26,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:04:26,877 INFO L85 PathProgramCache]: Analyzing trace with hash -42679571, now seen corresponding path program 1 times [2022-12-06 00:04:26,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:04:26,877 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187407655] [2022-12-06 00:04:26,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:04:26,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:04:26,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:04:26,934 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-06 00:04:26,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:04:26,935 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187407655] [2022-12-06 00:04:26,935 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1187407655] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:04:26,935 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:04:26,935 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:04:26,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775008568] [2022-12-06 00:04:26,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:04:26,935 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:04:26,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:04:26,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:04:26,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:04:26,936 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:04:26,936 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:04:26,936 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:04:26,936 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:04:26,936 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:04:27,215 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:04:27,215 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:04:27,221 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13589 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:04:27,229 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:04:27,229 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:04:27,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:04:27,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:04:27,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:04:27,230 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:04:27,230 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:04:27,230 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:04:27,265 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:04:27,266 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:27,266 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:04:27,266 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:04:27,266 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:04:27,267 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:27,267 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:04:27,267 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:04:27,267 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:27,268 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:27,292 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:04:27,292 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 00:04:27,293 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3321/3530 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2995 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:04:27,295 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:27,295 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:04:27,446 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:04:27,446 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 180 [2022-12-06 00:04:27,446 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:04:27,446 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:04:27,446 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:04:27,446 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:04:27,446 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable335 [2022-12-06 00:04:27,446 INFO L420 AbstractCegarLoop]: === Iteration 337 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:04:27,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:04:27,447 INFO L85 PathProgramCache]: Analyzing trace with hash 1700130764, now seen corresponding path program 1 times [2022-12-06 00:04:27,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:04:27,447 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211895573] [2022-12-06 00:04:27,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:04:27,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:04:27,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:04:27,511 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-06 00:04:27,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:04:27,511 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211895573] [2022-12-06 00:04:27,511 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [211895573] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:04:27,511 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:04:27,511 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:04:27,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360997875] [2022-12-06 00:04:27,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:04:27,512 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:04:27,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:04:27,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:04:27,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:04:27,512 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:04:27,512 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:04:27,512 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:04:27,512 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:04:27,512 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:04:27,789 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:04:27,789 INFO L131 PetriNetUnfolder]: For 27150/27195 co-relation queries the response was YES. [2022-12-06 00:04:27,795 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27150/27195 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13530 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:04:27,802 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:04:27,802 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:04:27,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:04:27,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:04:27,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:04:27,803 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:04:27,803 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:04:27,803 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:04:27,835 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:04:27,836 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:27,836 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:04:27,836 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:04:27,836 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:04:27,837 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:27,837 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:04:27,837 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:04:27,837 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:27,838 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:27,862 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:04:27,863 INFO L131 PetriNetUnfolder]: For 3180/3321 co-relation queries the response was YES. [2022-12-06 00:04:27,864 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3180/3321 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 3003 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:04:27,866 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:27,866 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:04:28,014 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:04:28,015 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 179 [2022-12-06 00:04:28,015 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:04:28,015 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:04:28,015 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:04:28,015 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:04:28,015 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable336 [2022-12-06 00:04:28,015 INFO L420 AbstractCegarLoop]: === Iteration 338 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:04:28,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:04:28,015 INFO L85 PathProgramCache]: Analyzing trace with hash -852026197, now seen corresponding path program 1 times [2022-12-06 00:04:28,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:04:28,015 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792553152] [2022-12-06 00:04:28,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:04:28,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:04:28,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:04:28,078 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-06 00:04:28,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:04:28,078 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792553152] [2022-12-06 00:04:28,078 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [792553152] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:04:28,078 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:04:28,078 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:04:28,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531729666] [2022-12-06 00:04:28,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:04:28,078 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:04:28,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:04:28,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:04:28,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:04:28,079 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:04:28,079 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:04:28,079 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:04:28,079 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:04:28,079 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:04:28,371 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:04:28,372 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 00:04:28,377 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26965/27010 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13523 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:04:28,383 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:04:28,383 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:04:28,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:04:28,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:04:28,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:04:28,384 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:04:28,384 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:04:28,384 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:04:28,414 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:04:28,415 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:28,415 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:04:28,416 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:04:28,416 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:04:28,416 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:28,416 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:04:28,416 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:04:28,416 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:28,417 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:28,441 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:04:28,442 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 00:04:28,442 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3133/3273 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2975 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:04:28,444 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:28,444 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:04:28,612 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:04:28,613 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 197 [2022-12-06 00:04:28,613 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:04:28,613 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:04:28,613 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:04:28,613 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:04:28,613 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable337 [2022-12-06 00:04:28,613 INFO L420 AbstractCegarLoop]: === Iteration 339 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:04:28,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:04:28,614 INFO L85 PathProgramCache]: Analyzing trace with hash 890784138, now seen corresponding path program 1 times [2022-12-06 00:04:28,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:04:28,614 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251122983] [2022-12-06 00:04:28,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:04:28,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:04:28,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:04:28,696 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-06 00:04:28,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:04:28,696 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251122983] [2022-12-06 00:04:28,696 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251122983] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:04:28,696 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:04:28,696 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:04:28,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194246864] [2022-12-06 00:04:28,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:04:28,697 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:04:28,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:04:28,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:04:28,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:04:28,697 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:04:28,697 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:04:28,697 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:04:28,697 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:04:28,697 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:04:29,070 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:04:29,071 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 00:04:29,079 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26965/27010 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13531 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:04:29,090 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:04:29,090 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:04:29,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:04:29,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:04:29,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:04:29,091 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:04:29,091 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:04:29,091 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:04:29,143 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:04:29,145 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:29,145 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:04:29,145 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:04:29,145 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:04:29,145 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:29,146 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:04:29,146 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:04:29,146 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:29,147 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:29,180 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:04:29,181 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 00:04:29,182 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3133/3273 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2982 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:04:29,185 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:29,185 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:04:29,364 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:04:29,365 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 220 [2022-12-06 00:04:29,365 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:04:29,365 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:04:29,365 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:04:29,365 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:04:29,365 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable338 [2022-12-06 00:04:29,365 INFO L420 AbstractCegarLoop]: === Iteration 340 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:04:29,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:04:29,366 INFO L85 PathProgramCache]: Analyzing trace with hash -1661372823, now seen corresponding path program 1 times [2022-12-06 00:04:29,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:04:29,366 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8798602] [2022-12-06 00:04:29,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:04:29,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:04:29,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:04:29,458 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-06 00:04:29,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:04:29,459 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8798602] [2022-12-06 00:04:29,459 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [8798602] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:04:29,459 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:04:29,459 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:04:29,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813455] [2022-12-06 00:04:29,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:04:29,459 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:04:29,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:04:29,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:04:29,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:04:29,460 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:04:29,460 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:04:29,460 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:04:29,460 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:04:29,460 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:04:29,854 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:04:29,854 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:04:29,862 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13579 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:04:29,873 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:04:29,873 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:04:29,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:04:29,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:04:29,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:04:29,874 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:04:29,874 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:04:29,875 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:04:29,926 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:04:29,928 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:29,928 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:04:29,928 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:04:29,928 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:04:29,928 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:29,929 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:04:29,929 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:04:29,929 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:29,930 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:29,962 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:04:29,962 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 00:04:29,963 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3312/3520 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2979 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:04:29,966 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:29,966 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:04:30,138 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:04:30,139 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 211 [2022-12-06 00:04:30,139 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:04:30,139 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:04:30,139 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:04:30,139 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:04:30,140 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable339 [2022-12-06 00:04:30,140 INFO L420 AbstractCegarLoop]: === Iteration 341 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:04:30,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:04:30,140 INFO L85 PathProgramCache]: Analyzing trace with hash 81437512, now seen corresponding path program 1 times [2022-12-06 00:04:30,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:04:30,140 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563095300] [2022-12-06 00:04:30,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:04:30,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:04:30,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:04:30,229 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-06 00:04:30,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:04:30,230 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563095300] [2022-12-06 00:04:30,230 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [563095300] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:04:30,230 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:04:30,230 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:04:30,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516535644] [2022-12-06 00:04:30,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:04:30,230 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:04:30,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:04:30,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:04:30,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:04:30,231 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:04:30,231 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:04:30,231 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:04:30,231 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:04:30,231 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:04:30,584 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:04:30,585 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 00:04:30,593 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26965/27010 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13544 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:04:30,603 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:04:30,603 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:04:30,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:04:30,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:04:30,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:04:30,604 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:04:30,604 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:04:30,604 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:04:30,654 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:04:30,655 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:30,656 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:04:30,656 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:04:30,656 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:04:30,656 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:30,657 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:04:30,657 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:04:30,657 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:30,658 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:30,691 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:04:30,691 INFO L131 PetriNetUnfolder]: For 3146/3287 co-relation queries the response was YES. [2022-12-06 00:04:30,693 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3146/3287 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2983 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:04:30,696 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:30,696 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:04:30,888 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:04:30,888 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 232 [2022-12-06 00:04:30,888 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:04:30,888 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:04:30,888 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:04:30,888 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:04:30,889 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable340 [2022-12-06 00:04:30,889 INFO L420 AbstractCegarLoop]: === Iteration 342 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:04:30,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:04:30,889 INFO L85 PathProgramCache]: Analyzing trace with hash 1824247847, now seen corresponding path program 1 times [2022-12-06 00:04:30,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:04:30,889 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790095060] [2022-12-06 00:04:30,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:04:30,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:04:30,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:04:30,978 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-06 00:04:30,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:04:30,978 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790095060] [2022-12-06 00:04:30,978 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1790095060] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:04:30,978 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:04:30,978 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:04:30,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410526768] [2022-12-06 00:04:30,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:04:30,979 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:04:30,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:04:30,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:04:30,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:04:30,980 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:04:30,981 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:04:30,981 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:04:30,981 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:04:30,981 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:04:31,343 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:04:31,344 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:04:31,351 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13579 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:04:31,362 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:04:31,362 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:04:31,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:04:31,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:04:31,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:04:31,363 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:04:31,363 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:04:31,363 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:04:31,410 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:04:31,427 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:31,427 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:04:31,427 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:04:31,427 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:04:31,427 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:31,428 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:04:31,428 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:04:31,428 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:31,429 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:31,461 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:04:31,461 INFO L131 PetriNetUnfolder]: For 3304/3511 co-relation queries the response was YES. [2022-12-06 00:04:31,462 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3304/3511 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2985 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:04:31,465 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:31,465 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:04:31,659 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:04:31,660 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 233 [2022-12-06 00:04:31,660 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:04:31,660 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:04:31,660 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:04:31,660 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:04:31,660 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable341 [2022-12-06 00:04:31,661 INFO L420 AbstractCegarLoop]: === Iteration 343 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:04:31,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:04:31,661 INFO L85 PathProgramCache]: Analyzing trace with hash -727909114, now seen corresponding path program 1 times [2022-12-06 00:04:31,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:04:31,661 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817359999] [2022-12-06 00:04:31,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:04:31,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:04:31,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:04:31,728 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-06 00:04:31,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:04:31,729 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817359999] [2022-12-06 00:04:31,729 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1817359999] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:04:31,729 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:04:31,729 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:04:31,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816654465] [2022-12-06 00:04:31,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:04:31,729 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:04:31,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:04:31,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:04:31,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:04:31,730 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:04:31,730 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:04:31,730 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:04:31,730 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:04:31,730 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:04:32,127 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:04:32,128 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:04:32,135 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13551 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:04:32,195 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:04:32,195 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:04:32,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:04:32,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:04:32,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:04:32,196 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:04:32,196 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:04:32,196 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:04:32,241 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:04:32,242 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:32,242 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:04:32,243 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:04:32,243 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:04:32,243 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:32,243 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:04:32,243 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:04:32,244 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:32,244 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:32,277 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:04:32,277 INFO L131 PetriNetUnfolder]: For 3318/3528 co-relation queries the response was YES. [2022-12-06 00:04:32,279 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3318/3528 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2991 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:04:32,282 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:32,282 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:04:32,451 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:04:32,452 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 209 [2022-12-06 00:04:32,452 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:04:32,452 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:04:32,452 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:04:32,452 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:04:32,452 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable342 [2022-12-06 00:04:32,453 INFO L420 AbstractCegarLoop]: === Iteration 344 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:04:32,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:04:32,453 INFO L85 PathProgramCache]: Analyzing trace with hash 1014901221, now seen corresponding path program 1 times [2022-12-06 00:04:32,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:04:32,453 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658632704] [2022-12-06 00:04:32,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:04:32,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:04:32,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:04:32,525 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-06 00:04:32,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:04:32,526 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658632704] [2022-12-06 00:04:32,526 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [658632704] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:04:32,526 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:04:32,526 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:04:32,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372285532] [2022-12-06 00:04:32,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:04:32,526 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:04:32,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:04:32,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:04:32,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:04:32,527 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:04:32,527 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:04:32,527 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:04:32,527 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:04:32,527 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:04:32,878 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:04:32,879 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:04:32,886 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13582 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:04:32,897 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:04:32,897 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:04:32,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:04:32,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:04:32,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:04:32,898 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:04:32,898 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:04:32,898 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:04:32,945 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:04:32,946 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:32,947 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:04:32,947 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:04:32,947 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:04:32,947 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:32,948 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:04:32,948 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:04:32,948 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:32,948 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:32,979 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:04:32,979 INFO L131 PetriNetUnfolder]: For 3301/3509 co-relation queries the response was YES. [2022-12-06 00:04:32,981 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3301/3509 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2996 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:04:32,984 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:32,984 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:04:33,151 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:04:33,152 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 205 [2022-12-06 00:04:33,152 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:04:33,152 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:04:33,152 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:04:33,152 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:04:33,152 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable343 [2022-12-06 00:04:33,152 INFO L420 AbstractCegarLoop]: === Iteration 345 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:04:33,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:04:33,153 INFO L85 PathProgramCache]: Analyzing trace with hash -1537255740, now seen corresponding path program 1 times [2022-12-06 00:04:33,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:04:33,153 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774392111] [2022-12-06 00:04:33,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:04:33,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:04:33,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:04:33,236 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-06 00:04:33,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:04:33,236 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774392111] [2022-12-06 00:04:33,237 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1774392111] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:04:33,237 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:04:33,237 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:04:33,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949254148] [2022-12-06 00:04:33,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:04:33,237 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:04:33,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:04:33,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:04:33,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:04:33,237 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:04:33,238 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:04:33,238 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:04:33,238 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:04:33,238 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:04:33,606 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:04:33,606 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 00:04:33,613 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13547 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:04:33,623 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:04:33,624 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:04:33,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:04:33,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:04:33,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:04:33,625 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:04:33,625 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:04:33,625 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:04:33,671 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:04:33,673 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:33,673 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:04:33,673 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:04:33,673 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:04:33,673 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:33,674 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:04:33,674 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:04:33,674 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:33,675 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:33,708 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:04:33,708 INFO L131 PetriNetUnfolder]: For 3337/3547 co-relation queries the response was YES. [2022-12-06 00:04:33,710 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3337/3547 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2989 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:04:33,713 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:33,713 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:04:33,949 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:04:33,949 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 276 [2022-12-06 00:04:33,949 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:04:33,949 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:04:33,949 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:04:33,950 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:04:33,950 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable344 [2022-12-06 00:04:33,950 INFO L420 AbstractCegarLoop]: === Iteration 346 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:04:33,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:04:33,950 INFO L85 PathProgramCache]: Analyzing trace with hash 205554595, now seen corresponding path program 1 times [2022-12-06 00:04:33,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:04:33,950 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459468995] [2022-12-06 00:04:33,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:04:33,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:04:33,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:04:34,020 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-06 00:04:34,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:04:34,020 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459468995] [2022-12-06 00:04:34,020 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1459468995] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:04:34,020 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:04:34,021 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:04:34,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303660823] [2022-12-06 00:04:34,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:04:34,021 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:04:34,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:04:34,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:04:34,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:04:34,021 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:04:34,021 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:04:34,022 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:04:34,022 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:04:34,022 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:04:34,353 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:04:34,354 INFO L131 PetriNetUnfolder]: For 26955/27000 co-relation queries the response was YES. [2022-12-06 00:04:34,360 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26955/27000 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13536 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:04:34,367 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:04:34,367 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:04:34,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:04:34,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:04:34,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:04:34,372 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:04:34,372 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:04:34,372 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:04:34,420 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:04:34,421 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:34,421 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:04:34,421 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:04:34,422 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:04:34,422 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:34,422 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:04:34,422 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:04:34,422 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:34,423 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:34,448 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:04:34,448 INFO L131 PetriNetUnfolder]: For 3134/3275 co-relation queries the response was YES. [2022-12-06 00:04:34,449 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3134/3275 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2986 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:04:34,451 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:34,451 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:04:34,668 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:04:34,669 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 247 [2022-12-06 00:04:34,669 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:04:34,669 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:04:34,669 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:04:34,669 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:04:34,669 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable345 [2022-12-06 00:04:34,669 INFO L420 AbstractCegarLoop]: === Iteration 347 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:04:34,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:04:34,670 INFO L85 PathProgramCache]: Analyzing trace with hash 1948364930, now seen corresponding path program 1 times [2022-12-06 00:04:34,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:04:34,670 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110544353] [2022-12-06 00:04:34,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:04:34,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:04:34,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:04:34,741 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-06 00:04:34,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:04:34,742 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110544353] [2022-12-06 00:04:34,742 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2110544353] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:04:34,742 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:04:34,742 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:04:34,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860581287] [2022-12-06 00:04:34,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:04:34,742 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:04:34,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:04:34,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:04:34,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:04:34,743 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:04:34,743 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:04:34,743 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:04:34,743 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:04:34,743 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:04:35,028 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:04:35,028 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:04:35,034 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13554 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:04:35,041 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:04:35,041 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:04:35,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:04:35,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:04:35,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:04:35,042 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:04:35,042 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:04:35,042 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:04:35,076 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:04:35,077 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:35,077 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:04:35,078 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:04:35,078 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:04:35,078 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:35,078 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:04:35,078 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:04:35,079 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:35,079 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:35,115 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:04:35,115 INFO L131 PetriNetUnfolder]: For 3310/3519 co-relation queries the response was YES. [2022-12-06 00:04:35,117 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3310/3519 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2979 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:04:35,120 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:35,120 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:04:35,383 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:04:35,383 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 305 [2022-12-06 00:04:35,384 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:04:35,384 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:04:35,384 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:04:35,384 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:04:35,384 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable346 [2022-12-06 00:04:35,384 INFO L420 AbstractCegarLoop]: === Iteration 348 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:04:35,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:04:35,384 INFO L85 PathProgramCache]: Analyzing trace with hash -603792031, now seen corresponding path program 1 times [2022-12-06 00:04:35,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:04:35,385 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892176942] [2022-12-06 00:04:35,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:04:35,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:04:35,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:04:35,469 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-06 00:04:35,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:04:35,470 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892176942] [2022-12-06 00:04:35,470 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1892176942] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:04:35,470 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:04:35,470 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:04:35,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494351031] [2022-12-06 00:04:35,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:04:35,470 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:04:35,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:04:35,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:04:35,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:04:35,471 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:04:35,471 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:04:35,471 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:04:35,471 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:04:35,471 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:04:35,752 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:04:35,752 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:04:35,758 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13552 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:04:35,766 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:04:35,766 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:04:35,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:04:35,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:04:35,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:04:35,767 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:04:35,767 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:04:35,767 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:04:35,804 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:04:35,805 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:35,806 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:04:35,806 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:04:35,806 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:04:35,806 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:35,806 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:04:35,807 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:04:35,807 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:35,808 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:35,851 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:04:35,851 INFO L131 PetriNetUnfolder]: For 3301/3509 co-relation queries the response was YES. [2022-12-06 00:04:35,852 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3301/3509 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2990 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:04:35,854 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:35,854 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:04:36,023 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:04:36,024 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 218 [2022-12-06 00:04:36,024 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:04:36,024 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:04:36,024 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:04:36,024 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:04:36,024 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable347 [2022-12-06 00:04:36,024 INFO L420 AbstractCegarLoop]: === Iteration 349 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:04:36,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:04:36,025 INFO L85 PathProgramCache]: Analyzing trace with hash 1139018304, now seen corresponding path program 1 times [2022-12-06 00:04:36,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:04:36,025 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505832317] [2022-12-06 00:04:36,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:04:36,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:04:36,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:04:36,084 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-06 00:04:36,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:04:36,084 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505832317] [2022-12-06 00:04:36,084 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [505832317] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:04:36,084 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:04:36,084 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:04:36,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132414105] [2022-12-06 00:04:36,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:04:36,084 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:04:36,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:04:36,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:04:36,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:04:36,085 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:04:36,085 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:04:36,085 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:04:36,085 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:04:36,085 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:04:36,387 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:04:36,387 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 00:04:36,393 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13588 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:04:36,401 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:04:36,401 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:04:36,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:04:36,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:04:36,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:04:36,402 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:04:36,402 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:04:36,402 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:04:36,445 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:04:36,446 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:36,446 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:04:36,446 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:04:36,447 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:04:36,447 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:36,447 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:04:36,447 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:04:36,447 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:36,448 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:36,480 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:04:36,480 INFO L131 PetriNetUnfolder]: For 3338/3547 co-relation queries the response was YES. [2022-12-06 00:04:36,481 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3338/3547 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2984 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:04:36,483 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:36,483 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:04:36,640 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:04:36,640 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 193 [2022-12-06 00:04:36,641 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:04:36,641 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:04:36,641 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:04:36,641 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:04:36,641 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable348 [2022-12-06 00:04:36,641 INFO L420 AbstractCegarLoop]: === Iteration 350 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:04:36,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:04:36,641 INFO L85 PathProgramCache]: Analyzing trace with hash -1413138657, now seen corresponding path program 1 times [2022-12-06 00:04:36,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:04:36,641 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048581807] [2022-12-06 00:04:36,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:04:36,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:04:36,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:04:36,702 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-06 00:04:36,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:04:36,702 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048581807] [2022-12-06 00:04:36,702 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2048581807] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:04:36,702 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:04:36,702 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:04:36,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257239220] [2022-12-06 00:04:36,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:04:36,702 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:04:36,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:04:36,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:04:36,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:04:36,703 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:04:36,703 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:04:36,703 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:04:36,703 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:04:36,703 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:04:36,988 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:04:36,988 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:04:36,994 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13574 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:04:37,002 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:04:37,002 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:04:37,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:04:37,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:04:37,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:04:37,002 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:04:37,003 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:04:37,003 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:04:37,040 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:04:37,042 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:37,042 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:04:37,042 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:04:37,042 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:04:37,042 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:37,043 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:04:37,043 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:04:37,043 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:37,044 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:37,072 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:04:37,072 INFO L131 PetriNetUnfolder]: For 3304/3511 co-relation queries the response was YES. [2022-12-06 00:04:37,073 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3304/3511 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2993 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:04:37,075 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:37,075 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:04:37,231 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:04:37,232 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 190 [2022-12-06 00:04:37,232 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:04:37,232 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:04:37,232 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:04:37,232 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:04:37,232 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable349 [2022-12-06 00:04:37,232 INFO L420 AbstractCegarLoop]: === Iteration 351 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:04:37,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:04:37,233 INFO L85 PathProgramCache]: Analyzing trace with hash 329671678, now seen corresponding path program 1 times [2022-12-06 00:04:37,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:04:37,233 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091316605] [2022-12-06 00:04:37,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:04:37,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:04:37,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:04:37,297 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-06 00:04:37,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:04:37,297 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091316605] [2022-12-06 00:04:37,297 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2091316605] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:04:37,297 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:04:37,297 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:04:37,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080725808] [2022-12-06 00:04:37,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:04:37,298 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:04:37,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:04:37,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:04:37,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:04:37,298 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:04:37,298 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:04:37,298 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:04:37,298 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:04:37,298 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:04:37,603 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:04:37,603 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:04:37,608 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13545 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:04:37,613 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:04:37,614 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:04:37,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:04:37,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:04:37,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:04:37,614 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:04:37,614 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:04:37,614 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:04:37,648 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:04:37,649 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:37,649 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:04:37,650 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:04:37,650 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:04:37,650 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:37,650 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:04:37,650 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:04:37,650 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:37,651 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:37,676 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:04:37,676 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 00:04:37,677 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3321/3530 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2977 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:04:37,679 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:37,679 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:04:37,821 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:04:37,822 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 172 [2022-12-06 00:04:37,822 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:04:37,822 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:04:37,822 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:04:37,822 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:04:37,822 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable350 [2022-12-06 00:04:37,822 INFO L420 AbstractCegarLoop]: === Iteration 352 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:04:37,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:04:37,822 INFO L85 PathProgramCache]: Analyzing trace with hash 2072482013, now seen corresponding path program 1 times [2022-12-06 00:04:37,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:04:37,822 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746659757] [2022-12-06 00:04:37,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:04:37,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:04:37,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:04:37,880 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-06 00:04:37,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:04:37,881 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746659757] [2022-12-06 00:04:37,881 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1746659757] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:04:37,881 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:04:37,881 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:04:37,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523877436] [2022-12-06 00:04:37,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:04:37,881 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:04:37,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:04:37,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:04:37,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:04:37,882 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:04:37,882 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:04:37,882 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:04:37,882 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:04:37,882 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:04:38,167 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:04:38,168 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:04:38,173 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13559 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:04:38,180 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:04:38,180 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:04:38,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:04:38,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:04:38,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:04:38,181 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:04:38,181 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:04:38,181 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:04:38,216 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:04:38,217 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:38,217 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:04:38,217 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:04:38,217 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:04:38,217 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:38,218 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:04:38,218 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:04:38,218 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:38,218 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:38,243 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:04:38,243 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 00:04:38,244 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3312/3520 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2996 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:04:38,246 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:38,246 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:04:38,385 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:04:38,385 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 168 [2022-12-06 00:04:38,385 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:04:38,385 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:04:38,385 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:04:38,385 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:04:38,386 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable351 [2022-12-06 00:04:38,386 INFO L420 AbstractCegarLoop]: === Iteration 353 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:04:38,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:04:38,386 INFO L85 PathProgramCache]: Analyzing trace with hash -479674948, now seen corresponding path program 1 times [2022-12-06 00:04:38,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:04:38,386 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326434972] [2022-12-06 00:04:38,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:04:38,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:04:38,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:04:38,451 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-06 00:04:38,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:04:38,451 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326434972] [2022-12-06 00:04:38,451 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [326434972] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:04:38,452 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:04:38,452 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:04:38,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647106256] [2022-12-06 00:04:38,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:04:38,452 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:04:38,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:04:38,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:04:38,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:04:38,452 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:04:38,452 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:04:38,452 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:04:38,452 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:04:38,452 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:04:38,742 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:04:38,742 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:04:38,748 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13561 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:04:38,756 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:04:38,756 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:04:38,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:04:38,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:04:38,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:04:38,757 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:04:38,757 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:04:38,757 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:04:38,793 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:04:38,794 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:38,794 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:04:38,794 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:04:38,794 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:04:38,795 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:38,795 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:04:38,795 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:04:38,795 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:38,796 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:38,821 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:04:38,821 INFO L131 PetriNetUnfolder]: For 3338/3547 co-relation queries the response was YES. [2022-12-06 00:04:38,822 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3338/3547 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2984 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:04:38,824 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:38,824 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:04:38,995 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:04:38,996 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 202 [2022-12-06 00:04:38,996 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:04:38,996 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:04:38,996 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:04:38,996 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:04:38,996 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable352 [2022-12-06 00:04:38,996 INFO L420 AbstractCegarLoop]: === Iteration 354 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:04:38,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:04:38,996 INFO L85 PathProgramCache]: Analyzing trace with hash 1263135387, now seen corresponding path program 1 times [2022-12-06 00:04:38,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:04:38,996 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891489627] [2022-12-06 00:04:38,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:04:38,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:04:39,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:04:39,073 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-06 00:04:39,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:04:39,073 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891489627] [2022-12-06 00:04:39,073 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [891489627] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:04:39,074 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:04:39,074 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:04:39,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217743502] [2022-12-06 00:04:39,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:04:39,074 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:04:39,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:04:39,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:04:39,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:04:39,074 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:04:39,074 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:04:39,074 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:04:39,074 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:04:39,074 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:04:39,385 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:04:39,385 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:04:39,391 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13573 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:04:39,400 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:04:39,400 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:04:39,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:04:39,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:04:39,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:04:39,401 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:04:39,401 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:04:39,401 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:04:39,438 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:04:39,439 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:39,440 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:04:39,440 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:04:39,440 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:04:39,440 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:39,441 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:04:39,441 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:04:39,441 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:39,441 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:39,468 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:04:39,468 INFO L131 PetriNetUnfolder]: For 3309/3518 co-relation queries the response was YES. [2022-12-06 00:04:39,469 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3309/3518 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2959 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:04:39,471 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:39,471 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:04:39,652 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:04:39,652 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 212 [2022-12-06 00:04:39,652 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:04:39,652 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:04:39,652 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:04:39,652 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:04:39,653 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable353 [2022-12-06 00:04:39,653 INFO L420 AbstractCegarLoop]: === Iteration 355 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:04:39,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:04:39,653 INFO L85 PathProgramCache]: Analyzing trace with hash -1289021574, now seen corresponding path program 1 times [2022-12-06 00:04:39,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:04:39,653 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010103349] [2022-12-06 00:04:39,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:04:39,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:04:39,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:04:39,724 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-06 00:04:39,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:04:39,724 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010103349] [2022-12-06 00:04:39,724 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2010103349] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:04:39,725 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:04:39,725 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:04:39,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762292480] [2022-12-06 00:04:39,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:04:39,725 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:04:39,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:04:39,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:04:39,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:04:39,725 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:04:39,725 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:04:39,725 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:04:39,725 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:04:39,725 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:04:40,022 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:04:40,023 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 00:04:40,030 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26969/27014 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13543 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:04:40,040 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:04:40,040 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:04:40,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:04:40,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:04:40,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:04:40,041 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:04:40,041 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:04:40,041 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:04:40,089 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:04:40,090 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:40,091 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:04:40,091 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:04:40,091 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:04:40,091 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:40,092 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:04:40,092 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:04:40,092 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:40,092 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:40,121 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:04:40,121 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 00:04:40,122 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3133/3273 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2980 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:04:40,125 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:40,125 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:04:40,320 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:04:40,320 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 229 [2022-12-06 00:04:40,321 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:04:40,321 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:04:40,321 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:04:40,321 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:04:40,321 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable354 [2022-12-06 00:04:40,321 INFO L420 AbstractCegarLoop]: === Iteration 356 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:04:40,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:04:40,321 INFO L85 PathProgramCache]: Analyzing trace with hash 453788761, now seen corresponding path program 1 times [2022-12-06 00:04:40,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:04:40,321 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115211805] [2022-12-06 00:04:40,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:04:40,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:04:40,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:04:40,387 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-06 00:04:40,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:04:40,387 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115211805] [2022-12-06 00:04:40,387 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1115211805] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:04:40,387 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:04:40,387 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:04:40,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240155464] [2022-12-06 00:04:40,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:04:40,387 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:04:40,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:04:40,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:04:40,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:04:40,388 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:04:40,388 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:04:40,388 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:04:40,388 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:04:40,388 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:04:40,680 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:04:40,680 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 00:04:40,713 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26969/27014 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13522 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:04:40,720 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:04:40,720 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:04:40,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:04:40,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:04:40,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:04:40,721 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:04:40,721 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:04:40,721 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:04:40,750 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:04:40,751 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:40,751 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:04:40,752 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:04:40,752 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:04:40,752 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:40,752 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:04:40,752 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:04:40,752 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:40,753 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:40,777 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:04:40,778 INFO L131 PetriNetUnfolder]: For 3123/3264 co-relation queries the response was YES. [2022-12-06 00:04:40,779 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3123/3264 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2962 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:04:40,781 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:40,781 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:04:40,938 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:04:40,939 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 187 [2022-12-06 00:04:40,939 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:04:40,939 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:04:40,939 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:04:40,939 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:04:40,939 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable355 [2022-12-06 00:04:40,939 INFO L420 AbstractCegarLoop]: === Iteration 357 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:04:40,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:04:40,940 INFO L85 PathProgramCache]: Analyzing trace with hash -2098368200, now seen corresponding path program 1 times [2022-12-06 00:04:40,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:04:40,940 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787580793] [2022-12-06 00:04:40,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:04:40,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:04:40,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:04:40,998 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-06 00:04:40,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:04:40,998 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787580793] [2022-12-06 00:04:40,998 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1787580793] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:04:40,998 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:04:40,998 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:04:40,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070961949] [2022-12-06 00:04:40,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:04:40,999 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:04:40,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:04:40,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:04:40,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:04:40,999 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:04:40,999 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:04:40,999 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:04:40,999 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:04:40,999 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:04:41,290 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:04:41,290 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 00:04:41,296 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26969/27014 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13512 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:04:41,304 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:04:41,304 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:04:41,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:04:41,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:04:41,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:04:41,305 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:04:41,305 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:04:41,305 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:04:41,347 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:04:41,348 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:41,348 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:04:41,349 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:04:41,349 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:04:41,349 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:41,349 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:04:41,349 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:04:41,350 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:41,350 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:41,384 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:04:41,385 INFO L131 PetriNetUnfolder]: For 3146/3287 co-relation queries the response was YES. [2022-12-06 00:04:41,386 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3146/3287 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2979 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:04:41,389 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:41,389 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:04:41,558 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:04:41,558 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 209 [2022-12-06 00:04:41,559 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:04:41,559 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:04:41,559 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:04:41,559 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:04:41,559 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable356 [2022-12-06 00:04:41,559 INFO L420 AbstractCegarLoop]: === Iteration 358 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:04:41,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:04:41,559 INFO L85 PathProgramCache]: Analyzing trace with hash -355557865, now seen corresponding path program 1 times [2022-12-06 00:04:41,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:04:41,559 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940696145] [2022-12-06 00:04:41,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:04:41,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:04:41,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:04:41,647 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-06 00:04:41,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:04:41,647 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940696145] [2022-12-06 00:04:41,647 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [940696145] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:04:41,647 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:04:41,647 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:04:41,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174693347] [2022-12-06 00:04:41,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:04:41,648 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:04:41,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:04:41,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:04:41,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:04:41,648 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:04:41,648 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:04:41,648 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:04:41,648 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:04:41,648 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:04:41,957 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:04:41,957 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:04:41,962 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13554 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:04:41,969 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:04:41,969 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:04:41,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:04:41,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:04:41,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:04:41,970 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:04:41,970 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:04:41,970 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:04:42,004 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:04:42,006 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:42,006 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:04:42,006 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:04:42,006 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:04:42,006 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:42,007 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:04:42,007 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:04:42,007 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:42,007 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:42,032 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:04:42,032 INFO L131 PetriNetUnfolder]: For 3301/3509 co-relation queries the response was YES. [2022-12-06 00:04:42,033 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3301/3509 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2997 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:04:42,035 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:42,035 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:04:42,189 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:04:42,190 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 184 [2022-12-06 00:04:42,190 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:04:42,190 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:04:42,190 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:04:42,190 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:04:42,190 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable357 [2022-12-06 00:04:42,190 INFO L420 AbstractCegarLoop]: === Iteration 359 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:04:42,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:04:42,190 INFO L85 PathProgramCache]: Analyzing trace with hash 1387252470, now seen corresponding path program 1 times [2022-12-06 00:04:42,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:04:42,190 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353350629] [2022-12-06 00:04:42,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:04:42,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:04:42,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:04:42,249 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-06 00:04:42,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:04:42,249 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353350629] [2022-12-06 00:04:42,249 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1353350629] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:04:42,249 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:04:42,249 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:04:42,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739930272] [2022-12-06 00:04:42,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:04:42,250 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:04:42,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:04:42,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:04:42,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:04:42,250 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:04:42,250 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:04:42,250 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:04:42,250 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:04:42,250 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:04:42,532 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:04:42,533 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 00:04:42,538 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13564 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:04:42,546 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:04:42,546 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:04:42,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:04:42,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:04:42,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:04:42,547 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:04:42,547 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:04:42,547 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:04:42,581 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:04:42,582 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:42,582 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:04:42,582 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:04:42,582 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:04:42,582 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:42,583 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:04:42,583 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:04:42,583 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:42,584 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:42,607 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:04:42,608 INFO L131 PetriNetUnfolder]: For 3301/3509 co-relation queries the response was YES. [2022-12-06 00:04:42,609 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3301/3509 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2986 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:04:42,610 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:42,611 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:04:42,768 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:04:42,769 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 187 [2022-12-06 00:04:42,769 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:04:42,769 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:04:42,769 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:04:42,769 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:04:42,769 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable358 [2022-12-06 00:04:42,770 INFO L420 AbstractCegarLoop]: === Iteration 360 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:04:42,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:04:42,770 INFO L85 PathProgramCache]: Analyzing trace with hash -1164904491, now seen corresponding path program 1 times [2022-12-06 00:04:42,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:04:42,770 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24991265] [2022-12-06 00:04:42,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:04:42,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:04:42,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:04:42,833 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:04:42,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:04:42,833 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24991265] [2022-12-06 00:04:42,834 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [24991265] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:04:42,834 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:04:42,834 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:04:42,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497548558] [2022-12-06 00:04:42,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:04:42,834 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:04:42,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:04:42,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:04:42,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:04:42,835 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:04:42,835 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:04:42,835 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:04:42,835 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:04:42,835 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:04:43,244 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:04:43,244 INFO L131 PetriNetUnfolder]: For 27136/27181 co-relation queries the response was YES. [2022-12-06 00:04:43,252 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27136/27181 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13518 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:04:43,262 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:04:43,262 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:04:43,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:04:43,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:04:43,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:04:43,263 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:04:43,263 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:04:43,263 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:04:43,308 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:04:43,310 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:43,310 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:04:43,310 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:04:43,310 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:04:43,310 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:43,311 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:04:43,311 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:04:43,311 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:43,312 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:43,343 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:04:43,343 INFO L131 PetriNetUnfolder]: For 3167/3307 co-relation queries the response was YES. [2022-12-06 00:04:43,345 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3167/3307 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2984 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:04:43,347 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:43,347 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:04:43,570 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:04:43,571 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 261 [2022-12-06 00:04:43,571 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:04:43,571 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:04:43,571 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:04:43,571 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:04:43,571 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable359 [2022-12-06 00:04:43,571 INFO L420 AbstractCegarLoop]: === Iteration 361 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:04:43,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:04:43,572 INFO L85 PathProgramCache]: Analyzing trace with hash 577905844, now seen corresponding path program 1 times [2022-12-06 00:04:43,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:04:43,572 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058920669] [2022-12-06 00:04:43,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:04:43,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:04:43,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:04:43,649 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-06 00:04:43,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:04:43,650 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058920669] [2022-12-06 00:04:43,650 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1058920669] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:04:43,650 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:04:43,650 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:04:43,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704268163] [2022-12-06 00:04:43,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:04:43,650 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:04:43,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:04:43,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:04:43,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:04:43,651 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:04:43,651 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:04:43,651 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:04:43,651 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:04:43,651 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:04:44,033 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:04:44,034 INFO L131 PetriNetUnfolder]: For 27229/27274 co-relation queries the response was YES. [2022-12-06 00:04:44,042 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27229/27274 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13576 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:04:44,053 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:04:44,053 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:04:44,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:04:44,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:04:44,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:04:44,054 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:04:44,054 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:04:44,054 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:04:44,105 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:04:44,106 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:44,106 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:04:44,106 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:04:44,107 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:04:44,107 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:44,107 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:04:44,107 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:04:44,107 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:44,108 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:44,139 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:04:44,140 INFO L131 PetriNetUnfolder]: For 3348/3558 co-relation queries the response was YES. [2022-12-06 00:04:44,141 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3348/3558 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2996 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:04:44,144 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:44,144 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:04:44,350 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:04:44,351 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 244 [2022-12-06 00:04:44,351 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:04:44,351 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:04:44,351 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:04:44,351 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:04:44,351 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable360 [2022-12-06 00:04:44,351 INFO L420 AbstractCegarLoop]: === Iteration 362 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:04:44,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:04:44,352 INFO L85 PathProgramCache]: Analyzing trace with hash -1974251117, now seen corresponding path program 1 times [2022-12-06 00:04:44,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:04:44,352 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749973502] [2022-12-06 00:04:44,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:04:44,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:04:44,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:04:44,424 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-06 00:04:44,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:04:44,425 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749973502] [2022-12-06 00:04:44,425 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1749973502] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:04:44,425 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:04:44,425 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:04:44,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320371868] [2022-12-06 00:04:44,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:04:44,425 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:04:44,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:04:44,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:04:44,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:04:44,426 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:04:44,426 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:04:44,426 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:04:44,426 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:04:44,426 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:04:44,785 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:04:44,785 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 00:04:44,794 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26969/27014 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13532 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:04:44,804 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:04:44,805 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:04:44,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:04:44,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:04:44,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:04:44,805 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:04:44,805 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:04:44,806 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:04:44,853 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:04:44,854 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:44,854 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:04:44,854 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:04:44,855 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:04:44,855 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:44,855 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:04:44,855 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:04:44,855 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:44,856 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:44,888 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:04:44,888 INFO L131 PetriNetUnfolder]: For 3134/3275 co-relation queries the response was YES. [2022-12-06 00:04:44,890 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3134/3275 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2984 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:04:44,892 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:44,893 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:04:45,078 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:04:45,079 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 224 [2022-12-06 00:04:45,079 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:04:45,079 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:04:45,079 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:04:45,079 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:04:45,079 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable361 [2022-12-06 00:04:45,080 INFO L420 AbstractCegarLoop]: === Iteration 363 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:04:45,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:04:45,080 INFO L85 PathProgramCache]: Analyzing trace with hash -231440782, now seen corresponding path program 1 times [2022-12-06 00:04:45,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:04:45,080 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338601569] [2022-12-06 00:04:45,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:04:45,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:04:45,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:04:45,164 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-06 00:04:45,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:04:45,165 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338601569] [2022-12-06 00:04:45,165 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1338601569] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:04:45,165 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:04:45,165 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:04:45,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794321623] [2022-12-06 00:04:45,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:04:45,165 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:04:45,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:04:45,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:04:45,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:04:45,166 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:04:45,166 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:04:45,166 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:04:45,166 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:04:45,166 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:04:45,535 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:04:45,535 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 00:04:45,543 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26969/27014 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13549 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:04:45,554 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:04:45,555 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:04:45,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:04:45,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:04:45,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:04:45,555 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:04:45,555 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:04:45,556 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:04:45,602 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:04:45,604 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:45,604 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:04:45,604 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:04:45,604 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:04:45,604 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:45,605 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:04:45,605 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:04:45,605 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:45,606 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:45,638 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:04:45,638 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 00:04:45,640 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3133/3273 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2969 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:04:45,643 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:45,643 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:04:45,829 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:04:45,830 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 226 [2022-12-06 00:04:45,830 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:04:45,830 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:04:45,830 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:04:45,830 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:04:45,830 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable362 [2022-12-06 00:04:45,830 INFO L420 AbstractCegarLoop]: === Iteration 364 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:04:45,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:04:45,831 INFO L85 PathProgramCache]: Analyzing trace with hash 1511369553, now seen corresponding path program 1 times [2022-12-06 00:04:45,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:04:45,831 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426215624] [2022-12-06 00:04:45,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:04:45,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:04:45,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:04:45,902 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-06 00:04:45,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:04:45,902 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426215624] [2022-12-06 00:04:45,902 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [426215624] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:04:45,902 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:04:45,902 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:04:45,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247523762] [2022-12-06 00:04:45,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:04:45,903 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:04:45,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:04:45,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:04:45,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:04:45,903 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:04:45,903 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:04:45,903 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:04:45,903 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:04:45,904 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:04:46,271 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:04:46,271 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:04:46,276 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13551 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:04:46,284 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:04:46,284 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:04:46,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:04:46,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:04:46,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:04:46,285 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:04:46,285 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:04:46,285 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:04:46,325 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:04:46,326 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:46,327 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:04:46,327 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:04:46,327 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:04:46,327 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:46,328 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:04:46,328 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:04:46,328 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:46,329 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:46,362 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:04:46,362 INFO L131 PetriNetUnfolder]: For 3301/3509 co-relation queries the response was YES. [2022-12-06 00:04:46,363 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3301/3509 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2990 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:04:46,366 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:46,366 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:04:46,560 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:04:46,561 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 234 [2022-12-06 00:04:46,561 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:04:46,561 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:04:46,561 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:04:46,561 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:04:46,561 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable363 [2022-12-06 00:04:46,561 INFO L420 AbstractCegarLoop]: === Iteration 365 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:04:46,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:04:46,562 INFO L85 PathProgramCache]: Analyzing trace with hash -1040787408, now seen corresponding path program 1 times [2022-12-06 00:04:46,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:04:46,562 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419603286] [2022-12-06 00:04:46,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:04:46,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:04:46,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:04:46,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-06 00:04:46,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:04:46,633 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419603286] [2022-12-06 00:04:46,633 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1419603286] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:04:46,633 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:04:46,633 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:04:46,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128540789] [2022-12-06 00:04:46,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:04:46,633 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:04:46,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:04:46,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:04:46,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:04:46,634 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:04:46,634 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:04:46,634 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:04:46,634 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:04:46,634 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:04:46,971 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:04:46,971 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 00:04:46,979 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13543 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:04:46,989 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:04:46,989 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:04:46,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:04:46,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:04:46,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:04:46,990 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:04:46,990 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:04:46,990 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:04:47,037 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:04:47,039 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:47,039 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:04:47,039 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:04:47,039 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:04:47,039 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:47,040 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:04:47,040 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:04:47,040 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:47,041 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:47,072 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:04:47,072 INFO L131 PetriNetUnfolder]: For 3338/3547 co-relation queries the response was YES. [2022-12-06 00:04:47,073 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3338/3547 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2988 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:04:47,076 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:47,076 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:04:47,244 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:04:47,245 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 206 [2022-12-06 00:04:47,245 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:04:47,245 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:04:47,245 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:04:47,246 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:04:47,246 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable364 [2022-12-06 00:04:47,246 INFO L420 AbstractCegarLoop]: === Iteration 366 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:04:47,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:04:47,246 INFO L85 PathProgramCache]: Analyzing trace with hash 702022927, now seen corresponding path program 1 times [2022-12-06 00:04:47,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:04:47,246 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542923768] [2022-12-06 00:04:47,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:04:47,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:04:47,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:04:47,327 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-06 00:04:47,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:04:47,327 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542923768] [2022-12-06 00:04:47,327 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1542923768] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:04:47,327 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:04:47,327 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:04:47,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871029039] [2022-12-06 00:04:47,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:04:47,328 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:04:47,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:04:47,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:04:47,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:04:47,328 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:04:47,328 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:04:47,328 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:04:47,328 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:04:47,329 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:04:47,699 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:04:47,699 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 00:04:47,706 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26969/27014 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13525 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:04:47,715 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:04:47,716 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:04:47,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:04:47,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:04:47,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:04:47,716 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:04:47,717 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:04:47,717 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:04:47,762 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:04:47,763 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:47,763 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:04:47,763 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:04:47,763 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:04:47,763 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:47,764 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:04:47,764 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:04:47,764 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:47,765 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:47,796 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:04:47,796 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 00:04:47,798 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3133/3273 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2979 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:04:47,800 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:47,801 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:04:47,986 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:04:47,986 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 223 [2022-12-06 00:04:47,986 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:04:47,986 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:04:47,986 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:04:47,987 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:04:47,987 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable365 [2022-12-06 00:04:47,987 INFO L420 AbstractCegarLoop]: === Iteration 367 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:04:47,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:04:47,987 INFO L85 PathProgramCache]: Analyzing trace with hash -1850134034, now seen corresponding path program 1 times [2022-12-06 00:04:47,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:04:47,987 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264654079] [2022-12-06 00:04:47,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:04:47,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:04:48,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:04:48,072 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-06 00:04:48,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:04:48,072 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264654079] [2022-12-06 00:04:48,072 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1264654079] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:04:48,072 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:04:48,072 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:04:48,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149862024] [2022-12-06 00:04:48,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:04:48,073 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:04:48,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:04:48,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:04:48,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:04:48,073 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:04:48,073 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:04:48,073 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:04:48,073 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:04:48,074 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:04:48,441 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:04:48,441 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:04:48,449 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13560 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:04:48,459 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:04:48,460 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:04:48,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:04:48,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:04:48,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:04:48,460 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:04:48,460 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:04:48,460 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:04:48,495 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:04:48,497 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:48,497 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:04:48,497 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:04:48,497 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:04:48,497 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:48,497 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:04:48,497 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:04:48,498 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:48,498 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:48,523 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:04:48,523 INFO L131 PetriNetUnfolder]: For 3310/3519 co-relation queries the response was YES. [2022-12-06 00:04:48,524 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3310/3519 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2977 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:04:48,526 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:48,526 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:04:48,694 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:04:48,694 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 197 [2022-12-06 00:04:48,694 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:04:48,694 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:04:48,694 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:04:48,694 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:04:48,695 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable366 [2022-12-06 00:04:48,695 INFO L420 AbstractCegarLoop]: === Iteration 368 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:04:48,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:04:48,695 INFO L85 PathProgramCache]: Analyzing trace with hash -107323699, now seen corresponding path program 1 times [2022-12-06 00:04:48,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:04:48,695 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386868667] [2022-12-06 00:04:48,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:04:48,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:04:48,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:04:48,764 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-06 00:04:48,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:04:48,764 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386868667] [2022-12-06 00:04:48,764 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1386868667] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:04:48,764 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:04:48,764 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:04:48,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421043495] [2022-12-06 00:04:48,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:04:48,764 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:04:48,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:04:48,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:04:48,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:04:48,765 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:04:48,765 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:04:48,765 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:04:48,765 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:04:48,765 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:04:49,043 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:04:49,043 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:04:49,048 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13573 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:04:49,055 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:04:49,056 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:04:49,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:04:49,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:04:49,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:04:49,056 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:04:49,056 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:04:49,056 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:04:49,091 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:04:49,092 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:49,092 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:04:49,092 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:04:49,092 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:04:49,092 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:49,093 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:04:49,093 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:04:49,093 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:49,093 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:49,118 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:04:49,118 INFO L131 PetriNetUnfolder]: For 3301/3509 co-relation queries the response was YES. [2022-12-06 00:04:49,119 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3301/3509 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2979 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:04:49,121 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:49,121 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:04:49,268 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:04:49,269 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 177 [2022-12-06 00:04:49,269 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:04:49,269 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:04:49,269 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:04:49,269 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:04:49,269 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable367 [2022-12-06 00:04:49,269 INFO L420 AbstractCegarLoop]: === Iteration 369 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:04:49,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:04:49,269 INFO L85 PathProgramCache]: Analyzing trace with hash 1635486636, now seen corresponding path program 1 times [2022-12-06 00:04:49,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:04:49,269 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453297388] [2022-12-06 00:04:49,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:04:49,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:04:49,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:04:49,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-06 00:04:49,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:04:49,337 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453297388] [2022-12-06 00:04:49,337 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [453297388] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:04:49,337 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:04:49,337 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:04:49,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192458953] [2022-12-06 00:04:49,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:04:49,337 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:04:49,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:04:49,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:04:49,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:04:49,337 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:04:49,337 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:04:49,338 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:04:49,338 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:04:49,338 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:04:49,645 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:04:49,645 INFO L131 PetriNetUnfolder]: For 27136/27181 co-relation queries the response was YES. [2022-12-06 00:04:49,652 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27136/27181 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13529 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:04:49,661 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:04:49,662 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:04:49,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:04:49,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:04:49,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:04:49,663 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:04:49,663 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:04:49,663 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:04:49,723 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:04:49,724 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:49,724 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:04:49,724 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:04:49,724 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:04:49,724 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:49,725 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:04:49,725 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:04:49,725 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:49,725 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:49,749 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:04:49,750 INFO L131 PetriNetUnfolder]: For 3169/3310 co-relation queries the response was YES. [2022-12-06 00:04:49,750 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3169/3310 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2997 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:04:49,752 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:49,752 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:04:49,903 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:04:49,904 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 180 [2022-12-06 00:04:49,904 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:04:49,904 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:04:49,904 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:04:49,904 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:04:49,904 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable368 [2022-12-06 00:04:49,904 INFO L420 AbstractCegarLoop]: === Iteration 370 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:04:49,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:04:49,905 INFO L85 PathProgramCache]: Analyzing trace with hash -916670325, now seen corresponding path program 1 times [2022-12-06 00:04:49,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:04:49,905 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766387769] [2022-12-06 00:04:49,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:04:49,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:04:49,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:04:49,959 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-06 00:04:49,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:04:49,959 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766387769] [2022-12-06 00:04:49,959 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [766387769] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:04:49,959 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:04:49,959 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:04:49,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156791381] [2022-12-06 00:04:49,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:04:49,959 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:04:49,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:04:49,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:04:49,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:04:49,960 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:04:49,960 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:04:49,960 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:04:49,960 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:04:49,960 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:04:50,234 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:04:50,235 INFO L131 PetriNetUnfolder]: For 27136/27181 co-relation queries the response was YES. [2022-12-06 00:04:50,240 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27136/27181 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13556 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:04:50,248 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:04:50,248 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:04:50,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:04:50,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:04:50,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:04:50,249 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:04:50,249 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:04:50,249 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:04:50,283 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:04:50,284 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:50,284 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:04:50,284 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:04:50,284 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:04:50,284 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:50,285 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:04:50,285 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:04:50,285 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:50,285 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:50,309 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:04:50,309 INFO L131 PetriNetUnfolder]: For 3156/3296 co-relation queries the response was YES. [2022-12-06 00:04:50,310 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3156/3296 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2999 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:04:50,312 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:50,312 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:04:50,472 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:04:50,473 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 189 [2022-12-06 00:04:50,473 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:04:50,473 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:04:50,473 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:04:50,473 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:04:50,473 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable369 [2022-12-06 00:04:50,473 INFO L420 AbstractCegarLoop]: === Iteration 371 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:04:50,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:04:50,473 INFO L85 PathProgramCache]: Analyzing trace with hash 826140010, now seen corresponding path program 1 times [2022-12-06 00:04:50,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:04:50,473 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086502153] [2022-12-06 00:04:50,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:04:50,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:04:50,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:04:50,527 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-06 00:04:50,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:04:50,527 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086502153] [2022-12-06 00:04:50,528 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2086502153] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:04:50,528 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:04:50,528 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:04:50,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588917371] [2022-12-06 00:04:50,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:04:50,528 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:04:50,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:04:50,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:04:50,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:04:50,528 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:04:50,528 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:04:50,528 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:04:50,528 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:04:50,528 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:04:50,811 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:04:50,811 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 00:04:50,817 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13577 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:04:50,827 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:04:50,827 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:04:50,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:04:50,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:04:50,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:04:50,828 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:04:50,828 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:04:50,828 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:04:50,873 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:04:50,875 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:50,875 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:04:50,875 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:04:50,875 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:04:50,875 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:50,876 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:04:50,876 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:04:50,876 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:50,877 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:50,907 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:04:50,908 INFO L131 PetriNetUnfolder]: For 3318/3528 co-relation queries the response was YES. [2022-12-06 00:04:50,909 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3318/3528 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2973 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:04:50,911 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:50,911 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:04:51,078 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:04:51,079 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 204 [2022-12-06 00:04:51,079 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:04:51,079 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:04:51,079 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:04:51,079 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:04:51,079 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable370 [2022-12-06 00:04:51,079 INFO L420 AbstractCegarLoop]: === Iteration 372 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:04:51,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:04:51,080 INFO L85 PathProgramCache]: Analyzing trace with hash -1726016951, now seen corresponding path program 1 times [2022-12-06 00:04:51,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:04:51,080 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199270128] [2022-12-06 00:04:51,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:04:51,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:04:51,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:04:51,146 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-06 00:04:51,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:04:51,146 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199270128] [2022-12-06 00:04:51,146 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1199270128] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:04:51,146 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:04:51,146 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:04:51,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928873196] [2022-12-06 00:04:51,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:04:51,147 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:04:51,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:04:51,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:04:51,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:04:51,147 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:04:51,147 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:04:51,147 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:04:51,147 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:04:51,147 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:04:51,461 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:04:51,461 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:04:51,467 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13580 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:04:51,474 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:04:51,474 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:04:51,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:04:51,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:04:51,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:04:51,475 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:04:51,475 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:04:51,475 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:04:51,508 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:04:51,509 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:51,509 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:04:51,509 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:04:51,509 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:04:51,509 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:51,510 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:04:51,510 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:04:51,510 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:51,511 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:51,536 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:04:51,537 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 00:04:51,538 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3312/3520 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2992 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:04:51,540 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:51,540 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:04:51,694 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:04:51,695 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 186 [2022-12-06 00:04:51,695 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:04:51,695 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:04:51,695 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:04:51,695 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:04:51,695 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable371 [2022-12-06 00:04:51,695 INFO L420 AbstractCegarLoop]: === Iteration 373 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:04:51,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:04:51,695 INFO L85 PathProgramCache]: Analyzing trace with hash 16793384, now seen corresponding path program 1 times [2022-12-06 00:04:51,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:04:51,695 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266647581] [2022-12-06 00:04:51,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:04:51,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:04:51,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:04:51,761 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-06 00:04:51,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:04:51,761 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266647581] [2022-12-06 00:04:51,761 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1266647581] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:04:51,761 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:04:51,761 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:04:51,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491110416] [2022-12-06 00:04:51,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:04:51,761 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:04:51,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:04:51,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:04:51,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:04:51,762 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:04:51,762 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:04:51,762 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:04:51,762 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:04:51,762 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:04:52,055 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:04:52,055 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:04:52,061 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13560 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:04:52,070 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:04:52,070 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:04:52,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:04:52,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:04:52,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:04:52,071 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:04:52,071 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:04:52,071 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:04:52,108 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:04:52,109 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:52,109 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:04:52,110 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:04:52,110 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:04:52,110 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:52,110 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:04:52,110 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:04:52,110 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:52,111 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:52,138 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:04:52,138 INFO L131 PetriNetUnfolder]: For 3327/3536 co-relation queries the response was YES. [2022-12-06 00:04:52,139 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3327/3536 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2985 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:04:52,141 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:52,141 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:04:52,291 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:04:52,292 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 182 [2022-12-06 00:04:52,292 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:04:52,292 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:04:52,292 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:04:52,292 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:04:52,292 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable372 [2022-12-06 00:04:52,292 INFO L420 AbstractCegarLoop]: === Iteration 374 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:04:52,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:04:52,292 INFO L85 PathProgramCache]: Analyzing trace with hash 1759603719, now seen corresponding path program 1 times [2022-12-06 00:04:52,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:04:52,292 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785410082] [2022-12-06 00:04:52,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:04:52,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:04:52,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:04:52,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-06 00:04:52,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:04:52,358 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785410082] [2022-12-06 00:04:52,358 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [785410082] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:04:52,358 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:04:52,358 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:04:52,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766396845] [2022-12-06 00:04:52,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:04:52,359 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:04:52,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:04:52,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:04:52,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:04:52,359 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:04:52,359 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:04:52,359 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:04:52,359 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:04:52,359 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:04:52,635 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:04:52,635 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 00:04:52,640 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13585 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:04:52,647 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:04:52,648 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:04:52,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:04:52,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:04:52,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:04:52,648 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:04:52,648 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:04:52,648 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:04:52,685 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:04:52,686 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:52,686 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:04:52,686 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:04:52,687 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:04:52,687 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:52,687 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:04:52,687 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:04:52,687 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:52,688 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:52,716 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:04:52,716 INFO L131 PetriNetUnfolder]: For 3304/3511 co-relation queries the response was YES. [2022-12-06 00:04:52,717 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3304/3511 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2991 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:04:52,719 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:52,719 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:04:52,873 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:04:52,874 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 187 [2022-12-06 00:04:52,874 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:04:52,874 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:04:52,874 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:04:52,874 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:04:52,874 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable373 [2022-12-06 00:04:52,874 INFO L420 AbstractCegarLoop]: === Iteration 375 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:04:52,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:04:52,874 INFO L85 PathProgramCache]: Analyzing trace with hash -792553242, now seen corresponding path program 1 times [2022-12-06 00:04:52,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:04:52,874 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586149498] [2022-12-06 00:04:52,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:04:52,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:04:52,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:04:52,940 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-06 00:04:52,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:04:52,940 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586149498] [2022-12-06 00:04:52,940 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [586149498] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:04:52,941 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:04:52,941 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:04:52,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478405924] [2022-12-06 00:04:52,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:04:52,941 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:04:52,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:04:52,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:04:52,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:04:52,941 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:04:52,941 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:04:52,941 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:04:52,941 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:04:52,941 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:04:53,241 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:04:53,241 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:04:53,247 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13564 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:04:53,256 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:04:53,256 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:04:53,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:04:53,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:04:53,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:04:53,257 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:04:53,257 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:04:53,257 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:04:53,295 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:04:53,296 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:53,296 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:04:53,296 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:04:53,296 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:04:53,296 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:53,297 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:04:53,297 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:04:53,297 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:53,297 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:53,323 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:04:53,323 INFO L131 PetriNetUnfolder]: For 3301/3509 co-relation queries the response was YES. [2022-12-06 00:04:53,324 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3301/3509 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2995 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:04:53,326 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:53,326 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:04:53,479 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:04:53,480 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 184 [2022-12-06 00:04:53,480 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:04:53,480 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:04:53,480 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:04:53,480 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:04:53,480 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable374 [2022-12-06 00:04:53,480 INFO L420 AbstractCegarLoop]: === Iteration 376 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:04:53,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:04:53,480 INFO L85 PathProgramCache]: Analyzing trace with hash 950257093, now seen corresponding path program 1 times [2022-12-06 00:04:53,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:04:53,480 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497635952] [2022-12-06 00:04:53,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:04:53,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:04:53,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:04:53,554 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-06 00:04:53,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:04:53,554 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497635952] [2022-12-06 00:04:53,554 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1497635952] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:04:53,554 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:04:53,554 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:04:53,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908117626] [2022-12-06 00:04:53,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:04:53,554 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:04:53,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:04:53,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:04:53,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:04:53,555 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:04:53,555 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:04:53,555 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:04:53,555 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:04:53,555 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:04:53,838 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:04:53,838 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:04:53,844 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13571 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:04:53,851 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:04:53,851 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:04:53,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:04:53,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:04:53,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:04:53,852 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:04:53,852 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:04:53,852 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:04:53,886 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:04:53,887 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:53,887 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:04:53,887 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:04:53,887 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:04:53,887 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:53,888 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:04:53,888 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:04:53,888 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:53,889 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:53,917 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:04:53,917 INFO L131 PetriNetUnfolder]: For 3301/3509 co-relation queries the response was YES. [2022-12-06 00:04:53,918 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3301/3509 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2986 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:04:53,920 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:53,920 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:04:54,080 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:04:54,080 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 193 [2022-12-06 00:04:54,080 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:04:54,080 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:04:54,080 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:04:54,080 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:04:54,081 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable375 [2022-12-06 00:04:54,081 INFO L420 AbstractCegarLoop]: === Iteration 377 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:04:54,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:04:54,081 INFO L85 PathProgramCache]: Analyzing trace with hash -1601899868, now seen corresponding path program 1 times [2022-12-06 00:04:54,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:04:54,081 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77930571] [2022-12-06 00:04:54,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:04:54,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:04:54,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:04:54,147 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-06 00:04:54,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:04:54,148 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77930571] [2022-12-06 00:04:54,148 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [77930571] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:04:54,148 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:04:54,148 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:04:54,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490463702] [2022-12-06 00:04:54,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:04:54,148 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:04:54,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:04:54,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:04:54,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:04:54,149 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:04:54,149 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:04:54,149 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:04:54,149 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:04:54,149 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:04:54,451 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:04:54,451 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:04:54,456 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13568 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:04:54,463 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:04:54,463 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:04:54,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:04:54,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:04:54,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:04:54,465 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:04:54,465 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:04:54,465 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:04:54,496 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:04:54,497 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:54,497 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:04:54,497 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:04:54,497 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:04:54,497 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:54,498 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:04:54,498 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:04:54,498 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:54,499 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:54,524 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:04:54,525 INFO L131 PetriNetUnfolder]: For 3327/3536 co-relation queries the response was YES. [2022-12-06 00:04:54,526 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3327/3536 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2992 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:04:54,528 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:54,528 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:04:54,701 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:04:54,701 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 204 [2022-12-06 00:04:54,701 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:04:54,701 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:04:54,701 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:04:54,701 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:04:54,702 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable376 [2022-12-06 00:04:54,702 INFO L420 AbstractCegarLoop]: === Iteration 378 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:04:54,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:04:54,702 INFO L85 PathProgramCache]: Analyzing trace with hash 140910467, now seen corresponding path program 1 times [2022-12-06 00:04:54,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:04:54,702 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385955453] [2022-12-06 00:04:54,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:04:54,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:04:54,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:04:54,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-06 00:04:54,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:04:54,759 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385955453] [2022-12-06 00:04:54,759 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1385955453] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:04:54,759 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:04:54,759 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:04:54,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435262528] [2022-12-06 00:04:54,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:04:54,759 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:04:54,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:04:54,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:04:54,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:04:54,759 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:04:54,759 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:04:54,759 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:04:54,760 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:04:54,760 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:04:55,061 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:04:55,061 INFO L131 PetriNetUnfolder]: For 27136/27181 co-relation queries the response was YES. [2022-12-06 00:04:55,067 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27136/27181 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13560 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:04:55,076 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:04:55,076 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:04:55,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:04:55,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:04:55,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:04:55,077 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:04:55,077 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:04:55,077 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:04:55,113 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:04:55,114 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:55,114 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:04:55,114 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:04:55,114 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:04:55,114 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:55,115 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:04:55,115 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:04:55,115 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:55,116 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:55,142 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:04:55,142 INFO L131 PetriNetUnfolder]: For 3146/3287 co-relation queries the response was YES. [2022-12-06 00:04:55,143 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3146/3287 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 3012 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:04:55,145 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:55,145 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:04:55,306 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:04:55,308 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 194 [2022-12-06 00:04:55,308 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:04:55,308 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:04:55,308 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:04:55,308 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:04:55,308 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable377 [2022-12-06 00:04:55,308 INFO L420 AbstractCegarLoop]: === Iteration 379 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:04:55,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:04:55,309 INFO L85 PathProgramCache]: Analyzing trace with hash 1883720802, now seen corresponding path program 1 times [2022-12-06 00:04:55,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:04:55,309 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331990372] [2022-12-06 00:04:55,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:04:55,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:04:55,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:04:55,375 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-06 00:04:55,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:04:55,376 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331990372] [2022-12-06 00:04:55,376 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1331990372] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:04:55,376 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:04:55,376 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:04:55,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132089597] [2022-12-06 00:04:55,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:04:55,376 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:04:55,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:04:55,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:04:55,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:04:55,376 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:04:55,377 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:04:55,377 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:04:55,377 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:04:55,377 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:04:55,687 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:04:55,687 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:04:55,693 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13545 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:04:55,700 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:04:55,700 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:04:55,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:04:55,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:04:55,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:04:55,701 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:04:55,701 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:04:55,701 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:04:55,738 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:04:55,739 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:55,739 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:04:55,740 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:04:55,740 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:04:55,740 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:55,740 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:04:55,740 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:04:55,740 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:55,741 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:55,765 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:04:55,765 INFO L131 PetriNetUnfolder]: For 3318/3528 co-relation queries the response was YES. [2022-12-06 00:04:55,766 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3318/3528 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2981 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:04:55,768 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:55,768 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:04:55,931 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:04:55,931 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 191 [2022-12-06 00:04:55,931 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:04:55,932 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:04:55,932 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:04:55,932 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:04:55,932 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable378 [2022-12-06 00:04:55,932 INFO L420 AbstractCegarLoop]: === Iteration 380 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:04:55,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:04:55,932 INFO L85 PathProgramCache]: Analyzing trace with hash -668436159, now seen corresponding path program 1 times [2022-12-06 00:04:55,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:04:55,932 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485742440] [2022-12-06 00:04:55,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:04:55,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:04:55,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:04:56,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-06 00:04:56,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:04:56,004 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485742440] [2022-12-06 00:04:56,004 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [485742440] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:04:56,004 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:04:56,004 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:04:56,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989745186] [2022-12-06 00:04:56,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:04:56,005 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:04:56,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:04:56,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:04:56,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:04:56,005 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:04:56,005 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:04:56,005 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:04:56,005 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:04:56,005 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:04:56,301 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:04:56,301 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:04:56,307 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13556 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:04:56,315 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:04:56,315 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:04:56,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:04:56,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:04:56,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:04:56,316 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:04:56,316 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:04:56,316 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:04:56,363 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:04:56,365 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:56,365 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:04:56,365 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:04:56,365 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:04:56,365 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:56,366 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:04:56,366 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:04:56,366 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:56,367 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:56,398 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:04:56,398 INFO L131 PetriNetUnfolder]: For 3310/3519 co-relation queries the response was YES. [2022-12-06 00:04:56,400 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3310/3519 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2983 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:04:56,402 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:56,402 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:04:56,591 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:04:56,592 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 227 [2022-12-06 00:04:56,592 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:04:56,592 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:04:56,592 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:04:56,592 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:04:56,592 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable379 [2022-12-06 00:04:56,592 INFO L420 AbstractCegarLoop]: === Iteration 381 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:04:56,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:04:56,593 INFO L85 PathProgramCache]: Analyzing trace with hash 1074374176, now seen corresponding path program 1 times [2022-12-06 00:04:56,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:04:56,593 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192573656] [2022-12-06 00:04:56,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:04:56,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:04:56,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:04:56,668 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-06 00:04:56,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:04:56,669 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192573656] [2022-12-06 00:04:56,669 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1192573656] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:04:56,669 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:04:56,669 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:04:56,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987632255] [2022-12-06 00:04:56,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:04:56,669 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:04:56,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:04:56,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:04:56,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:04:56,670 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:04:56,670 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:04:56,670 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:04:56,670 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:04:56,670 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:04:56,988 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:04:56,989 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 00:04:56,994 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13587 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:04:57,002 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:04:57,002 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:04:57,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:04:57,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:04:57,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:04:57,005 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:04:57,005 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:04:57,005 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:04:57,042 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:04:57,043 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:57,043 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:04:57,043 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:04:57,043 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:04:57,044 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:57,044 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:04:57,044 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:04:57,044 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:57,045 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:57,069 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:04:57,069 INFO L131 PetriNetUnfolder]: For 3327/3536 co-relation queries the response was YES. [2022-12-06 00:04:57,070 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3327/3536 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2987 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:04:57,072 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:57,072 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:04:57,225 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:04:57,226 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 183 [2022-12-06 00:04:57,226 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:04:57,226 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:04:57,226 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:04:57,226 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:04:57,226 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable380 [2022-12-06 00:04:57,226 INFO L420 AbstractCegarLoop]: === Iteration 382 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:04:57,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:04:57,227 INFO L85 PathProgramCache]: Analyzing trace with hash -1477782785, now seen corresponding path program 1 times [2022-12-06 00:04:57,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:04:57,227 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370896096] [2022-12-06 00:04:57,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:04:57,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:04:57,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:04:57,305 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-06 00:04:57,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:04:57,305 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370896096] [2022-12-06 00:04:57,305 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1370896096] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:04:57,305 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:04:57,305 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:04:57,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250437122] [2022-12-06 00:04:57,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:04:57,306 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:04:57,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:04:57,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:04:57,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:04:57,308 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:04:57,308 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:04:57,308 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:04:57,308 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:04:57,308 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:04:57,632 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:04:57,632 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:04:57,638 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13565 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:04:57,646 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:04:57,647 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:04:57,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:04:57,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:04:57,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:04:57,647 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:04:57,648 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:04:57,676 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:04:57,708 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:04:57,710 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:57,710 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:04:57,710 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:04:57,710 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:04:57,710 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:57,710 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:04:57,711 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:04:57,711 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:57,711 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:57,737 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:04:57,737 INFO L131 PetriNetUnfolder]: For 3309/3518 co-relation queries the response was YES. [2022-12-06 00:04:57,738 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3309/3518 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2994 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:04:57,740 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:57,740 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:04:57,900 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:04:57,900 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 190 [2022-12-06 00:04:57,900 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:04:57,900 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:04:57,900 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:04:57,901 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:04:57,901 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable381 [2022-12-06 00:04:57,901 INFO L420 AbstractCegarLoop]: === Iteration 383 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:04:57,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:04:57,901 INFO L85 PathProgramCache]: Analyzing trace with hash 265027550, now seen corresponding path program 1 times [2022-12-06 00:04:57,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:04:57,901 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753163739] [2022-12-06 00:04:57,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:04:57,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:04:57,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:04:57,985 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-06 00:04:57,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:04:57,986 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753163739] [2022-12-06 00:04:57,986 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1753163739] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:04:57,986 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:04:57,986 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:04:57,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393644695] [2022-12-06 00:04:57,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:04:57,986 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:04:57,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:04:57,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:04:57,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:04:57,987 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:04:57,987 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:04:57,987 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:04:57,987 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:04:57,987 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:04:58,291 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:04:58,291 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 00:04:58,297 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26969/27014 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13524 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:04:58,305 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:04:58,305 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:04:58,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:04:58,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:04:58,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:04:58,306 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:04:58,306 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:04:58,306 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:04:58,342 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:04:58,343 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:58,343 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:04:58,343 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:04:58,343 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:04:58,343 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:58,344 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:04:58,344 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:04:58,344 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:58,345 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:58,370 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:04:58,370 INFO L131 PetriNetUnfolder]: For 3122/3262 co-relation queries the response was YES. [2022-12-06 00:04:58,371 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3122/3262 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2971 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:04:58,373 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:58,373 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:04:58,532 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:04:58,534 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 191 [2022-12-06 00:04:58,534 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:04:58,534 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:04:58,534 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:04:58,534 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:04:58,534 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable382 [2022-12-06 00:04:58,535 INFO L420 AbstractCegarLoop]: === Iteration 384 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:04:58,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:04:58,535 INFO L85 PathProgramCache]: Analyzing trace with hash 2007837885, now seen corresponding path program 1 times [2022-12-06 00:04:58,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:04:58,535 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143093940] [2022-12-06 00:04:58,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:04:58,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:04:58,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:04:58,617 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-06 00:04:58,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:04:58,617 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143093940] [2022-12-06 00:04:58,618 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1143093940] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:04:58,618 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:04:58,618 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:04:58,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363990164] [2022-12-06 00:04:58,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:04:58,618 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:04:58,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:04:58,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:04:58,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:04:58,619 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:04:58,619 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:04:58,619 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:04:58,619 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:04:58,619 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:04:58,911 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:04:58,911 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:04:58,917 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13570 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:04:58,925 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:04:58,925 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:04:58,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:04:58,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:04:58,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:04:58,927 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:04:58,927 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:04:58,927 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:04:58,966 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:04:58,967 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:58,967 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:04:58,968 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:04:58,968 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:04:58,968 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:58,968 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:04:58,969 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:04:58,969 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:58,969 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:58,994 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:04:58,994 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 00:04:58,995 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3312/3520 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2988 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:04:58,997 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:58,997 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:04:59,138 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:04:59,139 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 171 [2022-12-06 00:04:59,139 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:04:59,139 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:04:59,139 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:04:59,139 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:04:59,140 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable383 [2022-12-06 00:04:59,140 INFO L420 AbstractCegarLoop]: === Iteration 385 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:04:59,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:04:59,140 INFO L85 PathProgramCache]: Analyzing trace with hash -544319076, now seen corresponding path program 1 times [2022-12-06 00:04:59,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:04:59,140 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729720287] [2022-12-06 00:04:59,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:04:59,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:04:59,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:04:59,201 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-06 00:04:59,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:04:59,201 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729720287] [2022-12-06 00:04:59,201 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1729720287] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:04:59,202 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:04:59,202 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:04:59,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789283956] [2022-12-06 00:04:59,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:04:59,202 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:04:59,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:04:59,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:04:59,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:04:59,202 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:04:59,202 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:04:59,203 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:04:59,203 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:04:59,203 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:04:59,495 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:04:59,495 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:04:59,501 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13568 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:04:59,509 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:04:59,510 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:04:59,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:04:59,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:04:59,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:04:59,510 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:04:59,510 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:04:59,511 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:04:59,548 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:04:59,550 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:59,550 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:04:59,550 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:04:59,550 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:04:59,550 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:59,550 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:04:59,551 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:04:59,551 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:59,551 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:59,576 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:04:59,577 INFO L131 PetriNetUnfolder]: For 3338/3550 co-relation queries the response was YES. [2022-12-06 00:04:59,578 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3338/3550 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2988 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:04:59,580 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:04:59,580 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:04:59,731 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:04:59,731 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 181 [2022-12-06 00:04:59,732 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:04:59,732 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:04:59,732 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:04:59,732 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:04:59,732 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable384 [2022-12-06 00:04:59,732 INFO L420 AbstractCegarLoop]: === Iteration 386 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:04:59,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:04:59,732 INFO L85 PathProgramCache]: Analyzing trace with hash 1198491259, now seen corresponding path program 1 times [2022-12-06 00:04:59,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:04:59,733 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278047186] [2022-12-06 00:04:59,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:04:59,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:04:59,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:04:59,804 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-06 00:04:59,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:04:59,805 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278047186] [2022-12-06 00:04:59,805 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [278047186] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:04:59,805 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:04:59,805 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:04:59,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303916844] [2022-12-06 00:04:59,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:04:59,805 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:04:59,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:04:59,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:04:59,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:04:59,805 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:04:59,805 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:04:59,806 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:04:59,806 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:04:59,806 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:05:00,112 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:05:00,112 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 00:05:00,118 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13554 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:05:00,126 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:05:00,126 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:05:00,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:05:00,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:05:00,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:05:00,127 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:05:00,127 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:05:00,127 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:05:00,161 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:05:00,163 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:00,163 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:05:00,163 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:05:00,163 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:05:00,163 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:00,163 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:05:00,163 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:05:00,164 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:00,164 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:00,188 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:05:00,189 INFO L131 PetriNetUnfolder]: For 3298/3507 co-relation queries the response was YES. [2022-12-06 00:05:00,190 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3298/3507 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2988 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:05:00,192 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:00,192 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:05:00,348 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:05:00,348 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 185 [2022-12-06 00:05:00,348 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:05:00,348 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:05:00,348 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:05:00,349 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:05:00,349 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable385 [2022-12-06 00:05:00,349 INFO L420 AbstractCegarLoop]: === Iteration 387 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:05:00,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:05:00,349 INFO L85 PathProgramCache]: Analyzing trace with hash -1353665702, now seen corresponding path program 1 times [2022-12-06 00:05:00,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:05:00,349 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346814808] [2022-12-06 00:05:00,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:05:00,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:05:00,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:05:00,416 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-06 00:05:00,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:05:00,417 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346814808] [2022-12-06 00:05:00,417 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1346814808] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:05:00,417 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:05:00,417 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:05:00,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780211386] [2022-12-06 00:05:00,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:05:00,417 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:05:00,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:05:00,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:05:00,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:05:00,417 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:05:00,418 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:05:00,418 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:05:00,418 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:05:00,418 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:05:00,748 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:05:00,748 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:05:00,755 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13561 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:05:00,765 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:05:00,765 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:05:00,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:05:00,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:05:00,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:05:00,766 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:05:00,766 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:05:00,766 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:05:00,811 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:05:00,813 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:00,813 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:05:00,813 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:05:00,813 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:05:00,813 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:00,814 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:05:00,814 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:05:00,814 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:00,815 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:00,862 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:05:00,862 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 00:05:00,863 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3321/3530 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2994 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:05:00,866 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:00,866 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:05:01,049 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:05:01,050 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 237 [2022-12-06 00:05:01,050 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:05:01,050 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:05:01,050 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:05:01,050 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:05:01,050 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable386 [2022-12-06 00:05:01,050 INFO L420 AbstractCegarLoop]: === Iteration 388 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:05:01,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:05:01,051 INFO L85 PathProgramCache]: Analyzing trace with hash 389144633, now seen corresponding path program 1 times [2022-12-06 00:05:01,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:05:01,051 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635987278] [2022-12-06 00:05:01,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:05:01,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:05:01,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:05:01,122 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-06 00:05:01,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:05:01,122 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635987278] [2022-12-06 00:05:01,122 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1635987278] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:05:01,122 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:05:01,122 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:05:01,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682739459] [2022-12-06 00:05:01,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:05:01,122 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:05:01,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:05:01,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:05:01,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:05:01,123 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:05:01,123 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:05:01,123 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:05:01,123 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:05:01,123 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:05:01,463 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:05:01,463 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:05:01,470 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13560 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:05:01,479 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:05:01,480 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:05:01,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:05:01,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:05:01,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:05:01,480 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:05:01,480 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:05:01,480 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:05:01,526 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:05:01,528 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:01,528 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:05:01,528 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:05:01,528 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:05:01,528 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:01,529 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:05:01,529 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:05:01,529 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:01,530 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:01,560 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:05:01,560 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 00:05:01,562 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3321/3530 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2973 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:05:01,564 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:01,564 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:05:01,729 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:05:01,730 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 202 [2022-12-06 00:05:01,730 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:05:01,730 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:05:01,730 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:05:01,730 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:05:01,730 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable387 [2022-12-06 00:05:01,730 INFO L420 AbstractCegarLoop]: === Iteration 389 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:05:01,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:05:01,730 INFO L85 PathProgramCache]: Analyzing trace with hash 2131954968, now seen corresponding path program 1 times [2022-12-06 00:05:01,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:05:01,731 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071061346] [2022-12-06 00:05:01,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:05:01,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:05:01,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:05:01,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-06 00:05:01,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:05:01,803 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071061346] [2022-12-06 00:05:01,803 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1071061346] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:05:01,803 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:05:01,803 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:05:01,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476492166] [2022-12-06 00:05:01,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:05:01,804 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:05:01,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:05:01,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:05:01,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:05:01,804 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:05:01,804 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:05:01,804 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:05:01,805 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:05:01,805 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:05:02,118 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:05:02,118 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:05:02,124 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13551 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:05:02,132 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:05:02,132 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:05:02,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:05:02,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:05:02,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:05:02,133 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:05:02,133 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:05:02,133 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:05:02,169 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:05:02,170 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:02,170 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:05:02,170 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:05:02,170 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:05:02,170 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:02,171 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:05:02,171 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:05:02,171 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:02,171 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:02,196 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:05:02,196 INFO L131 PetriNetUnfolder]: For 3338/3547 co-relation queries the response was YES. [2022-12-06 00:05:02,197 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3338/3547 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2971 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:05:02,199 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:02,199 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:05:02,366 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:05:02,366 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 196 [2022-12-06 00:05:02,366 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:05:02,366 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:05:02,366 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:05:02,366 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:05:02,366 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable388 [2022-12-06 00:05:02,367 INFO L420 AbstractCegarLoop]: === Iteration 390 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:05:02,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:05:02,367 INFO L85 PathProgramCache]: Analyzing trace with hash -420201993, now seen corresponding path program 1 times [2022-12-06 00:05:02,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:05:02,367 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971145323] [2022-12-06 00:05:02,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:05:02,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:05:02,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:05:02,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-06 00:05:02,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:05:02,438 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971145323] [2022-12-06 00:05:02,438 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [971145323] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:05:02,438 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:05:02,438 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:05:02,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614853231] [2022-12-06 00:05:02,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:05:02,438 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:05:02,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:05:02,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:05:02,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:05:02,438 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:05:02,439 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:05:02,439 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:05:02,439 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:05:02,439 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:05:02,838 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:05:02,839 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:05:02,846 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13554 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:05:02,856 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:05:02,856 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:05:02,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:05:02,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:05:02,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:05:02,860 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:05:02,860 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:05:02,860 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:05:02,893 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:05:02,894 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:02,894 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:05:02,895 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:05:02,895 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:05:02,895 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:02,895 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:05:02,895 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:05:02,895 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:02,896 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:02,921 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:05:02,921 INFO L131 PetriNetUnfolder]: For 3293/3500 co-relation queries the response was YES. [2022-12-06 00:05:02,922 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3293/3500 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2993 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:05:02,924 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:02,924 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:05:03,084 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:05:03,085 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 190 [2022-12-06 00:05:03,085 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:05:03,085 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:05:03,085 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:05:03,085 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:05:03,085 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable389 [2022-12-06 00:05:03,085 INFO L420 AbstractCegarLoop]: === Iteration 391 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:05:03,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:05:03,085 INFO L85 PathProgramCache]: Analyzing trace with hash 1322608342, now seen corresponding path program 1 times [2022-12-06 00:05:03,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:05:03,085 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057048401] [2022-12-06 00:05:03,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:05:03,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:05:03,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:05:03,138 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:05:03,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:05:03,139 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057048401] [2022-12-06 00:05:03,139 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2057048401] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:05:03,139 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:05:03,139 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:05:03,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466638319] [2022-12-06 00:05:03,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:05:03,139 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:05:03,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:05:03,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:05:03,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:05:03,140 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:05:03,140 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:05:03,140 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:05:03,140 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:05:03,140 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:05:03,425 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:05:03,425 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 00:05:03,431 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13548 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:05:03,438 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:05:03,439 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:05:03,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:05:03,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:05:03,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:05:03,439 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:05:03,439 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:05:03,439 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:05:03,478 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:05:03,480 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:03,480 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:05:03,480 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:05:03,480 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:05:03,480 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:03,480 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:05:03,481 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:05:03,481 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:03,481 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:03,508 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:05:03,508 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 00:05:03,509 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3321/3530 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2986 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:05:03,511 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:03,511 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:05:03,676 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:05:03,677 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 197 [2022-12-06 00:05:03,677 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:05:03,677 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:05:03,677 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:05:03,677 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:05:03,677 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable390 [2022-12-06 00:05:03,677 INFO L420 AbstractCegarLoop]: === Iteration 392 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:05:03,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:05:03,677 INFO L85 PathProgramCache]: Analyzing trace with hash -1229548619, now seen corresponding path program 1 times [2022-12-06 00:05:03,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:05:03,678 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458259600] [2022-12-06 00:05:03,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:05:03,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:05:03,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:05:03,762 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-06 00:05:03,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:05:03,762 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458259600] [2022-12-06 00:05:03,762 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [458259600] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:05:03,762 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:05:03,763 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:05:03,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779036134] [2022-12-06 00:05:03,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:05:03,763 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:05:03,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:05:03,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:05:03,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:05:03,763 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:05:03,763 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:05:03,763 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:05:03,763 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:05:03,763 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:05:04,087 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:05:04,088 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 00:05:04,093 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26965/27010 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13552 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:05:04,101 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:05:04,102 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:05:04,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:05:04,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:05:04,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:05:04,102 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:05:04,102 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:05:04,102 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:05:04,137 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:05:04,138 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:04,138 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:05:04,138 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:05:04,138 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:05:04,138 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:04,139 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:05:04,139 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:05:04,139 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:04,139 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:04,163 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:05:04,164 INFO L131 PetriNetUnfolder]: For 3122/3262 co-relation queries the response was YES. [2022-12-06 00:05:04,165 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3122/3262 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2972 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:05:04,166 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:04,166 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:05:04,336 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:05:04,336 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 198 [2022-12-06 00:05:04,336 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:05:04,336 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:05:04,336 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:05:04,337 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:05:04,337 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable391 [2022-12-06 00:05:04,337 INFO L420 AbstractCegarLoop]: === Iteration 393 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:05:04,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:05:04,337 INFO L85 PathProgramCache]: Analyzing trace with hash 513261716, now seen corresponding path program 1 times [2022-12-06 00:05:04,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:05:04,337 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764172701] [2022-12-06 00:05:04,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:05:04,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:05:04,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:05:04,416 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-06 00:05:04,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:05:04,416 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764172701] [2022-12-06 00:05:04,416 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1764172701] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:05:04,416 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:05:04,416 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:05:04,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586504189] [2022-12-06 00:05:04,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:05:04,417 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:05:04,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:05:04,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:05:04,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:05:04,417 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:05:04,417 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:05:04,417 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:05:04,417 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:05:04,417 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:05:04,724 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:05:04,724 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 00:05:04,731 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13575 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:05:04,739 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:05:04,739 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:05:04,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:05:04,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:05:04,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:05:04,740 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:05:04,740 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:05:04,740 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:05:04,777 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:05:04,778 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:04,778 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:05:04,778 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:05:04,778 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:05:04,779 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:04,779 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:05:04,779 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:05:04,779 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:04,780 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:04,804 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:05:04,805 INFO L131 PetriNetUnfolder]: For 3348/3558 co-relation queries the response was YES. [2022-12-06 00:05:04,805 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3348/3558 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2992 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:05:04,807 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:04,807 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:05:04,974 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:05:04,974 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 196 [2022-12-06 00:05:04,974 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:05:04,975 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:05:04,975 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:05:04,975 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:05:04,975 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable392 [2022-12-06 00:05:04,975 INFO L420 AbstractCegarLoop]: === Iteration 394 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:05:04,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:05:04,975 INFO L85 PathProgramCache]: Analyzing trace with hash -2038895245, now seen corresponding path program 1 times [2022-12-06 00:05:04,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:05:04,975 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255572458] [2022-12-06 00:05:04,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:05:04,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:05:04,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:05:05,051 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-06 00:05:05,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:05:05,052 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255572458] [2022-12-06 00:05:05,052 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1255572458] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:05:05,052 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:05:05,052 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:05:05,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827555767] [2022-12-06 00:05:05,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:05:05,052 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:05:05,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:05:05,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:05:05,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:05:05,052 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:05:05,053 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:05:05,053 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:05:05,053 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:05:05,053 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:05:05,327 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:05:05,327 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:05:05,333 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13569 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:05:05,341 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:05:05,341 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:05:05,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:05:05,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:05:05,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:05:05,342 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:05:05,342 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:05:05,342 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:05:05,378 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:05:05,380 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:05,380 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:05:05,380 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:05:05,380 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:05:05,380 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:05,380 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:05:05,380 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:05:05,381 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:05,381 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:05,405 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:05:05,406 INFO L131 PetriNetUnfolder]: For 3301/3509 co-relation queries the response was YES. [2022-12-06 00:05:05,407 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3301/3509 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2983 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:05:05,409 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:05,409 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:05:05,569 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:05:05,570 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 190 [2022-12-06 00:05:05,570 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:05:05,570 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:05:05,570 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:05:05,570 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:05:05,570 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable393 [2022-12-06 00:05:05,570 INFO L420 AbstractCegarLoop]: === Iteration 395 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:05:05,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:05:05,570 INFO L85 PathProgramCache]: Analyzing trace with hash -296084910, now seen corresponding path program 1 times [2022-12-06 00:05:05,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:05:05,571 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679186598] [2022-12-06 00:05:05,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:05:05,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:05:05,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:05:05,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-06 00:05:05,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:05:05,644 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679186598] [2022-12-06 00:05:05,644 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [679186598] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:05:05,644 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:05:05,644 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:05:05,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131939318] [2022-12-06 00:05:05,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:05:05,645 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:05:05,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:05:05,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:05:05,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:05:05,645 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:05:05,645 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:05:05,645 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:05:05,645 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:05:05,645 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:05:05,998 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:05:05,998 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 00:05:06,003 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13569 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:05:06,010 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:05:06,010 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:05:06,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:05:06,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:05:06,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:05:06,011 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:05:06,011 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:05:06,011 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:05:06,042 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:05:06,044 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:06,044 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:05:06,044 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:05:06,044 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:05:06,044 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:06,045 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:05:06,045 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:05:06,045 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:06,045 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:06,078 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:05:06,078 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 00:05:06,080 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3321/3530 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2972 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:05:06,082 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:06,082 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:05:06,295 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:05:06,296 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 252 [2022-12-06 00:05:06,296 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:05:06,296 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:05:06,296 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:05:06,296 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:05:06,296 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable394 [2022-12-06 00:05:06,296 INFO L420 AbstractCegarLoop]: === Iteration 396 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:05:06,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:05:06,296 INFO L85 PathProgramCache]: Analyzing trace with hash 1446725425, now seen corresponding path program 1 times [2022-12-06 00:05:06,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:05:06,297 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811552404] [2022-12-06 00:05:06,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:05:06,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:05:06,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:05:06,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:05:06,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:05:06,368 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811552404] [2022-12-06 00:05:06,368 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [811552404] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:05:06,368 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:05:06,368 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:05:06,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74121824] [2022-12-06 00:05:06,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:05:06,369 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:05:06,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:05:06,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:05:06,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:05:06,369 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:05:06,369 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:05:06,369 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:05:06,369 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:05:06,369 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:05:06,701 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:05:06,701 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:05:06,707 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13564 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:05:06,715 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:05:06,715 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:05:06,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:05:06,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:05:06,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:05:06,716 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:05:06,716 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:05:06,716 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:05:06,753 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:05:06,754 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:06,754 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:05:06,754 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:05:06,754 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:05:06,754 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:06,755 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:05:06,755 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:05:06,755 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:06,756 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:06,780 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:05:06,780 INFO L131 PetriNetUnfolder]: For 3307/3517 co-relation queries the response was YES. [2022-12-06 00:05:06,781 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3307/3517 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2983 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:05:06,783 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:06,783 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:05:06,926 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:05:06,927 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 173 [2022-12-06 00:05:06,927 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:05:06,927 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:05:06,927 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:05:06,927 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:05:06,927 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable395 [2022-12-06 00:05:06,927 INFO L420 AbstractCegarLoop]: === Iteration 397 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:05:06,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:05:06,927 INFO L85 PathProgramCache]: Analyzing trace with hash -1105431536, now seen corresponding path program 1 times [2022-12-06 00:05:06,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:05:06,928 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239054694] [2022-12-06 00:05:06,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:05:06,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:05:06,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:05:06,984 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-06 00:05:06,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:05:06,984 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239054694] [2022-12-06 00:05:06,984 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [239054694] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:05:06,984 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:05:06,984 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:05:06,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810742349] [2022-12-06 00:05:06,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:05:06,984 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:05:06,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:05:06,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:05:06,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:05:06,985 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:05:06,985 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:05:06,985 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:05:06,985 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:05:06,985 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:05:07,293 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:05:07,293 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 00:05:07,299 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13552 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:05:07,306 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:05:07,307 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:05:07,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:05:07,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:05:07,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:05:07,307 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:05:07,307 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:05:07,307 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:05:07,344 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:05:07,345 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:07,345 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:05:07,345 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:05:07,345 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:05:07,346 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:07,346 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:05:07,346 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:05:07,346 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:07,347 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:07,371 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:05:07,371 INFO L131 PetriNetUnfolder]: For 3348/3558 co-relation queries the response was YES. [2022-12-06 00:05:07,372 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3348/3558 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2979 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:05:07,374 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:07,374 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:05:07,524 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:05:07,525 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 180 [2022-12-06 00:05:07,525 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:05:07,525 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:05:07,525 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:05:07,525 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:05:07,525 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable396 [2022-12-06 00:05:07,525 INFO L420 AbstractCegarLoop]: === Iteration 398 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:05:07,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:05:07,525 INFO L85 PathProgramCache]: Analyzing trace with hash 637378799, now seen corresponding path program 1 times [2022-12-06 00:05:07,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:05:07,526 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490367248] [2022-12-06 00:05:07,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:05:07,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:05:07,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:05:07,593 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-06 00:05:07,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:05:07,593 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490367248] [2022-12-06 00:05:07,593 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1490367248] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:05:07,593 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:05:07,593 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:05:07,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753051105] [2022-12-06 00:05:07,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:05:07,594 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:05:07,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:05:07,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:05:07,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:05:07,594 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:05:07,594 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:05:07,594 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:05:07,594 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:05:07,594 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:05:07,891 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:05:07,891 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:05:07,897 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13532 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:05:07,906 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:05:07,906 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:05:07,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:05:07,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:05:07,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:05:07,907 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:05:07,907 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:05:07,907 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:05:07,942 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:05:07,944 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:07,944 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:05:07,944 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:05:07,944 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:05:07,944 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:07,945 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:05:07,945 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:05:07,945 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:07,945 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:07,971 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:05:07,971 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 00:05:07,972 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3312/3520 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2989 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:05:07,975 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:07,975 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:05:08,121 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:05:08,122 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 178 [2022-12-06 00:05:08,122 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:05:08,122 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:05:08,122 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:05:08,122 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:05:08,122 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable397 [2022-12-06 00:05:08,122 INFO L420 AbstractCegarLoop]: === Iteration 399 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:05:08,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:05:08,122 INFO L85 PathProgramCache]: Analyzing trace with hash -1914778162, now seen corresponding path program 1 times [2022-12-06 00:05:08,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:05:08,122 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836975646] [2022-12-06 00:05:08,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:05:08,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:05:08,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:05:08,183 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-06 00:05:08,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:05:08,183 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836975646] [2022-12-06 00:05:08,183 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [836975646] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:05:08,183 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:05:08,183 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:05:08,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177572128] [2022-12-06 00:05:08,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:05:08,183 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:05:08,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:05:08,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:05:08,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:05:08,184 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:05:08,184 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:05:08,184 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:05:08,184 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:05:08,184 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:05:08,482 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:05:08,483 INFO L131 PetriNetUnfolder]: For 27146/27191 co-relation queries the response was YES. [2022-12-06 00:05:08,490 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27146/27191 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13547 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:05:08,499 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:05:08,500 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:05:08,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:05:08,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:05:08,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:05:08,500 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:05:08,501 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:05:08,501 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:05:08,544 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:05:08,546 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:08,546 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:05:08,546 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:05:08,546 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:05:08,546 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:08,547 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:05:08,547 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:05:08,547 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:08,548 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:08,579 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:05:08,579 INFO L131 PetriNetUnfolder]: For 3157/3298 co-relation queries the response was YES. [2022-12-06 00:05:08,580 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3157/3298 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2993 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:05:08,583 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:08,583 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:05:08,755 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:05:08,755 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 209 [2022-12-06 00:05:08,755 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:05:08,755 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:05:08,756 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:05:08,756 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:05:08,756 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable398 [2022-12-06 00:05:08,756 INFO L420 AbstractCegarLoop]: === Iteration 400 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:05:08,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:05:08,756 INFO L85 PathProgramCache]: Analyzing trace with hash -171967827, now seen corresponding path program 1 times [2022-12-06 00:05:08,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:05:08,756 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862087897] [2022-12-06 00:05:08,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:05:08,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:05:08,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:05:08,825 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-06 00:05:08,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:05:08,825 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862087897] [2022-12-06 00:05:08,825 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [862087897] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:05:08,825 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:05:08,825 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:05:08,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090530450] [2022-12-06 00:05:08,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:05:08,825 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:05:08,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:05:08,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:05:08,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:05:08,826 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:05:08,826 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:05:08,826 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:05:08,826 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:05:08,826 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:05:09,120 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:05:09,120 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 00:05:09,126 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13560 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:05:09,135 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:05:09,135 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:05:09,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:05:09,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:05:09,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:05:09,136 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:05:09,136 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:05:09,136 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:05:09,171 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:05:09,172 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:09,172 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:05:09,173 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:05:09,173 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:05:09,173 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:09,173 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:05:09,173 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:05:09,173 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:09,174 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:09,210 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:05:09,210 INFO L131 PetriNetUnfolder]: For 3310/3519 co-relation queries the response was YES. [2022-12-06 00:05:09,211 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3310/3519 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2994 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:05:09,213 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:09,213 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:05:09,365 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:05:09,365 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 192 [2022-12-06 00:05:09,366 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:05:09,366 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:05:09,366 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:05:09,366 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:05:09,366 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable399 [2022-12-06 00:05:09,366 INFO L420 AbstractCegarLoop]: === Iteration 401 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:05:09,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:05:09,366 INFO L85 PathProgramCache]: Analyzing trace with hash 1570842508, now seen corresponding path program 1 times [2022-12-06 00:05:09,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:05:09,366 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488101768] [2022-12-06 00:05:09,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:05:09,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:05:09,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:05:09,429 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-06 00:05:09,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:05:09,429 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488101768] [2022-12-06 00:05:09,429 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1488101768] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:05:09,429 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:05:09,429 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:05:09,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591854749] [2022-12-06 00:05:09,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:05:09,429 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:05:09,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:05:09,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:05:09,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:05:09,430 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:05:09,430 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:05:09,430 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:05:09,430 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:05:09,430 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:05:09,716 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:05:09,716 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 00:05:09,722 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13574 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:05:09,731 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:05:09,731 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:05:09,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:05:09,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:05:09,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:05:09,732 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:05:09,732 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:05:09,732 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:05:09,767 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:05:09,768 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:09,769 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:05:09,769 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:05:09,769 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:05:09,769 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:09,769 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:05:09,769 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:05:09,769 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:09,770 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:09,794 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:05:09,794 INFO L131 PetriNetUnfolder]: For 3348/3558 co-relation queries the response was YES. [2022-12-06 00:05:09,795 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3348/3558 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2976 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:05:09,797 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:09,797 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:05:09,944 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:05:09,945 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 176 [2022-12-06 00:05:09,945 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:05:09,945 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:05:09,945 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:05:09,945 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:05:09,945 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable400 [2022-12-06 00:05:09,945 INFO L420 AbstractCegarLoop]: === Iteration 402 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:05:09,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:05:09,946 INFO L85 PathProgramCache]: Analyzing trace with hash -981314453, now seen corresponding path program 1 times [2022-12-06 00:05:09,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:05:09,946 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157276462] [2022-12-06 00:05:09,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:05:09,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:05:09,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:05:10,008 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-06 00:05:10,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:05:10,008 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157276462] [2022-12-06 00:05:10,008 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [157276462] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:05:10,008 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:05:10,008 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:05:10,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792135580] [2022-12-06 00:05:10,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:05:10,008 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:05:10,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:05:10,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:05:10,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:05:10,009 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:05:10,009 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:05:10,009 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:05:10,009 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:05:10,009 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:05:10,281 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:05:10,281 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:05:10,286 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13566 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:05:10,293 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:05:10,293 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:05:10,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:05:10,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:05:10,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:05:10,294 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:05:10,294 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:05:10,294 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:05:10,328 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:05:10,329 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:10,329 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:05:10,329 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:05:10,329 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:05:10,329 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:10,330 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:05:10,330 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:05:10,330 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:10,331 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:10,354 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:05:10,354 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 00:05:10,355 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3312/3520 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2990 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:05:10,357 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:10,357 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:05:10,494 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:05:10,494 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 165 [2022-12-06 00:05:10,494 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:05:10,494 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:05:10,495 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:05:10,495 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:05:10,495 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable401 [2022-12-06 00:05:10,495 INFO L420 AbstractCegarLoop]: === Iteration 403 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:05:10,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:05:10,495 INFO L85 PathProgramCache]: Analyzing trace with hash 761495882, now seen corresponding path program 1 times [2022-12-06 00:05:10,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:05:10,495 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398005545] [2022-12-06 00:05:10,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:05:10,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:05:10,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:05:10,552 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-06 00:05:10,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:05:10,552 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398005545] [2022-12-06 00:05:10,552 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [398005545] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:05:10,552 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:05:10,552 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:05:10,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407125476] [2022-12-06 00:05:10,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:05:10,552 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:05:10,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:05:10,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:05:10,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:05:10,553 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:05:10,553 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:05:10,553 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:05:10,553 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:05:10,553 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:05:10,838 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:05:10,839 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:05:10,843 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13570 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:05:10,850 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:05:10,850 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:05:10,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:05:10,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:05:10,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:05:10,851 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:05:10,851 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:05:10,851 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:05:10,882 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:05:10,883 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:10,883 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:05:10,883 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:05:10,884 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:05:10,884 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:10,884 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:05:10,884 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:05:10,884 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:10,885 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:10,909 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:05:10,909 INFO L131 PetriNetUnfolder]: For 3307/3517 co-relation queries the response was YES. [2022-12-06 00:05:10,910 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3307/3517 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2981 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:05:10,912 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:10,912 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:05:11,087 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:05:11,087 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 203 [2022-12-06 00:05:11,087 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:05:11,087 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:05:11,088 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:05:11,088 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:05:11,088 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable402 [2022-12-06 00:05:11,088 INFO L420 AbstractCegarLoop]: === Iteration 404 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:05:11,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:05:11,088 INFO L85 PathProgramCache]: Analyzing trace with hash -1790661079, now seen corresponding path program 1 times [2022-12-06 00:05:11,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:05:11,088 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232796128] [2022-12-06 00:05:11,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:05:11,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:05:11,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:05:11,148 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-06 00:05:11,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:05:11,148 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232796128] [2022-12-06 00:05:11,148 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [232796128] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:05:11,149 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:05:11,149 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:05:11,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864059330] [2022-12-06 00:05:11,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:05:11,149 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:05:11,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:05:11,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:05:11,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:05:11,149 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:05:11,149 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:05:11,149 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:05:11,150 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:05:11,150 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:05:11,535 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:05:11,536 INFO L131 PetriNetUnfolder]: For 27136/27181 co-relation queries the response was YES. [2022-12-06 00:05:11,544 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27136/27181 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13538 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:05:11,555 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:05:11,555 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:05:11,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:05:11,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:05:11,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:05:11,556 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:05:11,556 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:05:11,556 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:05:11,598 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:05:11,600 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:11,600 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:05:11,600 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:05:11,600 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:05:11,600 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:11,600 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:05:11,600 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:05:11,601 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:11,601 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:11,626 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:05:11,626 INFO L131 PetriNetUnfolder]: For 3167/3307 co-relation queries the response was YES. [2022-12-06 00:05:11,627 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3167/3307 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2989 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:05:11,629 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:11,629 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:05:11,786 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:05:11,786 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 186 [2022-12-06 00:05:11,786 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:05:11,787 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:05:11,787 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:05:11,787 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:05:11,787 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable403 [2022-12-06 00:05:11,787 INFO L420 AbstractCegarLoop]: === Iteration 405 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:05:11,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:05:11,787 INFO L85 PathProgramCache]: Analyzing trace with hash -47850744, now seen corresponding path program 1 times [2022-12-06 00:05:11,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:05:11,787 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746813061] [2022-12-06 00:05:11,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:05:11,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:05:11,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:05:11,842 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-06 00:05:11,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:05:11,842 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746813061] [2022-12-06 00:05:11,842 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1746813061] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:05:11,842 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:05:11,842 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:05:11,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595938035] [2022-12-06 00:05:11,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:05:11,842 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:05:11,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:05:11,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:05:11,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:05:11,843 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:05:11,843 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:05:11,843 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:05:11,843 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:05:11,843 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:05:12,117 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:05:12,117 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:05:12,123 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13532 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:05:12,131 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:05:12,131 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:05:12,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:05:12,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:05:12,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:05:12,132 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:05:12,132 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:05:12,132 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:05:12,168 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:05:12,169 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:12,169 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:05:12,169 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:05:12,169 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:05:12,169 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:12,170 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:05:12,170 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:05:12,170 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:12,170 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:12,195 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:05:12,195 INFO L131 PetriNetUnfolder]: For 3337/3547 co-relation queries the response was YES. [2022-12-06 00:05:12,196 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3337/3547 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2992 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:05:12,198 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:12,198 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:05:12,342 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:05:12,343 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 174 [2022-12-06 00:05:12,343 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:05:12,343 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:05:12,343 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:05:12,343 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:05:12,343 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable404 [2022-12-06 00:05:12,343 INFO L420 AbstractCegarLoop]: === Iteration 406 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:05:12,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:05:12,343 INFO L85 PathProgramCache]: Analyzing trace with hash 1694959591, now seen corresponding path program 1 times [2022-12-06 00:05:12,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:05:12,344 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080558832] [2022-12-06 00:05:12,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:05:12,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:05:12,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:05:12,418 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-06 00:05:12,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:05:12,419 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080558832] [2022-12-06 00:05:12,419 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2080558832] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:05:12,419 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:05:12,419 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:05:12,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433049290] [2022-12-06 00:05:12,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:05:12,419 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:05:12,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:05:12,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:05:12,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:05:12,420 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:05:12,420 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:05:12,420 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:05:12,420 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:05:12,420 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:05:12,699 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:05:12,699 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 00:05:12,705 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13574 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:05:12,712 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:05:12,712 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:05:12,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:05:12,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:05:12,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:05:12,713 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:05:12,713 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:05:12,713 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:05:12,749 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:05:12,750 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:12,750 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:05:12,751 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:05:12,751 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:05:12,751 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:12,751 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:05:12,751 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:05:12,751 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:12,752 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:12,776 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:05:12,776 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 00:05:12,777 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3312/3520 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2987 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:05:12,779 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:12,779 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:05:12,935 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:05:12,935 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 184 [2022-12-06 00:05:12,935 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:05:12,935 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:05:12,935 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:05:12,935 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:05:12,935 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable405 [2022-12-06 00:05:12,935 INFO L420 AbstractCegarLoop]: === Iteration 407 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:05:12,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:05:12,936 INFO L85 PathProgramCache]: Analyzing trace with hash -857197370, now seen corresponding path program 1 times [2022-12-06 00:05:12,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:05:12,936 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545973105] [2022-12-06 00:05:12,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:05:12,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:05:12,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:05:13,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-06 00:05:13,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:05:13,023 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545973105] [2022-12-06 00:05:13,023 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [545973105] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:05:13,023 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:05:13,023 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:05:13,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809414565] [2022-12-06 00:05:13,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:05:13,024 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:05:13,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:05:13,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:05:13,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:05:13,024 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:05:13,024 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:05:13,024 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:05:13,025 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:05:13,025 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:05:13,320 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:05:13,320 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 00:05:13,326 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26965/27010 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13527 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:05:13,333 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:05:13,333 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:05:13,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:05:13,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:05:13,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:05:13,334 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:05:13,334 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:05:13,334 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:05:13,369 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:05:13,371 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:13,371 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:05:13,371 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:05:13,371 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:05:13,371 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:13,371 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:05:13,372 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:05:13,372 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:13,372 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:13,396 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:05:13,396 INFO L131 PetriNetUnfolder]: For 3112/3253 co-relation queries the response was YES. [2022-12-06 00:05:13,397 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3112/3253 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2991 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:05:13,399 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:13,399 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:05:13,541 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:05:13,542 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 171 [2022-12-06 00:05:13,542 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:05:13,542 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:05:13,542 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:05:13,542 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:05:13,542 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable406 [2022-12-06 00:05:13,542 INFO L420 AbstractCegarLoop]: === Iteration 408 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:05:13,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:05:13,542 INFO L85 PathProgramCache]: Analyzing trace with hash 885612965, now seen corresponding path program 1 times [2022-12-06 00:05:13,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:05:13,542 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041995940] [2022-12-06 00:05:13,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:05:13,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:05:13,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:05:13,600 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-06 00:05:13,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:05:13,600 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041995940] [2022-12-06 00:05:13,601 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1041995940] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:05:13,601 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:05:13,601 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:05:13,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486187678] [2022-12-06 00:05:13,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:05:13,601 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:05:13,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:05:13,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:05:13,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:05:13,601 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:05:13,601 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:05:13,601 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:05:13,601 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:05:13,601 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:05:13,903 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:05:13,904 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:05:13,908 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13558 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:05:13,914 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:05:13,914 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:05:13,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:05:13,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:05:13,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:05:13,915 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:05:13,915 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:05:13,915 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:05:13,946 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:05:13,947 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:13,947 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:05:13,947 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:05:13,947 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:05:13,947 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:13,948 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:05:13,948 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:05:13,948 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:13,949 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:13,972 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:05:13,972 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 00:05:13,973 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3321/3530 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2984 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:05:13,975 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:13,975 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:05:14,121 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:05:14,122 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 175 [2022-12-06 00:05:14,122 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:05:14,122 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:05:14,122 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:05:14,122 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:05:14,122 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable407 [2022-12-06 00:05:14,122 INFO L420 AbstractCegarLoop]: === Iteration 409 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:05:14,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:05:14,122 INFO L85 PathProgramCache]: Analyzing trace with hash -1666543996, now seen corresponding path program 1 times [2022-12-06 00:05:14,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:05:14,123 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010840704] [2022-12-06 00:05:14,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:05:14,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:05:14,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:05:14,187 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-06 00:05:14,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:05:14,188 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010840704] [2022-12-06 00:05:14,188 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1010840704] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:05:14,188 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:05:14,188 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:05:14,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741999447] [2022-12-06 00:05:14,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:05:14,188 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:05:14,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:05:14,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:05:14,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:05:14,189 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:05:14,189 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:05:14,189 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:05:14,189 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:05:14,189 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:05:14,498 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:05:14,498 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 00:05:14,505 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26965/27010 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13535 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:05:14,514 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:05:14,514 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:05:14,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:05:14,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:05:14,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:05:14,515 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:05:14,515 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:05:14,515 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:05:14,550 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:05:14,551 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:14,551 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:05:14,552 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:05:14,552 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:05:14,552 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:14,552 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:05:14,552 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:05:14,552 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:14,553 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:14,577 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:05:14,577 INFO L131 PetriNetUnfolder]: For 3146/3287 co-relation queries the response was YES. [2022-12-06 00:05:14,578 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3146/3287 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2985 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:05:14,580 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:14,580 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:05:14,735 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:05:14,735 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 183 [2022-12-06 00:05:14,735 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:05:14,735 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:05:14,735 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:05:14,735 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:05:14,735 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable408 [2022-12-06 00:05:14,736 INFO L420 AbstractCegarLoop]: === Iteration 410 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:05:14,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:05:14,736 INFO L85 PathProgramCache]: Analyzing trace with hash 76266339, now seen corresponding path program 1 times [2022-12-06 00:05:14,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:05:14,736 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894071025] [2022-12-06 00:05:14,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:05:14,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:05:14,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:05:14,806 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-06 00:05:14,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:05:14,807 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894071025] [2022-12-06 00:05:14,807 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [894071025] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:05:14,807 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:05:14,807 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:05:14,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915309686] [2022-12-06 00:05:14,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:05:14,807 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:05:14,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:05:14,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:05:14,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:05:14,807 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:05:14,807 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:05:14,807 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:05:14,808 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:05:14,808 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:05:15,113 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:05:15,114 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:05:15,120 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13554 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:05:15,128 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:05:15,128 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:05:15,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:05:15,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:05:15,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:05:15,129 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:05:15,129 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:05:15,129 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:05:15,164 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:05:15,165 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:15,165 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:05:15,166 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:05:15,166 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:05:15,166 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:15,166 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:05:15,166 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:05:15,167 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:15,167 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:15,192 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:05:15,192 INFO L131 PetriNetUnfolder]: For 3298/3507 co-relation queries the response was YES. [2022-12-06 00:05:15,193 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3298/3507 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2989 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:05:15,195 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:15,195 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:05:15,347 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:05:15,348 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 182 [2022-12-06 00:05:15,348 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:05:15,348 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:05:15,348 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:05:15,348 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:05:15,348 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable409 [2022-12-06 00:05:15,348 INFO L420 AbstractCegarLoop]: === Iteration 411 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:05:15,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:05:15,349 INFO L85 PathProgramCache]: Analyzing trace with hash 1819076674, now seen corresponding path program 1 times [2022-12-06 00:05:15,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:05:15,349 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192962067] [2022-12-06 00:05:15,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:05:15,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:05:15,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:05:15,415 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-06 00:05:15,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:05:15,416 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192962067] [2022-12-06 00:05:15,416 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [192962067] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:05:15,416 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:05:15,416 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:05:15,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88829610] [2022-12-06 00:05:15,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:05:15,416 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:05:15,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:05:15,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:05:15,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:05:15,417 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:05:15,417 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:05:15,417 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:05:15,417 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:05:15,417 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:05:15,714 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:05:15,714 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 00:05:15,719 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13562 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:05:15,727 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:05:15,727 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:05:15,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:05:15,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:05:15,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:05:15,728 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:05:15,728 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:05:15,728 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:05:15,761 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:05:15,762 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:15,762 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:05:15,763 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:05:15,763 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:05:15,763 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:15,764 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:05:15,764 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:05:15,764 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:15,764 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:15,788 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:05:15,788 INFO L131 PetriNetUnfolder]: For 3301/3509 co-relation queries the response was YES. [2022-12-06 00:05:15,789 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3301/3509 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2995 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:05:15,791 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:15,791 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:05:15,934 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:05:15,935 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 172 [2022-12-06 00:05:15,935 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:05:15,935 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:05:15,935 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:05:15,935 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:05:15,935 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable410 [2022-12-06 00:05:15,935 INFO L420 AbstractCegarLoop]: === Iteration 412 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:05:15,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:05:15,936 INFO L85 PathProgramCache]: Analyzing trace with hash -733080287, now seen corresponding path program 1 times [2022-12-06 00:05:15,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:05:15,936 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873905227] [2022-12-06 00:05:15,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:05:15,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:05:15,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:05:16,017 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-06 00:05:16,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:05:16,017 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873905227] [2022-12-06 00:05:16,017 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [873905227] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:05:16,017 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:05:16,018 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:05:16,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718259941] [2022-12-06 00:05:16,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:05:16,018 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:05:16,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:05:16,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:05:16,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:05:16,018 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:05:16,018 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:05:16,019 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:05:16,019 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:05:16,019 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:05:16,313 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:05:16,314 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 00:05:16,319 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13559 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:05:16,327 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:05:16,328 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:05:16,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:05:16,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:05:16,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:05:16,328 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:05:16,328 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:05:16,329 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:05:16,365 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:05:16,366 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:16,366 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:05:16,366 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:05:16,366 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:05:16,366 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:16,367 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:05:16,367 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:05:16,367 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:16,367 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:16,391 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:05:16,391 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 00:05:16,392 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3312/3520 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2982 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:05:16,394 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:16,394 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:05:16,538 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:05:16,538 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 172 [2022-12-06 00:05:16,538 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:05:16,538 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:05:16,538 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:05:16,539 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:05:16,539 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable411 [2022-12-06 00:05:16,539 INFO L420 AbstractCegarLoop]: === Iteration 413 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:05:16,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:05:16,539 INFO L85 PathProgramCache]: Analyzing trace with hash 1009730048, now seen corresponding path program 1 times [2022-12-06 00:05:16,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:05:16,539 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793343936] [2022-12-06 00:05:16,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:05:16,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:05:16,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:05:16,598 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-06 00:05:16,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:05:16,599 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793343936] [2022-12-06 00:05:16,599 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1793343936] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:05:16,599 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:05:16,599 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:05:16,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428964139] [2022-12-06 00:05:16,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:05:16,599 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:05:16,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:05:16,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:05:16,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:05:16,599 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:05:16,600 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:05:16,600 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:05:16,600 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:05:16,600 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:05:16,889 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:05:16,889 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:05:16,894 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13551 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:05:16,903 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:05:16,903 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:05:16,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:05:16,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:05:16,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:05:16,904 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:05:16,904 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:05:16,904 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:05:16,939 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:05:16,940 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:16,940 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:05:16,941 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:05:16,941 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:05:16,941 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:16,941 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:05:16,941 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:05:16,942 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:16,942 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:16,976 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:05:16,976 INFO L131 PetriNetUnfolder]: For 3348/3558 co-relation queries the response was YES. [2022-12-06 00:05:16,977 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3348/3558 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2978 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:05:16,979 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:16,979 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:05:17,119 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:05:17,120 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 179 [2022-12-06 00:05:17,120 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:05:17,120 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:05:17,120 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:05:17,120 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:05:17,120 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable412 [2022-12-06 00:05:17,120 INFO L420 AbstractCegarLoop]: === Iteration 414 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:05:17,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:05:17,120 INFO L85 PathProgramCache]: Analyzing trace with hash -1542426913, now seen corresponding path program 1 times [2022-12-06 00:05:17,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:05:17,121 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553814592] [2022-12-06 00:05:17,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:05:17,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:05:17,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:05:17,178 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-06 00:05:17,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:05:17,179 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553814592] [2022-12-06 00:05:17,179 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1553814592] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:05:17,179 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:05:17,179 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:05:17,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942779288] [2022-12-06 00:05:17,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:05:17,179 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:05:17,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:05:17,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:05:17,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:05:17,179 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:05:17,179 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:05:17,179 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:05:17,180 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:05:17,180 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:05:17,454 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:05:17,454 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 00:05:17,459 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26965/27010 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13526 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:05:17,467 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:05:17,467 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:05:17,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:05:17,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:05:17,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:05:17,468 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:05:17,468 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:05:17,468 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:05:17,503 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:05:17,504 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:17,504 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:05:17,504 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:05:17,505 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:05:17,505 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:17,505 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:05:17,505 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:05:17,505 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:17,506 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:17,529 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:05:17,530 INFO L131 PetriNetUnfolder]: For 3122/3262 co-relation queries the response was YES. [2022-12-06 00:05:17,531 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3122/3262 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2975 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:05:17,532 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:17,533 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:05:17,683 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:05:17,683 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 179 [2022-12-06 00:05:17,683 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:05:17,684 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:05:17,684 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:05:17,684 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:05:17,684 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable413 [2022-12-06 00:05:17,684 INFO L420 AbstractCegarLoop]: === Iteration 415 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:05:17,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:05:17,684 INFO L85 PathProgramCache]: Analyzing trace with hash 200383422, now seen corresponding path program 1 times [2022-12-06 00:05:17,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:05:17,684 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527251961] [2022-12-06 00:05:17,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:05:17,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:05:17,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:05:17,772 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-06 00:05:17,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:05:17,773 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527251961] [2022-12-06 00:05:17,773 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1527251961] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:05:17,773 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:05:17,773 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:05:17,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252671930] [2022-12-06 00:05:17,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:05:17,773 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:05:17,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:05:17,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:05:17,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:05:17,774 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:05:17,774 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:05:17,774 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:05:17,774 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:05:17,774 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:05:18,088 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:05:18,089 INFO L131 PetriNetUnfolder]: For 27136/27181 co-relation queries the response was YES. [2022-12-06 00:05:18,094 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27136/27181 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13532 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:05:18,102 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:05:18,102 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:05:18,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:05:18,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:05:18,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:05:18,103 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:05:18,103 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:05:18,103 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:05:18,139 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:05:18,140 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:18,140 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:05:18,141 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:05:18,141 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:05:18,141 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:18,141 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:05:18,141 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:05:18,141 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:18,142 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:18,166 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:05:18,166 INFO L131 PetriNetUnfolder]: For 3167/3307 co-relation queries the response was YES. [2022-12-06 00:05:18,167 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3167/3307 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 3009 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:05:18,169 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:18,169 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:05:18,317 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:05:18,318 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 177 [2022-12-06 00:05:18,318 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:05:18,318 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:05:18,318 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:05:18,318 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:05:18,318 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable414 [2022-12-06 00:05:18,318 INFO L420 AbstractCegarLoop]: === Iteration 416 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:05:18,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:05:18,318 INFO L85 PathProgramCache]: Analyzing trace with hash 1943193757, now seen corresponding path program 1 times [2022-12-06 00:05:18,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:05:18,318 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61360082] [2022-12-06 00:05:18,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:05:18,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:05:18,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:05:18,387 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-06 00:05:18,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:05:18,387 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61360082] [2022-12-06 00:05:18,387 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [61360082] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:05:18,387 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:05:18,387 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:05:18,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288837378] [2022-12-06 00:05:18,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:05:18,388 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:05:18,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:05:18,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:05:18,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:05:18,388 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:05:18,388 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:05:18,388 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:05:18,389 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:05:18,389 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:05:18,691 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:05:18,691 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 00:05:18,696 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26969/27014 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13531 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:05:18,703 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:05:18,703 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:05:18,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:05:18,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:05:18,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:05:18,704 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:05:18,704 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:05:18,704 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:05:18,735 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:05:18,736 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:18,736 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:05:18,736 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:05:18,736 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:05:18,736 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:18,737 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:05:18,737 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:05:18,737 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:18,737 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:18,762 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:05:18,762 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 00:05:18,763 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3133/3273 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2987 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:05:18,765 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:18,765 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:05:18,920 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:05:18,920 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 184 [2022-12-06 00:05:18,920 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:05:18,920 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:05:18,921 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:05:18,921 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:05:18,921 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable415 [2022-12-06 00:05:18,921 INFO L420 AbstractCegarLoop]: === Iteration 417 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:05:18,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:05:18,921 INFO L85 PathProgramCache]: Analyzing trace with hash -608963204, now seen corresponding path program 1 times [2022-12-06 00:05:18,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:05:18,921 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20120729] [2022-12-06 00:05:18,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:05:18,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:05:18,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:05:18,979 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-06 00:05:18,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:05:18,979 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20120729] [2022-12-06 00:05:18,979 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [20120729] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:05:18,979 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:05:18,980 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:05:18,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170774755] [2022-12-06 00:05:18,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:05:18,980 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:05:18,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:05:18,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:05:18,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:05:18,980 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:05:18,980 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:05:18,980 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:05:18,980 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:05:18,980 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:05:19,259 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:05:19,260 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:05:19,265 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13571 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:05:19,274 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:05:19,275 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:05:19,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:05:19,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:05:19,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:05:19,275 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:05:19,276 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:05:19,276 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:05:19,317 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:05:19,319 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:19,319 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:05:19,319 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:05:19,319 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:05:19,319 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:19,319 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:05:19,320 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:05:19,320 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:19,320 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:19,347 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:05:19,347 INFO L131 PetriNetUnfolder]: For 3338/3547 co-relation queries the response was YES. [2022-12-06 00:05:19,348 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3338/3547 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2972 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:05:19,350 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:19,350 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:05:19,504 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:05:19,505 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 186 [2022-12-06 00:05:19,505 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:05:19,505 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:05:19,505 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:05:19,505 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:05:19,505 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable416 [2022-12-06 00:05:19,505 INFO L420 AbstractCegarLoop]: === Iteration 418 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:05:19,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:05:19,505 INFO L85 PathProgramCache]: Analyzing trace with hash 1133847131, now seen corresponding path program 1 times [2022-12-06 00:05:19,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:05:19,505 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3806149] [2022-12-06 00:05:19,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:05:19,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:05:19,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:05:19,571 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-06 00:05:19,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:05:19,572 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3806149] [2022-12-06 00:05:19,572 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [3806149] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:05:19,572 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:05:19,572 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:05:19,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295346575] [2022-12-06 00:05:19,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:05:19,572 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:05:19,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:05:19,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:05:19,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:05:19,573 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:05:19,573 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:05:19,573 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:05:19,573 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:05:19,573 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:05:19,863 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:05:19,863 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 00:05:19,869 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26965/27010 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13497 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:05:19,876 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:05:19,876 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:05:19,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:05:19,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:05:19,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:05:19,877 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:05:19,877 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:05:19,877 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:05:19,911 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:05:19,912 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:19,912 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:05:19,912 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:05:19,912 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:05:19,913 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:19,913 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:05:19,913 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:05:19,913 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:19,914 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:19,938 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:05:19,938 INFO L131 PetriNetUnfolder]: For 3122/3262 co-relation queries the response was YES. [2022-12-06 00:05:19,939 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3122/3262 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2973 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:05:19,941 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:19,941 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:05:20,082 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:05:20,083 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 171 [2022-12-06 00:05:20,083 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:05:20,083 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:05:20,083 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:05:20,083 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:05:20,083 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable417 [2022-12-06 00:05:20,083 INFO L420 AbstractCegarLoop]: === Iteration 419 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:05:20,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:05:20,083 INFO L85 PathProgramCache]: Analyzing trace with hash -1418309830, now seen corresponding path program 1 times [2022-12-06 00:05:20,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:05:20,083 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693380673] [2022-12-06 00:05:20,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:05:20,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:05:20,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:05:20,158 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-06 00:05:20,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:05:20,159 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693380673] [2022-12-06 00:05:20,159 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [693380673] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:05:20,159 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:05:20,159 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:05:20,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519862032] [2022-12-06 00:05:20,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:05:20,159 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:05:20,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:05:20,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:05:20,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:05:20,160 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:05:20,160 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:05:20,160 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:05:20,160 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:05:20,160 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:05:20,469 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:05:20,469 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 00:05:20,475 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13554 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:05:20,483 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:05:20,483 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:05:20,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:05:20,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:05:20,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:05:20,484 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:05:20,484 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:05:20,484 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:05:20,517 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:05:20,519 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:20,519 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:05:20,519 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:05:20,519 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:05:20,519 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:20,520 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:05:20,520 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:05:20,520 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:20,520 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:20,544 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:05:20,545 INFO L131 PetriNetUnfolder]: For 3301/3509 co-relation queries the response was YES. [2022-12-06 00:05:20,546 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3301/3509 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2989 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:05:20,548 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:20,548 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:05:20,694 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:05:20,694 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 175 [2022-12-06 00:05:20,694 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:05:20,694 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:05:20,694 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:05:20,694 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:05:20,694 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable418 [2022-12-06 00:05:20,694 INFO L420 AbstractCegarLoop]: === Iteration 420 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:05:20,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:05:20,695 INFO L85 PathProgramCache]: Analyzing trace with hash 324500505, now seen corresponding path program 1 times [2022-12-06 00:05:20,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:05:20,695 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011637081] [2022-12-06 00:05:20,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:05:20,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:05:20,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:05:20,752 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-06 00:05:20,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:05:20,752 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011637081] [2022-12-06 00:05:20,752 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1011637081] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:05:20,752 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:05:20,752 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:05:20,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187695510] [2022-12-06 00:05:20,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:05:20,753 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:05:20,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:05:20,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:05:20,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:05:20,753 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:05:20,753 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:05:20,753 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:05:20,753 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:05:20,753 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:05:21,048 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:05:21,048 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 00:05:21,055 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13560 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:05:21,064 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:05:21,064 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:05:21,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:05:21,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:05:21,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:05:21,065 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:05:21,065 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:05:21,065 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:05:21,106 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:05:21,107 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:21,107 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:05:21,107 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:05:21,107 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:05:21,107 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:21,108 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:05:21,108 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:05:21,108 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:21,109 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:21,134 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:05:21,134 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 00:05:21,135 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3321/3530 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2974 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:05:21,137 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:21,137 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:05:21,306 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:05:21,307 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 200 [2022-12-06 00:05:21,307 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:05:21,307 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:05:21,307 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:05:21,307 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:05:21,307 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable419 [2022-12-06 00:05:21,307 INFO L420 AbstractCegarLoop]: === Iteration 421 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:05:21,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:05:21,308 INFO L85 PathProgramCache]: Analyzing trace with hash 2067310840, now seen corresponding path program 1 times [2022-12-06 00:05:21,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:05:21,308 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725778025] [2022-12-06 00:05:21,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:05:21,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:05:21,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:05:21,375 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-06 00:05:21,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:05:21,376 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725778025] [2022-12-06 00:05:21,376 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [725778025] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:05:21,376 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:05:21,376 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:05:21,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152994017] [2022-12-06 00:05:21,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:05:21,376 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:05:21,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:05:21,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:05:21,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:05:21,376 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:05:21,376 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:05:21,376 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:05:21,376 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:05:21,377 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:05:21,684 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:05:21,684 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:05:21,689 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13542 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:05:21,695 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:05:21,695 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:05:21,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:05:21,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:05:21,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:05:21,696 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:05:21,696 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:05:21,696 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:05:21,726 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:05:21,727 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:21,727 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:05:21,727 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:05:21,727 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:05:21,727 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:21,728 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:05:21,728 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:05:21,728 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:21,728 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:21,753 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:05:21,753 INFO L131 PetriNetUnfolder]: For 3348/3558 co-relation queries the response was YES. [2022-12-06 00:05:21,754 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3348/3558 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2975 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:05:21,756 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:21,756 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:05:21,900 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:05:21,901 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 174 [2022-12-06 00:05:21,901 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:05:21,901 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:05:21,901 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:05:21,901 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:05:21,901 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable420 [2022-12-06 00:05:21,901 INFO L420 AbstractCegarLoop]: === Iteration 422 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:05:21,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:05:21,901 INFO L85 PathProgramCache]: Analyzing trace with hash -484846121, now seen corresponding path program 1 times [2022-12-06 00:05:21,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:05:21,902 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434201028] [2022-12-06 00:05:21,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:05:21,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:05:21,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:05:21,967 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-06 00:05:21,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:05:21,967 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434201028] [2022-12-06 00:05:21,967 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [434201028] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:05:21,967 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:05:21,967 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:05:21,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609876498] [2022-12-06 00:05:21,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:05:21,968 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:05:21,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:05:21,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:05:21,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:05:21,968 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:05:21,968 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:05:21,968 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:05:21,968 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:05:21,968 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:05:22,254 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:05:22,254 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:05:22,260 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13532 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:05:22,267 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:05:22,267 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:05:22,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:05:22,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:05:22,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:05:22,268 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:05:22,268 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:05:22,268 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:05:22,302 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:05:22,303 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:22,303 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:05:22,304 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:05:22,304 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:05:22,304 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:22,304 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:05:22,304 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:05:22,304 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:22,305 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:22,340 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:05:22,340 INFO L131 PetriNetUnfolder]: For 3304/3511 co-relation queries the response was YES. [2022-12-06 00:05:22,342 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3304/3511 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2979 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:05:22,344 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:22,344 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:05:22,508 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:05:22,509 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 205 [2022-12-06 00:05:22,509 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:05:22,509 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:05:22,509 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:05:22,509 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:05:22,509 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable421 [2022-12-06 00:05:22,509 INFO L420 AbstractCegarLoop]: === Iteration 423 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:05:22,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:05:22,509 INFO L85 PathProgramCache]: Analyzing trace with hash 1257964214, now seen corresponding path program 1 times [2022-12-06 00:05:22,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:05:22,509 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915905662] [2022-12-06 00:05:22,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:05:22,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:05:22,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:05:22,578 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-06 00:05:22,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:05:22,578 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915905662] [2022-12-06 00:05:22,578 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1915905662] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:05:22,578 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:05:22,578 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:05:22,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653781483] [2022-12-06 00:05:22,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:05:22,579 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:05:22,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:05:22,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:05:22,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:05:22,579 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:05:22,579 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:05:22,579 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:05:22,579 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:05:22,579 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:05:22,861 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:05:22,862 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:05:22,867 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13578 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:05:22,875 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:05:22,875 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:05:22,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:05:22,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:05:22,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:05:22,876 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:05:22,876 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:05:22,876 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:05:22,910 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:05:22,912 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:22,912 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:05:22,912 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:05:22,912 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:05:22,912 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:22,912 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:05:22,913 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:05:22,913 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:22,913 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:22,937 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:05:22,937 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 00:05:22,938 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3321/3530 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2981 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:05:22,940 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:22,940 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:05:23,096 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:05:23,099 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 187 [2022-12-06 00:05:23,099 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:05:23,099 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:05:23,100 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:05:23,100 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:05:23,100 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable422 [2022-12-06 00:05:23,100 INFO L420 AbstractCegarLoop]: === Iteration 424 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:05:23,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:05:23,100 INFO L85 PathProgramCache]: Analyzing trace with hash -1294192747, now seen corresponding path program 1 times [2022-12-06 00:05:23,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:05:23,100 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420019732] [2022-12-06 00:05:23,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:05:23,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:05:23,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:05:23,167 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-06 00:05:23,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:05:23,167 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420019732] [2022-12-06 00:05:23,167 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1420019732] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:05:23,167 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:05:23,167 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:05:23,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563555173] [2022-12-06 00:05:23,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:05:23,167 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:05:23,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:05:23,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:05:23,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:05:23,168 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:05:23,168 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:05:23,168 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:05:23,168 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:05:23,168 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:05:23,450 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:05:23,450 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 00:05:23,456 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26965/27010 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13539 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:05:23,463 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:05:23,463 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:05:23,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:05:23,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:05:23,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:05:23,464 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:05:23,464 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:05:23,464 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:05:23,500 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:05:23,502 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:23,502 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:05:23,502 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:05:23,502 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:05:23,502 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:23,502 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:05:23,502 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:05:23,503 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:23,503 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:23,528 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:05:23,528 INFO L131 PetriNetUnfolder]: For 3134/3275 co-relation queries the response was YES. [2022-12-06 00:05:23,529 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3134/3275 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2987 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:05:23,531 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:23,531 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:05:23,689 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:05:23,689 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 187 [2022-12-06 00:05:23,689 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:05:23,689 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:05:23,689 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:05:23,689 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:05:23,690 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable423 [2022-12-06 00:05:23,690 INFO L420 AbstractCegarLoop]: === Iteration 425 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:05:23,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:05:23,690 INFO L85 PathProgramCache]: Analyzing trace with hash 448617588, now seen corresponding path program 1 times [2022-12-06 00:05:23,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:05:23,690 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613446041] [2022-12-06 00:05:23,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:05:23,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:05:23,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:05:23,774 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-06 00:05:23,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:05:23,774 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613446041] [2022-12-06 00:05:23,774 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1613446041] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:05:23,775 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:05:23,775 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:05:23,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057963690] [2022-12-06 00:05:23,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:05:23,775 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:05:23,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:05:23,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:05:23,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:05:23,775 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:05:23,775 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:05:23,775 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:05:23,776 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:05:23,776 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:05:24,083 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:05:24,083 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:05:24,089 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13552 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:05:24,096 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:05:24,096 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:05:24,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:05:24,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:05:24,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:05:24,097 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:05:24,097 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:05:24,097 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:05:24,131 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:05:24,132 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:24,132 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:05:24,133 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:05:24,133 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:05:24,133 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:24,133 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:05:24,133 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:05:24,133 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:24,134 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:24,158 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:05:24,158 INFO L131 PetriNetUnfolder]: For 3348/3558 co-relation queries the response was YES. [2022-12-06 00:05:24,159 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3348/3558 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2980 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:05:24,161 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:24,161 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:05:24,301 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:05:24,302 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 169 [2022-12-06 00:05:24,302 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:05:24,302 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:05:24,302 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:05:24,302 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:05:24,302 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable424 [2022-12-06 00:05:24,302 INFO L420 AbstractCegarLoop]: === Iteration 426 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:05:24,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:05:24,302 INFO L85 PathProgramCache]: Analyzing trace with hash -2103539373, now seen corresponding path program 1 times [2022-12-06 00:05:24,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:05:24,302 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193339337] [2022-12-06 00:05:24,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:05:24,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:05:24,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:05:24,372 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-06 00:05:24,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:05:24,372 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193339337] [2022-12-06 00:05:24,372 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [193339337] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:05:24,372 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:05:24,372 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:05:24,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358879435] [2022-12-06 00:05:24,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:05:24,373 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:05:24,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:05:24,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:05:24,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:05:24,373 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:05:24,373 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:05:24,373 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:05:24,373 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:05:24,373 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:05:24,679 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:05:24,679 INFO L131 PetriNetUnfolder]: For 27229/27274 co-relation queries the response was YES. [2022-12-06 00:05:24,685 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27229/27274 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13557 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:05:24,694 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:05:24,694 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:05:24,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:05:24,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:05:24,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:05:24,695 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:05:24,695 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:05:24,695 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:05:24,759 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:05:24,760 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:24,760 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:05:24,760 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:05:24,760 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:05:24,761 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:24,761 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:05:24,761 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:05:24,761 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:24,762 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:24,786 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:05:24,786 INFO L131 PetriNetUnfolder]: For 3309/3518 co-relation queries the response was YES. [2022-12-06 00:05:24,787 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3309/3518 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2984 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:05:24,789 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:24,789 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:05:24,943 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:05:24,943 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 183 [2022-12-06 00:05:24,943 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:05:24,944 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:05:24,944 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:05:24,944 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:05:24,944 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable425 [2022-12-06 00:05:24,944 INFO L420 AbstractCegarLoop]: === Iteration 427 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:05:24,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:05:24,944 INFO L85 PathProgramCache]: Analyzing trace with hash -360729038, now seen corresponding path program 1 times [2022-12-06 00:05:24,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:05:24,944 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638488958] [2022-12-06 00:05:24,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:05:24,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:05:24,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:05:25,000 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-06 00:05:25,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:05:25,000 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638488958] [2022-12-06 00:05:25,000 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1638488958] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:05:25,000 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:05:25,000 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:05:25,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882568099] [2022-12-06 00:05:25,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:05:25,001 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:05:25,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:05:25,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:05:25,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:05:25,001 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:05:25,001 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:05:25,001 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:05:25,001 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:05:25,001 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:05:25,305 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:05:25,305 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 00:05:25,314 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26969/27014 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13523 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:05:25,325 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:05:25,325 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:05:25,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:05:25,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:05:25,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:05:25,328 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:05:25,328 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:05:25,328 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:05:25,371 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:05:25,372 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:25,372 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:05:25,373 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:05:25,373 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:05:25,373 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:25,373 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:05:25,373 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:05:25,373 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:25,374 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:25,400 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:05:25,401 INFO L131 PetriNetUnfolder]: For 3122/3262 co-relation queries the response was YES. [2022-12-06 00:05:25,402 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3122/3262 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2991 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:05:25,404 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:25,404 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:05:25,550 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:05:25,551 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 178 [2022-12-06 00:05:25,551 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:05:25,551 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:05:25,551 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:05:25,551 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:05:25,551 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable426 [2022-12-06 00:05:25,551 INFO L420 AbstractCegarLoop]: === Iteration 428 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:05:25,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:05:25,551 INFO L85 PathProgramCache]: Analyzing trace with hash 1382081297, now seen corresponding path program 1 times [2022-12-06 00:05:25,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:05:25,551 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088928929] [2022-12-06 00:05:25,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:05:25,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:05:25,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:05:25,617 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-06 00:05:25,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:05:25,617 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088928929] [2022-12-06 00:05:25,617 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2088928929] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:05:25,618 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:05:25,618 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:05:25,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495676061] [2022-12-06 00:05:25,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:05:25,618 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:05:25,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:05:25,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:05:25,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:05:25,618 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:05:25,618 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:05:25,618 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:05:25,618 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:05:25,618 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:05:25,908 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:05:25,908 INFO L131 PetriNetUnfolder]: For 26955/27000 co-relation queries the response was YES. [2022-12-06 00:05:25,915 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26955/27000 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13558 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:05:25,922 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:05:25,922 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:05:25,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:05:25,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:05:25,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:05:25,923 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:05:25,923 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:05:25,923 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:05:25,961 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:05:25,962 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:25,962 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:05:25,962 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:05:25,963 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:05:25,963 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:25,963 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:05:25,963 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:05:25,963 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:25,964 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:25,989 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:05:25,989 INFO L131 PetriNetUnfolder]: For 3122/3262 co-relation queries the response was YES. [2022-12-06 00:05:25,990 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3122/3262 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2982 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:05:25,992 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:25,992 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:05:26,140 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:05:26,140 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 177 [2022-12-06 00:05:26,140 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:05:26,140 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:05:26,140 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:05:26,140 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:05:26,140 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable427 [2022-12-06 00:05:26,141 INFO L420 AbstractCegarLoop]: === Iteration 429 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:05:26,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:05:26,141 INFO L85 PathProgramCache]: Analyzing trace with hash -1170075664, now seen corresponding path program 1 times [2022-12-06 00:05:26,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:05:26,141 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299003193] [2022-12-06 00:05:26,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:05:26,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:05:26,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:05:26,212 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-06 00:05:26,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:05:26,212 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299003193] [2022-12-06 00:05:26,212 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [299003193] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:05:26,212 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:05:26,212 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:05:26,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017332267] [2022-12-06 00:05:26,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:05:26,213 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:05:26,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:05:26,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:05:26,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:05:26,213 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:05:26,213 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:05:26,213 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:05:26,213 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:05:26,213 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:05:26,500 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:05:26,501 INFO L131 PetriNetUnfolder]: For 27136/27181 co-relation queries the response was YES. [2022-12-06 00:05:26,506 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27136/27181 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13533 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:05:26,514 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:05:26,514 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:05:26,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:05:26,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:05:26,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:05:26,515 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:05:26,515 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:05:26,515 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:05:26,550 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:05:26,551 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:26,551 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:05:26,552 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:05:26,552 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:05:26,552 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:26,552 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:05:26,552 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:05:26,552 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:26,553 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:26,577 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:05:26,577 INFO L131 PetriNetUnfolder]: For 3169/3310 co-relation queries the response was YES. [2022-12-06 00:05:26,578 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3169/3310 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2993 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:05:26,580 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:26,581 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:05:26,726 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:05:26,726 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 174 [2022-12-06 00:05:26,726 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:05:26,726 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:05:26,726 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:05:26,726 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:05:26,726 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable428 [2022-12-06 00:05:26,726 INFO L420 AbstractCegarLoop]: === Iteration 430 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:05:26,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:05:26,727 INFO L85 PathProgramCache]: Analyzing trace with hash 572734671, now seen corresponding path program 1 times [2022-12-06 00:05:26,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:05:26,727 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524675508] [2022-12-06 00:05:26,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:05:26,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:05:26,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:05:26,792 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:05:26,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:05:26,793 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524675508] [2022-12-06 00:05:26,793 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [524675508] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:05:26,793 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:05:26,793 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:05:26,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359329927] [2022-12-06 00:05:26,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:05:26,793 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:05:26,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:05:26,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:05:26,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:05:26,794 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:05:26,794 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:05:26,794 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:05:26,794 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:05:26,794 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:05:27,083 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:05:27,083 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 00:05:27,089 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13579 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:05:27,098 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:05:27,098 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:05:27,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:05:27,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:05:27,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:05:27,099 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:05:27,099 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:05:27,100 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:05:27,137 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:05:27,138 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:27,138 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:05:27,138 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:05:27,138 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:05:27,139 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:27,139 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:05:27,139 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:05:27,139 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:27,140 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:27,164 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:05:27,164 INFO L131 PetriNetUnfolder]: For 3298/3507 co-relation queries the response was YES. [2022-12-06 00:05:27,165 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3298/3507 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2994 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:05:27,167 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:27,167 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:05:27,317 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:05:27,318 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 180 [2022-12-06 00:05:27,318 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:05:27,318 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:05:27,318 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:05:27,318 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:05:27,318 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable429 [2022-12-06 00:05:27,318 INFO L420 AbstractCegarLoop]: === Iteration 431 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:05:27,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:05:27,319 INFO L85 PathProgramCache]: Analyzing trace with hash -1979422290, now seen corresponding path program 1 times [2022-12-06 00:05:27,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:05:27,319 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998166607] [2022-12-06 00:05:27,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:05:27,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:05:27,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:05:27,378 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-06 00:05:27,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:05:27,379 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998166607] [2022-12-06 00:05:27,379 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [998166607] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:05:27,379 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:05:27,379 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:05:27,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707864809] [2022-12-06 00:05:27,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:05:27,379 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:05:27,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:05:27,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:05:27,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:05:27,379 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:05:27,379 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:05:27,380 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:05:27,380 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:05:27,380 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:05:27,667 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:05:27,667 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 00:05:27,673 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13541 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:05:27,680 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:05:27,681 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:05:27,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:05:27,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:05:27,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:05:27,681 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:05:27,681 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:05:27,681 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:05:27,718 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:05:27,719 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:27,719 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:05:27,720 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:05:27,720 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:05:27,720 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:27,720 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:05:27,720 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:05:27,720 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:27,721 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:27,749 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:05:27,749 INFO L131 PetriNetUnfolder]: For 3318/3528 co-relation queries the response was YES. [2022-12-06 00:05:27,750 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3318/3528 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2965 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:05:27,753 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:27,753 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:05:27,913 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:05:27,914 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 194 [2022-12-06 00:05:27,914 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:05:27,914 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:05:27,914 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:05:27,914 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:05:27,914 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable430 [2022-12-06 00:05:27,914 INFO L420 AbstractCegarLoop]: === Iteration 432 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:05:27,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:05:27,914 INFO L85 PathProgramCache]: Analyzing trace with hash -236611955, now seen corresponding path program 1 times [2022-12-06 00:05:27,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:05:27,915 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428211836] [2022-12-06 00:05:27,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:05:27,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:05:27,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:05:27,980 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-06 00:05:27,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:05:27,980 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428211836] [2022-12-06 00:05:27,981 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [428211836] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:05:27,981 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:05:27,981 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:05:27,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218768679] [2022-12-06 00:05:27,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:05:27,981 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:05:27,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:05:27,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:05:27,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:05:27,981 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:05:27,981 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:05:27,981 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:05:27,981 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:05:27,981 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:05:28,279 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:05:28,279 INFO L131 PetriNetUnfolder]: For 27146/27191 co-relation queries the response was YES. [2022-12-06 00:05:28,284 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27146/27191 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13512 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:05:28,292 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:05:28,292 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:05:28,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:05:28,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:05:28,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:05:28,293 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:05:28,293 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:05:28,293 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:05:28,326 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:05:28,327 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:28,328 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:05:28,328 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:05:28,328 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:05:28,328 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:28,328 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:05:28,328 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:05:28,328 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:28,329 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:28,353 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:05:28,353 INFO L131 PetriNetUnfolder]: For 3167/3307 co-relation queries the response was YES. [2022-12-06 00:05:28,354 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3167/3307 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2996 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:05:28,356 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:28,356 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:05:28,524 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:05:28,525 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 197 [2022-12-06 00:05:28,525 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:05:28,525 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:05:28,525 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:05:28,525 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:05:28,525 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable431 [2022-12-06 00:05:28,525 INFO L420 AbstractCegarLoop]: === Iteration 433 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:05:28,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:05:28,526 INFO L85 PathProgramCache]: Analyzing trace with hash 1506198380, now seen corresponding path program 1 times [2022-12-06 00:05:28,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:05:28,526 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539037655] [2022-12-06 00:05:28,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:05:28,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:05:28,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:05:28,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:05:28,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:05:28,587 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539037655] [2022-12-06 00:05:28,587 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1539037655] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:05:28,587 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:05:28,587 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:05:28,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275897121] [2022-12-06 00:05:28,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:05:28,587 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:05:28,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:05:28,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:05:28,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:05:28,588 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:05:28,588 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:05:28,588 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:05:28,588 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:05:28,588 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:05:28,877 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:05:28,877 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 00:05:28,882 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26965/27010 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13540 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:05:28,888 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:05:28,888 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:05:28,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:05:28,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:05:28,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:05:28,889 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:05:28,889 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:05:28,889 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:05:28,924 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:05:28,925 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:28,925 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:05:28,925 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:05:28,925 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:05:28,925 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:28,925 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:05:28,925 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:05:28,926 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:28,926 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:28,949 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:05:28,950 INFO L131 PetriNetUnfolder]: For 3135/3276 co-relation queries the response was YES. [2022-12-06 00:05:28,950 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3135/3276 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2971 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:05:28,952 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:28,952 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:05:29,090 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:05:29,091 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 166 [2022-12-06 00:05:29,091 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:05:29,091 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:05:29,091 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:05:29,091 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:05:29,091 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable432 [2022-12-06 00:05:29,091 INFO L420 AbstractCegarLoop]: === Iteration 434 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:05:29,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:05:29,092 INFO L85 PathProgramCache]: Analyzing trace with hash -1045958581, now seen corresponding path program 1 times [2022-12-06 00:05:29,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:05:29,092 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86594029] [2022-12-06 00:05:29,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:05:29,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:05:29,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:05:29,153 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-06 00:05:29,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:05:29,154 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86594029] [2022-12-06 00:05:29,154 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [86594029] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:05:29,154 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:05:29,154 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:05:29,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298383009] [2022-12-06 00:05:29,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:05:29,154 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:05:29,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:05:29,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:05:29,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:05:29,154 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:05:29,154 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:05:29,154 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:05:29,155 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:05:29,155 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:05:29,446 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:05:29,446 INFO L131 PetriNetUnfolder]: For 26955/27000 co-relation queries the response was YES. [2022-12-06 00:05:29,451 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26955/27000 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13551 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:05:29,457 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:05:29,457 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:05:29,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:05:29,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:05:29,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:05:29,457 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:05:29,457 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:05:29,457 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:05:29,492 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:05:29,493 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:29,494 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:05:29,494 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:05:29,494 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:05:29,494 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:29,494 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:05:29,495 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:05:29,495 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:29,495 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:29,523 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:05:29,523 INFO L131 PetriNetUnfolder]: For 3122/3262 co-relation queries the response was YES. [2022-12-06 00:05:29,524 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3122/3262 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2969 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:05:29,526 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:29,526 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:05:29,672 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:05:29,672 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 178 [2022-12-06 00:05:29,672 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:05:29,672 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:05:29,672 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:05:29,672 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:05:29,672 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable433 [2022-12-06 00:05:29,672 INFO L420 AbstractCegarLoop]: === Iteration 435 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:05:29,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:05:29,673 INFO L85 PathProgramCache]: Analyzing trace with hash 696851754, now seen corresponding path program 1 times [2022-12-06 00:05:29,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:05:29,673 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197770372] [2022-12-06 00:05:29,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:05:29,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:05:29,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:05:29,726 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:05:29,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:05:29,726 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197770372] [2022-12-06 00:05:29,726 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [197770372] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:05:29,726 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:05:29,727 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:05:29,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24329564] [2022-12-06 00:05:29,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:05:29,727 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:05:29,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:05:29,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:05:29,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:05:29,727 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:05:29,727 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:05:29,727 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:05:29,727 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:05:29,727 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:05:29,984 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:05:29,984 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 00:05:29,989 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13577 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:05:29,996 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:05:29,996 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:05:29,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:05:29,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:05:29,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:05:29,997 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:05:29,997 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:05:29,997 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:05:30,031 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:05:30,032 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:30,032 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:05:30,032 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:05:30,032 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:05:30,032 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:30,033 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:05:30,033 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:05:30,033 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:30,034 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:30,058 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:05:30,058 INFO L131 PetriNetUnfolder]: For 3301/3509 co-relation queries the response was YES. [2022-12-06 00:05:30,059 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3301/3509 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2973 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:05:30,061 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:30,061 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:05:30,207 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:05:30,208 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 176 [2022-12-06 00:05:30,208 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:05:30,208 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:05:30,208 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:05:30,208 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:05:30,208 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable434 [2022-12-06 00:05:30,208 INFO L420 AbstractCegarLoop]: === Iteration 436 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:05:30,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:05:30,208 INFO L85 PathProgramCache]: Analyzing trace with hash -1855305207, now seen corresponding path program 1 times [2022-12-06 00:05:30,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:05:30,209 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82460815] [2022-12-06 00:05:30,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:05:30,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:05:30,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:05:30,272 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-06 00:05:30,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:05:30,272 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82460815] [2022-12-06 00:05:30,272 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [82460815] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:05:30,272 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:05:30,272 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:05:30,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981626125] [2022-12-06 00:05:30,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:05:30,272 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:05:30,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:05:30,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:05:30,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:05:30,273 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:05:30,273 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:05:30,273 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:05:30,273 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:05:30,273 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:05:30,557 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:05:30,557 INFO L131 PetriNetUnfolder]: For 27136/27181 co-relation queries the response was YES. [2022-12-06 00:05:30,563 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27136/27181 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13520 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:05:30,572 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:05:30,572 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:05:30,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:05:30,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:05:30,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:05:30,575 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:05:30,576 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:05:30,576 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:05:30,612 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:05:30,613 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:30,614 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:05:30,614 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:05:30,614 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:05:30,614 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:30,614 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:05:30,614 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:05:30,615 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:30,615 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:30,640 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:05:30,640 INFO L131 PetriNetUnfolder]: For 3156/3296 co-relation queries the response was YES. [2022-12-06 00:05:30,641 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3156/3296 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 3020 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:05:30,644 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:30,644 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:05:30,809 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:05:30,810 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 196 [2022-12-06 00:05:30,810 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:05:30,810 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:05:30,810 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:05:30,810 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:05:30,810 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable435 [2022-12-06 00:05:30,810 INFO L420 AbstractCegarLoop]: === Iteration 437 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:05:30,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:05:30,810 INFO L85 PathProgramCache]: Analyzing trace with hash -112494872, now seen corresponding path program 1 times [2022-12-06 00:05:30,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:05:30,811 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762314763] [2022-12-06 00:05:30,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:05:30,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:05:30,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:05:30,882 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-06 00:05:30,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:05:30,883 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762314763] [2022-12-06 00:05:30,883 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1762314763] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:05:30,883 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:05:30,883 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:05:30,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486397413] [2022-12-06 00:05:30,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:05:30,883 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:05:30,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:05:30,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:05:30,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:05:30,883 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:05:30,883 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:05:30,883 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:05:30,884 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:05:30,884 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:05:31,195 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:05:31,196 INFO L131 PetriNetUnfolder]: For 26955/27000 co-relation queries the response was YES. [2022-12-06 00:05:31,201 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26955/27000 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13521 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:05:31,209 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:05:31,210 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:05:31,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:05:31,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:05:31,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:05:31,210 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:05:31,210 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:05:31,210 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:05:31,246 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:05:31,247 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:31,247 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:05:31,247 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:05:31,247 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:05:31,247 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:31,248 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:05:31,248 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:05:31,248 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:31,248 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:31,273 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:05:31,273 INFO L131 PetriNetUnfolder]: For 3135/3276 co-relation queries the response was YES. [2022-12-06 00:05:31,274 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3135/3276 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2978 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:05:31,276 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:31,276 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:05:31,421 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:05:31,422 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 175 [2022-12-06 00:05:31,422 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:05:31,422 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:05:31,422 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:05:31,422 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:05:31,422 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable436 [2022-12-06 00:05:31,422 INFO L420 AbstractCegarLoop]: === Iteration 438 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:05:31,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:05:31,422 INFO L85 PathProgramCache]: Analyzing trace with hash 1630315463, now seen corresponding path program 1 times [2022-12-06 00:05:31,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:05:31,422 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72070600] [2022-12-06 00:05:31,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:05:31,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:05:31,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:05:31,480 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-06 00:05:31,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:05:31,480 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72070600] [2022-12-06 00:05:31,480 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [72070600] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:05:31,480 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:05:31,480 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:05:31,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354537474] [2022-12-06 00:05:31,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:05:31,480 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:05:31,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:05:31,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:05:31,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:05:31,481 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:05:31,481 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:05:31,481 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:05:31,481 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:05:31,481 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:05:31,775 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:05:31,775 INFO L131 PetriNetUnfolder]: For 27136/27181 co-relation queries the response was YES. [2022-12-06 00:05:31,781 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27136/27181 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13533 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:05:31,790 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:05:31,790 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:05:31,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:05:31,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:05:31,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:05:31,791 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:05:31,791 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:05:31,791 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:05:31,829 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:05:31,831 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:31,831 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:05:31,831 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:05:31,831 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:05:31,831 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:31,832 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:05:31,832 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:05:31,832 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:31,832 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:31,857 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:05:31,857 INFO L131 PetriNetUnfolder]: For 3167/3307 co-relation queries the response was YES. [2022-12-06 00:05:31,858 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3167/3307 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 3002 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:05:31,860 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:31,860 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:05:32,008 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:05:32,008 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 177 [2022-12-06 00:05:32,008 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:05:32,008 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:05:32,008 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:05:32,008 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:05:32,008 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable437 [2022-12-06 00:05:32,009 INFO L420 AbstractCegarLoop]: === Iteration 439 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:05:32,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:05:32,009 INFO L85 PathProgramCache]: Analyzing trace with hash -921841498, now seen corresponding path program 1 times [2022-12-06 00:05:32,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:05:32,009 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54512701] [2022-12-06 00:05:32,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:05:32,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:05:32,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:05:32,094 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-06 00:05:32,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:05:32,094 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54512701] [2022-12-06 00:05:32,094 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [54512701] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:05:32,094 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:05:32,094 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:05:32,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170570428] [2022-12-06 00:05:32,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:05:32,095 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:05:32,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:05:32,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:05:32,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:05:32,095 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:05:32,095 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:05:32,095 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:05:32,095 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:05:32,096 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:05:32,493 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:05:32,494 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:05:32,500 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13565 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:05:32,509 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:05:32,510 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:05:32,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:05:32,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:05:32,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:05:32,510 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:05:32,511 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:05:32,511 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:05:32,577 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:05:32,579 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:32,579 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:05:32,579 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:05:32,579 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:05:32,579 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:32,580 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:05:32,580 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:05:32,580 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:32,580 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:32,605 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:05:32,605 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 00:05:32,606 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3312/3520 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2973 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:05:32,608 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:32,608 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:05:32,770 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:05:32,770 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 191 [2022-12-06 00:05:32,770 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:05:32,770 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:05:32,770 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:05:32,771 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:05:32,771 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable438 [2022-12-06 00:05:32,771 INFO L420 AbstractCegarLoop]: === Iteration 440 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:05:32,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:05:32,771 INFO L85 PathProgramCache]: Analyzing trace with hash 820968837, now seen corresponding path program 1 times [2022-12-06 00:05:32,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:05:32,771 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495564201] [2022-12-06 00:05:32,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:05:32,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:05:32,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:05:32,833 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:05:32,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:05:32,833 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495564201] [2022-12-06 00:05:32,833 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [495564201] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:05:32,833 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:05:32,833 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:05:32,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671387670] [2022-12-06 00:05:32,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:05:32,834 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:05:32,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:05:32,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:05:32,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:05:32,834 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:05:32,834 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:05:32,834 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:05:32,834 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:05:32,834 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:05:33,120 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:05:33,120 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:05:33,126 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13547 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:05:33,134 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:05:33,135 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:05:33,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:05:33,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:05:33,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:05:33,135 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:05:33,135 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:05:33,136 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:05:33,172 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:05:33,173 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:33,173 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:05:33,173 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:05:33,173 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:05:33,173 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:33,174 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:05:33,174 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:05:33,174 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:33,175 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:33,199 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:05:33,199 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 00:05:33,200 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3321/3530 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 3004 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:05:33,202 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:33,202 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:05:33,367 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:05:33,368 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 195 [2022-12-06 00:05:33,368 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:05:33,368 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:05:33,368 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:05:33,368 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:05:33,368 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable439 [2022-12-06 00:05:33,368 INFO L420 AbstractCegarLoop]: === Iteration 441 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:05:33,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:05:33,368 INFO L85 PathProgramCache]: Analyzing trace with hash -1731188124, now seen corresponding path program 1 times [2022-12-06 00:05:33,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:05:33,368 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032639630] [2022-12-06 00:05:33,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:05:33,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:05:33,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:05:33,434 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-06 00:05:33,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:05:33,434 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032639630] [2022-12-06 00:05:33,434 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1032639630] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:05:33,434 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:05:33,434 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:05:33,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219942681] [2022-12-06 00:05:33,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:05:33,434 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:05:33,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:05:33,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:05:33,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:05:33,435 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:05:33,435 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:05:33,435 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:05:33,435 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:05:33,435 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:05:33,729 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:05:33,729 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 00:05:33,735 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26969/27014 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13525 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:05:33,744 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:05:33,744 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:05:33,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:05:33,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:05:33,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:05:33,745 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:05:33,745 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:05:33,745 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:05:33,782 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:05:33,783 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:33,783 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:05:33,783 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:05:33,783 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:05:33,783 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:33,784 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:05:33,784 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:05:33,784 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:33,784 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:33,809 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:05:33,809 INFO L131 PetriNetUnfolder]: For 3140/3283 co-relation queries the response was YES. [2022-12-06 00:05:33,810 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3140/3283 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2955 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:05:33,812 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:33,812 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:05:33,955 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:05:33,956 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 173 [2022-12-06 00:05:33,956 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:05:33,956 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:05:33,956 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:05:33,956 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:05:33,956 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable440 [2022-12-06 00:05:33,956 INFO L420 AbstractCegarLoop]: === Iteration 442 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:05:33,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:05:33,956 INFO L85 PathProgramCache]: Analyzing trace with hash 11622211, now seen corresponding path program 1 times [2022-12-06 00:05:33,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:05:33,956 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258237427] [2022-12-06 00:05:33,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:05:33,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:05:33,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:05:34,010 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-06 00:05:34,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:05:34,010 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258237427] [2022-12-06 00:05:34,010 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1258237427] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:05:34,010 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:05:34,010 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:05:34,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361805696] [2022-12-06 00:05:34,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:05:34,011 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:05:34,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:05:34,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:05:34,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:05:34,011 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:05:34,011 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:05:34,011 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:05:34,011 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:05:34,011 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:05:34,301 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:05:34,301 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 00:05:34,307 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13569 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:05:34,315 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:05:34,315 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:05:34,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:05:34,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:05:34,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:05:34,316 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:05:34,316 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:05:34,316 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:05:34,350 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:05:34,351 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:34,351 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:05:34,351 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:05:34,351 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:05:34,351 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:34,352 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:05:34,352 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:05:34,352 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:34,352 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:34,377 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:05:34,377 INFO L131 PetriNetUnfolder]: For 3299/3508 co-relation queries the response was YES. [2022-12-06 00:05:34,378 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3299/3508 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2992 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:05:34,380 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:34,380 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:05:34,536 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:05:34,536 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 185 [2022-12-06 00:05:34,536 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:05:34,537 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:05:34,537 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:05:34,537 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:05:34,537 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable441 [2022-12-06 00:05:34,537 INFO L420 AbstractCegarLoop]: === Iteration 443 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:05:34,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:05:34,537 INFO L85 PathProgramCache]: Analyzing trace with hash 1754432546, now seen corresponding path program 1 times [2022-12-06 00:05:34,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:05:34,537 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130536577] [2022-12-06 00:05:34,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:05:34,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:05:34,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:05:34,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-06 00:05:34,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:05:34,611 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130536577] [2022-12-06 00:05:34,611 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [130536577] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:05:34,611 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:05:34,611 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:05:34,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615720977] [2022-12-06 00:05:34,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:05:34,611 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:05:34,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:05:34,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:05:34,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:05:34,611 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:05:34,612 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:05:34,612 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:05:34,612 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:05:34,612 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:05:34,898 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:05:34,898 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:05:34,904 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13561 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:05:34,913 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:05:34,913 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:05:34,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:05:34,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:05:34,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:05:34,913 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:05:34,914 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:05:34,914 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:05:34,949 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:05:34,950 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:34,951 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:05:34,951 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:05:34,951 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:05:34,951 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:34,951 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:05:34,951 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:05:34,951 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:34,952 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:34,976 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:05:34,976 INFO L131 PetriNetUnfolder]: For 3318/3528 co-relation queries the response was YES. [2022-12-06 00:05:34,977 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3318/3528 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2996 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:05:34,979 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:34,979 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:05:35,120 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:05:35,120 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 169 [2022-12-06 00:05:35,120 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:05:35,120 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:05:35,120 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:05:35,120 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:05:35,120 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable442 [2022-12-06 00:05:35,120 INFO L420 AbstractCegarLoop]: === Iteration 444 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:05:35,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:05:35,121 INFO L85 PathProgramCache]: Analyzing trace with hash -797724415, now seen corresponding path program 1 times [2022-12-06 00:05:35,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:05:35,121 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55279726] [2022-12-06 00:05:35,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:05:35,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:05:35,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:05:35,187 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-06 00:05:35,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:05:35,187 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55279726] [2022-12-06 00:05:35,187 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [55279726] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:05:35,187 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:05:35,187 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:05:35,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986793353] [2022-12-06 00:05:35,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:05:35,188 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:05:35,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:05:35,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:05:35,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:05:35,188 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:05:35,188 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:05:35,188 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:05:35,188 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:05:35,188 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:05:35,488 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:05:35,488 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:05:35,494 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13565 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:05:35,503 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:05:35,503 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:05:35,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:05:35,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:05:35,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:05:35,504 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:05:35,504 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:05:35,504 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:05:35,541 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:05:35,543 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:35,543 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:05:35,543 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:05:35,543 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:05:35,543 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:35,544 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:05:35,544 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:05:35,544 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:35,544 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:35,570 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:05:35,570 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 00:05:35,571 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3321/3530 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2987 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:05:35,573 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:35,573 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:05:35,740 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:05:35,740 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 197 [2022-12-06 00:05:35,740 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:05:35,740 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:05:35,740 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:05:35,740 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:05:35,741 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable443 [2022-12-06 00:05:35,741 INFO L420 AbstractCegarLoop]: === Iteration 445 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:05:35,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:05:35,741 INFO L85 PathProgramCache]: Analyzing trace with hash 945085920, now seen corresponding path program 1 times [2022-12-06 00:05:35,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:05:35,741 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809257226] [2022-12-06 00:05:35,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:05:35,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:05:35,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:05:35,811 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-06 00:05:35,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:05:35,812 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809257226] [2022-12-06 00:05:35,812 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [809257226] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:05:35,812 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:05:35,812 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:05:35,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139076569] [2022-12-06 00:05:35,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:05:35,812 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:05:35,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:05:35,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:05:35,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:05:35,813 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:05:35,813 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:05:35,813 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:05:35,813 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:05:35,813 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:05:36,124 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:05:36,124 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 00:05:36,130 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26969/27014 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13519 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:05:36,137 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:05:36,137 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:05:36,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:05:36,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:05:36,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:05:36,138 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:05:36,138 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:05:36,138 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:05:36,172 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:05:36,174 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:36,174 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:05:36,174 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:05:36,174 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:05:36,174 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:36,174 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:05:36,175 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:05:36,175 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:36,175 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:36,199 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:05:36,199 INFO L131 PetriNetUnfolder]: For 3146/3287 co-relation queries the response was YES. [2022-12-06 00:05:36,200 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3146/3287 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2987 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:05:36,202 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:36,202 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:05:36,358 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:05:36,358 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 184 [2022-12-06 00:05:36,358 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:05:36,358 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:05:36,359 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:05:36,359 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:05:36,359 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable444 [2022-12-06 00:05:36,359 INFO L420 AbstractCegarLoop]: === Iteration 446 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:05:36,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:05:36,359 INFO L85 PathProgramCache]: Analyzing trace with hash -1607071041, now seen corresponding path program 1 times [2022-12-06 00:05:36,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:05:36,359 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005386359] [2022-12-06 00:05:36,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:05:36,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:05:36,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:05:36,423 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-06 00:05:36,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:05:36,423 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005386359] [2022-12-06 00:05:36,423 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1005386359] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:05:36,423 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:05:36,423 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:05:36,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863743446] [2022-12-06 00:05:36,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:05:36,424 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:05:36,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:05:36,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:05:36,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:05:36,424 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:05:36,424 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:05:36,424 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:05:36,424 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:05:36,424 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:05:36,719 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:05:36,719 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 00:05:36,724 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26965/27010 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13526 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:05:36,732 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:05:36,732 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:05:36,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:05:36,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:05:36,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:05:36,733 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:05:36,733 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:05:36,733 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:05:36,768 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:05:36,769 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:36,770 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:05:36,770 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:05:36,770 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:05:36,770 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:36,770 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:05:36,770 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:05:36,770 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:36,771 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:36,796 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:05:36,796 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 00:05:36,797 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3133/3273 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2978 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:05:36,799 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:36,799 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:05:36,937 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:05:36,937 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 167 [2022-12-06 00:05:36,938 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:05:36,938 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:05:36,938 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:05:36,938 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:05:36,938 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable445 [2022-12-06 00:05:36,938 INFO L420 AbstractCegarLoop]: === Iteration 447 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:05:36,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:05:36,938 INFO L85 PathProgramCache]: Analyzing trace with hash 135739294, now seen corresponding path program 1 times [2022-12-06 00:05:36,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:05:36,938 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009127161] [2022-12-06 00:05:36,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:05:36,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:05:36,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:05:37,005 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-06 00:05:37,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:05:37,006 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009127161] [2022-12-06 00:05:37,006 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2009127161] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:05:37,006 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:05:37,006 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:05:37,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489407255] [2022-12-06 00:05:37,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:05:37,006 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:05:37,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:05:37,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:05:37,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:05:37,006 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:05:37,006 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:05:37,006 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:05:37,007 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:05:37,007 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:05:37,306 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:05:37,307 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:05:37,311 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13547 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:05:37,318 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:05:37,318 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:05:37,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:05:37,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:05:37,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:05:37,319 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:05:37,319 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:05:37,319 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:05:37,349 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:05:37,351 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:37,351 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:05:37,351 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:05:37,351 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:05:37,351 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:37,351 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:05:37,351 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:05:37,352 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:37,352 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:37,377 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:05:37,377 INFO L131 PetriNetUnfolder]: For 3301/3509 co-relation queries the response was YES. [2022-12-06 00:05:37,378 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3301/3509 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2997 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:05:37,380 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:37,380 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:05:37,528 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:05:37,528 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 177 [2022-12-06 00:05:37,528 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:05:37,528 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:05:37,528 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:05:37,528 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:05:37,528 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable446 [2022-12-06 00:05:37,529 INFO L420 AbstractCegarLoop]: === Iteration 448 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:05:37,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:05:37,529 INFO L85 PathProgramCache]: Analyzing trace with hash 1878549629, now seen corresponding path program 1 times [2022-12-06 00:05:37,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:05:37,529 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279323381] [2022-12-06 00:05:37,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:05:37,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:05:37,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:05:37,588 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-06 00:05:37,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:05:37,588 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279323381] [2022-12-06 00:05:37,588 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1279323381] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:05:37,588 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:05:37,588 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:05:37,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256023028] [2022-12-06 00:05:37,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:05:37,589 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:05:37,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:05:37,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:05:37,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:05:37,589 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:05:37,589 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:05:37,589 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:05:37,589 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:05:37,589 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:05:37,872 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:05:37,872 INFO L131 PetriNetUnfolder]: For 26955/27000 co-relation queries the response was YES. [2022-12-06 00:05:37,878 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26955/27000 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13532 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:05:37,885 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:05:37,886 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:05:37,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:05:37,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:05:37,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:05:37,886 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:05:37,886 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:05:37,886 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:05:37,918 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:05:37,920 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:37,920 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:05:37,920 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:05:37,920 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:05:37,920 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:37,920 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:05:37,921 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:05:37,921 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:37,921 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:37,945 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:05:37,945 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 00:05:37,946 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3133/3273 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2972 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:05:37,948 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:37,948 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:05:38,113 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:05:38,114 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 194 [2022-12-06 00:05:38,114 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:05:38,114 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:05:38,114 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:05:38,114 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:05:38,114 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable447 [2022-12-06 00:05:38,114 INFO L420 AbstractCegarLoop]: === Iteration 449 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:05:38,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:05:38,114 INFO L85 PathProgramCache]: Analyzing trace with hash -673607332, now seen corresponding path program 1 times [2022-12-06 00:05:38,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:05:38,115 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677740195] [2022-12-06 00:05:38,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:05:38,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:05:38,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:05:38,179 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-06 00:05:38,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:05:38,179 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677740195] [2022-12-06 00:05:38,179 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [677740195] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:05:38,179 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:05:38,179 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:05:38,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626185811] [2022-12-06 00:05:38,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:05:38,179 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:05:38,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:05:38,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:05:38,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:05:38,180 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:05:38,180 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:05:38,180 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:05:38,180 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:05:38,180 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:05:38,473 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:05:38,473 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:05:38,479 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13543 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:05:38,487 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:05:38,488 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:05:38,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:05:38,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:05:38,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:05:38,488 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:05:38,488 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:05:38,488 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:05:38,525 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:05:38,526 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:38,526 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:05:38,527 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:05:38,527 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:05:38,527 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:38,527 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:05:38,527 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:05:38,527 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:38,528 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:38,552 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:05:38,553 INFO L131 PetriNetUnfolder]: For 3348/3558 co-relation queries the response was YES. [2022-12-06 00:05:38,554 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3348/3558 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2976 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:05:38,556 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:38,556 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:05:38,707 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:05:38,708 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 181 [2022-12-06 00:05:38,708 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:05:38,708 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:05:38,708 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:05:38,708 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:05:38,708 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable448 [2022-12-06 00:05:38,708 INFO L420 AbstractCegarLoop]: === Iteration 450 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:05:38,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:05:38,708 INFO L85 PathProgramCache]: Analyzing trace with hash 1069203003, now seen corresponding path program 1 times [2022-12-06 00:05:38,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:05:38,708 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349064442] [2022-12-06 00:05:38,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:05:38,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:05:38,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:05:38,777 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-06 00:05:38,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:05:38,777 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349064442] [2022-12-06 00:05:38,777 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [349064442] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:05:38,777 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:05:38,777 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:05:38,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474237994] [2022-12-06 00:05:38,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:05:38,778 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:05:38,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:05:38,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:05:38,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:05:38,778 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:05:38,778 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:05:38,778 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:05:38,778 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:05:38,778 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:05:39,059 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:05:39,059 INFO L131 PetriNetUnfolder]: For 27150/27195 co-relation queries the response was YES. [2022-12-06 00:05:39,065 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27150/27195 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13532 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:05:39,073 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:05:39,073 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:05:39,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:05:39,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:05:39,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:05:39,074 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:05:39,074 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:05:39,074 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:05:39,110 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:05:39,111 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:39,111 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:05:39,111 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:05:39,111 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:05:39,111 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:39,112 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:05:39,112 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:05:39,112 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:39,112 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:39,136 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:05:39,137 INFO L131 PetriNetUnfolder]: For 3167/3307 co-relation queries the response was YES. [2022-12-06 00:05:39,138 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3167/3307 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 3015 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:05:39,140 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:39,140 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:05:39,295 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:05:39,295 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 184 [2022-12-06 00:05:39,295 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:05:39,296 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:05:39,296 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:05:39,296 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:05:39,296 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable449 [2022-12-06 00:05:39,296 INFO L420 AbstractCegarLoop]: === Iteration 451 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:05:39,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:05:39,296 INFO L85 PathProgramCache]: Analyzing trace with hash -1482953958, now seen corresponding path program 1 times [2022-12-06 00:05:39,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:05:39,296 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301564837] [2022-12-06 00:05:39,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:05:39,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:05:39,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:05:39,363 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-06 00:05:39,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:05:39,363 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301564837] [2022-12-06 00:05:39,363 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [301564837] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:05:39,364 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:05:39,364 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:05:39,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14212983] [2022-12-06 00:05:39,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:05:39,364 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:05:39,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:05:39,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:05:39,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:05:39,364 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:05:39,364 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:05:39,364 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:05:39,364 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:05:39,364 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:05:39,651 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:05:39,651 INFO L131 PetriNetUnfolder]: For 27229/27274 co-relation queries the response was YES. [2022-12-06 00:05:39,656 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27229/27274 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13564 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:05:39,664 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:05:39,664 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:05:39,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:05:39,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:05:39,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:05:39,665 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:05:39,665 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:05:39,665 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:05:39,699 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:05:39,700 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:39,700 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:05:39,700 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:05:39,700 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:05:39,700 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:39,701 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:05:39,701 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:05:39,701 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:39,702 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:39,726 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:05:39,726 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 00:05:39,727 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3321/3530 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2970 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:05:39,729 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:39,729 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:05:39,880 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:05:39,881 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 181 [2022-12-06 00:05:39,881 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:05:39,881 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:05:39,881 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:05:39,881 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:05:39,881 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable450 [2022-12-06 00:05:39,881 INFO L420 AbstractCegarLoop]: === Iteration 452 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:05:39,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:05:39,881 INFO L85 PathProgramCache]: Analyzing trace with hash 259856377, now seen corresponding path program 1 times [2022-12-06 00:05:39,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:05:39,881 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542665849] [2022-12-06 00:05:39,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:05:39,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:05:39,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:05:39,952 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-06 00:05:39,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:05:39,952 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542665849] [2022-12-06 00:05:39,953 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1542665849] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:05:39,953 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:05:39,953 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:05:39,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499400066] [2022-12-06 00:05:39,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:05:39,953 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:05:39,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:05:39,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:05:39,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:05:39,953 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:05:39,953 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:05:39,953 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:05:39,953 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:05:39,953 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:05:40,279 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:05:40,279 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:05:40,283 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13560 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:05:40,289 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:05:40,289 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:05:40,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:05:40,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:05:40,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:05:40,290 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:05:40,290 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:05:40,290 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:05:40,318 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:05:40,319 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:40,319 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:05:40,320 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:05:40,320 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:05:40,320 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:40,320 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:05:40,320 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:05:40,320 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:40,321 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:40,345 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:05:40,345 INFO L131 PetriNetUnfolder]: For 3310/3519 co-relation queries the response was YES. [2022-12-06 00:05:40,346 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3310/3519 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2981 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:05:40,347 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:40,348 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:05:40,493 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:05:40,493 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 173 [2022-12-06 00:05:40,493 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:05:40,493 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:05:40,493 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:05:40,493 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:05:40,493 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable451 [2022-12-06 00:05:40,493 INFO L420 AbstractCegarLoop]: === Iteration 453 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:05:40,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:05:40,494 INFO L85 PathProgramCache]: Analyzing trace with hash 2002666712, now seen corresponding path program 1 times [2022-12-06 00:05:40,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:05:40,494 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263461316] [2022-12-06 00:05:40,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:05:40,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:05:40,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:05:40,558 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-06 00:05:40,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:05:40,558 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263461316] [2022-12-06 00:05:40,558 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1263461316] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:05:40,558 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:05:40,558 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:05:40,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059361612] [2022-12-06 00:05:40,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:05:40,559 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:05:40,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:05:40,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:05:40,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:05:40,559 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:05:40,559 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:05:40,559 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:05:40,559 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:05:40,559 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:05:40,856 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:05:40,856 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:05:40,861 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13574 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:05:40,869 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:05:40,869 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:05:40,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:05:40,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:05:40,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:05:40,869 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:05:40,870 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:05:40,870 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:05:40,907 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:05:40,909 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:40,909 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:05:40,909 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:05:40,909 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:05:40,909 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:40,910 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:05:40,910 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:05:40,910 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:40,911 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:40,945 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:05:40,945 INFO L131 PetriNetUnfolder]: For 3338/3547 co-relation queries the response was YES. [2022-12-06 00:05:40,946 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3338/3547 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2985 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:05:40,949 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:40,949 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:05:41,097 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:05:41,097 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 188 [2022-12-06 00:05:41,098 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:05:41,098 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:05:41,098 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:05:41,098 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:05:41,098 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable452 [2022-12-06 00:05:41,098 INFO L420 AbstractCegarLoop]: === Iteration 454 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:05:41,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:05:41,098 INFO L85 PathProgramCache]: Analyzing trace with hash -549490249, now seen corresponding path program 1 times [2022-12-06 00:05:41,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:05:41,098 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478107986] [2022-12-06 00:05:41,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:05:41,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:05:41,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:05:41,157 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-06 00:05:41,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:05:41,157 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478107986] [2022-12-06 00:05:41,157 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1478107986] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:05:41,157 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:05:41,157 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:05:41,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024834774] [2022-12-06 00:05:41,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:05:41,158 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:05:41,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:05:41,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:05:41,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:05:41,158 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:05:41,158 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:05:41,158 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:05:41,158 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:05:41,158 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:05:41,420 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:05:41,420 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:05:41,428 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13573 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:05:41,436 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:05:41,436 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:05:41,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:05:41,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:05:41,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:05:41,437 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:05:41,437 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:05:41,437 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:05:41,474 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:05:41,475 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:41,476 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:05:41,476 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:05:41,476 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:05:41,476 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:41,476 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:05:41,476 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:05:41,476 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:41,477 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:41,502 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:05:41,502 INFO L131 PetriNetUnfolder]: For 3293/3500 co-relation queries the response was YES. [2022-12-06 00:05:41,503 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3293/3500 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2994 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:05:41,505 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:41,505 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:05:41,654 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:05:41,654 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 178 [2022-12-06 00:05:41,654 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:05:41,654 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:05:41,655 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:05:41,655 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:05:41,655 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable453 [2022-12-06 00:05:41,655 INFO L420 AbstractCegarLoop]: === Iteration 455 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:05:41,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:05:41,655 INFO L85 PathProgramCache]: Analyzing trace with hash 1193320086, now seen corresponding path program 1 times [2022-12-06 00:05:41,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:05:41,655 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769682754] [2022-12-06 00:05:41,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:05:41,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:05:41,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:05:41,712 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-06 00:05:41,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:05:41,713 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769682754] [2022-12-06 00:05:41,713 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [769682754] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:05:41,713 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:05:41,713 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:05:41,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741796362] [2022-12-06 00:05:41,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:05:41,713 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:05:41,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:05:41,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:05:41,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:05:41,714 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:05:41,714 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:05:41,714 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:05:41,714 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:05:41,714 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:05:41,987 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:05:41,988 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 00:05:41,993 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13561 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:05:41,999 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:05:41,999 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:05:42,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:05:42,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:05:42,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:05:42,000 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:05:42,000 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:05:42,000 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:05:42,033 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:05:42,034 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:42,034 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:05:42,034 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:05:42,035 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:05:42,035 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:42,035 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:05:42,035 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:05:42,035 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:42,036 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:42,060 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:05:42,060 INFO L131 PetriNetUnfolder]: For 3310/3519 co-relation queries the response was YES. [2022-12-06 00:05:42,061 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3310/3519 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2957 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:05:42,063 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:42,063 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:05:42,200 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:05:42,201 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 166 [2022-12-06 00:05:42,201 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:05:42,201 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:05:42,201 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:05:42,201 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:05:42,201 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable454 [2022-12-06 00:05:42,201 INFO L420 AbstractCegarLoop]: === Iteration 456 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:05:42,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:05:42,202 INFO L85 PathProgramCache]: Analyzing trace with hash -1358836875, now seen corresponding path program 1 times [2022-12-06 00:05:42,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:05:42,202 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528520525] [2022-12-06 00:05:42,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:05:42,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:05:42,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:05:42,259 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-06 00:05:42,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:05:42,260 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528520525] [2022-12-06 00:05:42,260 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [528520525] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:05:42,260 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:05:42,260 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:05:42,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497072572] [2022-12-06 00:05:42,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:05:42,260 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:05:42,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:05:42,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:05:42,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:05:42,261 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:05:42,261 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:05:42,261 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:05:42,261 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:05:42,261 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:05:42,536 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:05:42,536 INFO L131 PetriNetUnfolder]: For 27136/27181 co-relation queries the response was YES. [2022-12-06 00:05:42,541 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27136/27181 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13509 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:05:42,548 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:05:42,549 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:05:42,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:05:42,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:05:42,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:05:42,549 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:05:42,549 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:05:42,549 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:05:42,586 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:05:42,588 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:42,588 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:05:42,588 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:05:42,588 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:05:42,588 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:42,589 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:05:42,589 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:05:42,589 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:42,590 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:42,620 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:05:42,620 INFO L131 PetriNetUnfolder]: For 3156/3296 co-relation queries the response was YES. [2022-12-06 00:05:42,621 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3156/3296 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 3006 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:05:42,624 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:42,624 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:05:42,793 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:05:42,793 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 205 [2022-12-06 00:05:42,793 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:05:42,793 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:05:42,793 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:05:42,793 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:05:42,793 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable455 [2022-12-06 00:05:42,793 INFO L420 AbstractCegarLoop]: === Iteration 457 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:05:42,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:05:42,794 INFO L85 PathProgramCache]: Analyzing trace with hash 383973460, now seen corresponding path program 1 times [2022-12-06 00:05:42,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:05:42,794 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891338108] [2022-12-06 00:05:42,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:05:42,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:05:42,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:05:42,875 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-06 00:05:42,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:05:42,875 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891338108] [2022-12-06 00:05:42,875 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [891338108] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:05:42,875 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:05:42,875 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:05:42,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123023330] [2022-12-06 00:05:42,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:05:42,876 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:05:42,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:05:42,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:05:42,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:05:42,876 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:05:42,876 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:05:42,876 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:05:42,876 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:05:42,876 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:05:43,224 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:05:43,225 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 00:05:43,232 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13568 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:05:43,241 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:05:43,242 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:05:43,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:05:43,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:05:43,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:05:43,242 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:05:43,243 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:05:43,243 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:05:43,290 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:05:43,292 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:43,292 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:05:43,292 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:05:43,292 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:05:43,292 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:43,293 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:05:43,293 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:05:43,293 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:43,294 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:43,343 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:05:43,343 INFO L131 PetriNetUnfolder]: For 3338/3547 co-relation queries the response was YES. [2022-12-06 00:05:43,345 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3338/3547 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2985 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:05:43,348 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:43,348 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:05:43,556 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:05:43,557 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 265 [2022-12-06 00:05:43,557 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:05:43,557 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:05:43,557 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:05:43,557 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:05:43,557 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable456 [2022-12-06 00:05:43,557 INFO L420 AbstractCegarLoop]: === Iteration 458 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:05:43,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:05:43,558 INFO L85 PathProgramCache]: Analyzing trace with hash 2126783795, now seen corresponding path program 1 times [2022-12-06 00:05:43,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:05:43,558 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738254324] [2022-12-06 00:05:43,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:05:43,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:05:43,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:05:43,643 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-06 00:05:43,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:05:43,644 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738254324] [2022-12-06 00:05:43,644 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1738254324] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:05:43,644 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:05:43,644 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:05:43,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733457214] [2022-12-06 00:05:43,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:05:43,644 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:05:43,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:05:43,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:05:43,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:05:43,645 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:05:43,645 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:05:43,645 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:05:43,645 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:05:43,645 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:05:44,005 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:05:44,006 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:05:44,013 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13569 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:05:44,022 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:05:44,022 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:05:44,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:05:44,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:05:44,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:05:44,023 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:05:44,023 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:05:44,023 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:05:44,072 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:05:44,074 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:44,074 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:05:44,074 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:05:44,075 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:05:44,075 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:44,075 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:05:44,075 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:05:44,076 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:44,076 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:44,113 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:05:44,113 INFO L131 PetriNetUnfolder]: For 3304/3511 co-relation queries the response was YES. [2022-12-06 00:05:44,114 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3304/3511 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 3006 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:05:44,117 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:44,117 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:05:44,309 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:05:44,309 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 234 [2022-12-06 00:05:44,309 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:05:44,309 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:05:44,309 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:05:44,309 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:05:44,309 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable457 [2022-12-06 00:05:44,310 INFO L420 AbstractCegarLoop]: === Iteration 459 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:05:44,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:05:44,310 INFO L85 PathProgramCache]: Analyzing trace with hash -425373166, now seen corresponding path program 1 times [2022-12-06 00:05:44,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:05:44,310 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942921893] [2022-12-06 00:05:44,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:05:44,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:05:44,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:05:44,434 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-06 00:05:44,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:05:44,435 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942921893] [2022-12-06 00:05:44,435 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [942921893] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:05:44,435 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:05:44,435 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:05:44,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82982216] [2022-12-06 00:05:44,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:05:44,435 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:05:44,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:05:44,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:05:44,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:05:44,436 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:05:44,436 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:05:44,436 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:05:44,436 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:05:44,436 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:05:44,791 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:05:44,791 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:05:44,798 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13542 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:05:44,807 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:05:44,807 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:05:44,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:05:44,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:05:44,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:05:44,808 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:05:44,808 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:05:44,808 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:05:44,852 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:05:44,853 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:44,853 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:05:44,854 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:05:44,854 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:05:44,854 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:44,854 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:05:44,854 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:05:44,854 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:44,855 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:44,885 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:05:44,886 INFO L131 PetriNetUnfolder]: For 3310/3519 co-relation queries the response was YES. [2022-12-06 00:05:44,887 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3310/3519 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2974 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:05:44,889 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:44,889 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:05:45,058 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:05:45,058 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 204 [2022-12-06 00:05:45,058 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:05:45,058 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:05:45,058 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:05:45,059 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:05:45,059 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable458 [2022-12-06 00:05:45,059 INFO L420 AbstractCegarLoop]: === Iteration 460 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:05:45,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:05:45,059 INFO L85 PathProgramCache]: Analyzing trace with hash 1317437169, now seen corresponding path program 1 times [2022-12-06 00:05:45,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:05:45,059 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483257770] [2022-12-06 00:05:45,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:05:45,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:05:45,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:05:45,136 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-06 00:05:45,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:05:45,136 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483257770] [2022-12-06 00:05:45,136 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1483257770] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:05:45,136 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:05:45,136 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:05:45,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984005099] [2022-12-06 00:05:45,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:05:45,137 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:05:45,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:05:45,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:05:45,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:05:45,137 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:05:45,137 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:05:45,137 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:05:45,137 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:05:45,137 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:05:45,509 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:05:45,509 INFO L131 PetriNetUnfolder]: For 26955/27000 co-relation queries the response was YES. [2022-12-06 00:05:45,516 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26955/27000 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13511 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:05:45,524 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:05:45,524 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:05:45,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:05:45,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:05:45,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:05:45,525 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:05:45,525 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:05:45,525 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:05:45,565 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:05:45,567 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:45,567 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:05:45,567 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:05:45,567 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:05:45,567 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:45,568 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:05:45,568 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:05:45,568 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:45,569 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:45,599 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:05:45,599 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 00:05:45,600 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3133/3273 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2985 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:05:45,603 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:45,603 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:05:45,778 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:05:45,779 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 212 [2022-12-06 00:05:45,779 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:05:45,779 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:05:45,779 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:05:45,779 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:05:45,779 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable459 [2022-12-06 00:05:45,779 INFO L420 AbstractCegarLoop]: === Iteration 461 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:05:45,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:05:45,779 INFO L85 PathProgramCache]: Analyzing trace with hash -1234719792, now seen corresponding path program 1 times [2022-12-06 00:05:45,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:05:45,780 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471152644] [2022-12-06 00:05:45,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:05:45,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:05:45,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:05:45,849 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-06 00:05:45,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:05:45,849 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471152644] [2022-12-06 00:05:45,849 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1471152644] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:05:45,849 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:05:45,849 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:05:45,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808885911] [2022-12-06 00:05:45,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:05:45,850 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:05:45,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:05:45,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:05:45,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:05:45,850 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:05:45,850 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:05:45,850 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:05:45,850 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:05:45,850 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:05:46,196 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:05:46,196 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 00:05:46,203 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26969/27014 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13532 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:05:46,212 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:05:46,212 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:05:46,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:05:46,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:05:46,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:05:46,213 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:05:46,213 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:05:46,213 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:05:46,261 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:05:46,262 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:46,262 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:05:46,263 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:05:46,263 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:05:46,263 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:46,263 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:05:46,263 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:05:46,264 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:46,264 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:46,295 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:05:46,295 INFO L131 PetriNetUnfolder]: For 3146/3287 co-relation queries the response was YES. [2022-12-06 00:05:46,296 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3146/3287 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2974 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:05:46,299 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:46,299 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:05:46,488 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:05:46,489 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 226 [2022-12-06 00:05:46,489 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:05:46,489 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:05:46,489 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:05:46,489 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:05:46,489 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable460 [2022-12-06 00:05:46,489 INFO L420 AbstractCegarLoop]: === Iteration 462 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:05:46,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:05:46,490 INFO L85 PathProgramCache]: Analyzing trace with hash 508090543, now seen corresponding path program 1 times [2022-12-06 00:05:46,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:05:46,490 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500511237] [2022-12-06 00:05:46,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:05:46,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:05:46,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:05:46,575 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-06 00:05:46,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:05:46,575 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500511237] [2022-12-06 00:05:46,576 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1500511237] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:05:46,576 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:05:46,576 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:05:46,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424320234] [2022-12-06 00:05:46,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:05:46,576 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:05:46,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:05:46,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:05:46,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:05:46,576 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:05:46,577 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:05:46,577 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:05:46,577 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:05:46,577 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:05:46,933 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:05:46,934 INFO L131 PetriNetUnfolder]: For 27150/27195 co-relation queries the response was YES. [2022-12-06 00:05:46,941 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27150/27195 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13542 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:05:46,951 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:05:46,951 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:05:46,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:05:46,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:05:46,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:05:46,952 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:05:46,952 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:05:46,952 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:05:46,997 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:05:46,999 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:46,999 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:05:46,999 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:05:46,999 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:05:46,999 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:47,000 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:05:47,000 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:05:47,000 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:47,001 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:47,034 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:05:47,034 INFO L131 PetriNetUnfolder]: For 3157/3298 co-relation queries the response was YES. [2022-12-06 00:05:47,035 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3157/3298 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2986 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:05:47,038 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:47,038 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:05:47,228 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:05:47,229 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 230 [2022-12-06 00:05:47,229 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:05:47,229 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:05:47,229 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:05:47,229 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:05:47,229 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable461 [2022-12-06 00:05:47,229 INFO L420 AbstractCegarLoop]: === Iteration 463 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:05:47,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:05:47,230 INFO L85 PathProgramCache]: Analyzing trace with hash -2044066418, now seen corresponding path program 1 times [2022-12-06 00:05:47,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:05:47,230 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863767194] [2022-12-06 00:05:47,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:05:47,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:05:47,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:05:47,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-06 00:05:47,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:05:47,359 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863767194] [2022-12-06 00:05:47,359 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1863767194] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:05:47,359 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:05:47,359 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:05:47,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963783985] [2022-12-06 00:05:47,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:05:47,359 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:05:47,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:05:47,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:05:47,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:05:47,360 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:05:47,360 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:05:47,360 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:05:47,360 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:05:47,360 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:05:47,713 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:05:47,713 INFO L131 PetriNetUnfolder]: For 27136/27181 co-relation queries the response was YES. [2022-12-06 00:05:47,720 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27136/27181 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13517 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:05:47,730 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:05:47,731 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:05:47,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:05:47,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:05:47,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:05:47,732 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:05:47,732 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:05:47,732 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:05:47,779 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:05:47,780 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:47,780 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:05:47,781 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:05:47,781 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:05:47,781 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:47,781 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:05:47,781 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:05:47,782 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:47,782 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:47,816 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:05:47,816 INFO L131 PetriNetUnfolder]: For 3168/3309 co-relation queries the response was YES. [2022-12-06 00:05:47,817 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3168/3309 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2994 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:05:47,820 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:47,820 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:05:48,004 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:05:48,004 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 223 [2022-12-06 00:05:48,004 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:05:48,004 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:05:48,004 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:05:48,005 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:05:48,005 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable462 [2022-12-06 00:05:48,005 INFO L420 AbstractCegarLoop]: === Iteration 464 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:05:48,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:05:48,005 INFO L85 PathProgramCache]: Analyzing trace with hash -301256083, now seen corresponding path program 1 times [2022-12-06 00:05:48,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:05:48,005 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219012441] [2022-12-06 00:05:48,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:05:48,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:05:48,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:05:48,088 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-06 00:05:48,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:05:48,089 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219012441] [2022-12-06 00:05:48,089 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [219012441] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:05:48,089 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:05:48,089 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:05:48,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852890979] [2022-12-06 00:05:48,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:05:48,089 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:05:48,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:05:48,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:05:48,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:05:48,090 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:05:48,090 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:05:48,090 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:05:48,090 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:05:48,090 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:05:48,452 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:05:48,453 INFO L131 PetriNetUnfolder]: For 27229/27274 co-relation queries the response was YES. [2022-12-06 00:05:48,461 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27229/27274 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13551 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:05:48,472 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:05:48,472 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:05:48,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:05:48,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:05:48,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:05:48,473 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:05:48,473 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:05:48,473 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:05:48,523 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:05:48,525 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:48,525 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:05:48,525 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:05:48,525 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:05:48,525 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:48,526 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:05:48,526 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:05:48,526 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:48,527 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:48,561 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:05:48,561 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 00:05:48,562 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3312/3520 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2980 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:05:48,565 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:48,565 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:05:48,741 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:05:48,741 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 216 [2022-12-06 00:05:48,741 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:05:48,741 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:05:48,742 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:05:48,742 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:05:48,742 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable463 [2022-12-06 00:05:48,742 INFO L420 AbstractCegarLoop]: === Iteration 465 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:05:48,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:05:48,742 INFO L85 PathProgramCache]: Analyzing trace with hash 1441554252, now seen corresponding path program 1 times [2022-12-06 00:05:48,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:05:48,742 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759288191] [2022-12-06 00:05:48,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:05:48,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:05:48,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:05:48,831 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-06 00:05:48,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:05:48,831 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759288191] [2022-12-06 00:05:48,831 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1759288191] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:05:48,831 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:05:48,832 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:05:48,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390561394] [2022-12-06 00:05:48,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:05:48,832 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:05:48,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:05:48,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:05:48,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:05:48,832 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:05:48,833 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:05:48,833 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:05:48,833 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:05:48,833 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:05:49,264 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:05:49,265 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 00:05:49,271 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26965/27010 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13524 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:05:49,278 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:05:49,279 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:05:49,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:05:49,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:05:49,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:05:49,279 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:05:49,280 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:05:49,280 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:05:49,320 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:05:49,321 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:49,322 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:05:49,322 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:05:49,322 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:05:49,322 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:49,322 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:05:49,323 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:05:49,323 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:49,323 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:49,355 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:05:49,356 INFO L131 PetriNetUnfolder]: For 3135/3276 co-relation queries the response was YES. [2022-12-06 00:05:49,357 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3135/3276 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2957 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:05:49,360 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:49,360 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:05:49,547 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:05:49,547 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 225 [2022-12-06 00:05:49,547 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:05:49,547 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:05:49,547 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:05:49,548 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:05:49,548 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable464 [2022-12-06 00:05:49,548 INFO L420 AbstractCegarLoop]: === Iteration 466 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:05:49,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:05:49,548 INFO L85 PathProgramCache]: Analyzing trace with hash -1110602709, now seen corresponding path program 1 times [2022-12-06 00:05:49,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:05:49,548 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342612003] [2022-12-06 00:05:49,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:05:49,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:05:49,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:05:49,618 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-06 00:05:49,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:05:49,618 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342612003] [2022-12-06 00:05:49,618 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1342612003] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:05:49,619 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:05:49,619 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:05:49,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162542650] [2022-12-06 00:05:49,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:05:49,619 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:05:49,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:05:49,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:05:49,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:05:49,619 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:05:49,619 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:05:49,620 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:05:49,620 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:05:49,620 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:05:49,978 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:05:49,978 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 00:05:49,986 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13552 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:05:49,997 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:05:49,997 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:05:49,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:05:49,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:05:49,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:05:49,998 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:05:49,998 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:05:49,998 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:05:50,048 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:05:50,049 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:50,049 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:05:50,050 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:05:50,050 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:05:50,050 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:50,050 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:05:50,050 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:05:50,051 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:50,051 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:50,084 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:05:50,084 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 00:05:50,086 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3312/3520 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2974 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:05:50,089 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:50,089 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:05:50,272 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:05:50,273 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 223 [2022-12-06 00:05:50,273 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:05:50,273 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:05:50,273 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:05:50,273 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:05:50,273 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable465 [2022-12-06 00:05:50,273 INFO L420 AbstractCegarLoop]: === Iteration 467 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:05:50,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:05:50,274 INFO L85 PathProgramCache]: Analyzing trace with hash 632207626, now seen corresponding path program 1 times [2022-12-06 00:05:50,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:05:50,274 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389685472] [2022-12-06 00:05:50,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:05:50,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:05:50,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:05:50,350 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-06 00:05:50,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:05:50,351 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389685472] [2022-12-06 00:05:50,351 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [389685472] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:05:50,351 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:05:50,351 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:05:50,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323513223] [2022-12-06 00:05:50,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:05:50,351 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:05:50,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:05:50,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:05:50,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:05:50,352 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:05:50,352 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:05:50,352 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:05:50,352 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:05:50,352 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:05:50,729 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:05:50,729 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:05:50,736 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13533 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:05:50,759 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:05:50,759 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:05:50,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:05:50,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:05:50,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:05:50,760 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:05:50,760 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:05:50,760 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:05:50,820 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:05:50,822 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:50,822 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:05:50,822 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:05:50,822 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:05:50,822 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:50,823 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:05:50,823 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:05:50,823 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:50,824 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:50,858 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:05:50,858 INFO L131 PetriNetUnfolder]: For 3301/3509 co-relation queries the response was YES. [2022-12-06 00:05:50,860 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3301/3509 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2998 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:05:50,863 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:50,863 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:05:51,058 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:05:51,058 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 236 [2022-12-06 00:05:51,058 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:05:51,058 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:05:51,059 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:05:51,059 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:05:51,059 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable466 [2022-12-06 00:05:51,059 INFO L420 AbstractCegarLoop]: === Iteration 468 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:05:51,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:05:51,059 INFO L85 PathProgramCache]: Analyzing trace with hash -1919949335, now seen corresponding path program 1 times [2022-12-06 00:05:51,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:05:51,059 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321148794] [2022-12-06 00:05:51,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:05:51,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:05:51,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:05:51,147 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-06 00:05:51,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:05:51,147 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321148794] [2022-12-06 00:05:51,147 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1321148794] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:05:51,147 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:05:51,147 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:05:51,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049922126] [2022-12-06 00:05:51,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:05:51,148 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:05:51,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:05:51,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:05:51,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:05:51,148 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:05:51,148 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:05:51,148 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:05:51,148 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:05:51,148 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:05:51,526 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:05:51,526 INFO L131 PetriNetUnfolder]: For 26955/27000 co-relation queries the response was YES. [2022-12-06 00:05:51,534 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26955/27000 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13537 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:05:51,543 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:05:51,544 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:05:51,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:05:51,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:05:51,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:05:51,545 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:05:51,545 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:05:51,545 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:05:51,592 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:05:51,593 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:51,593 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:05:51,593 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:05:51,593 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:05:51,594 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:51,594 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:05:51,594 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:05:51,594 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:51,595 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:51,627 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:05:51,627 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 00:05:51,628 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3133/3273 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2980 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:05:51,631 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:51,631 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:05:51,804 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:05:51,805 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 212 [2022-12-06 00:05:51,805 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:05:51,805 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:05:51,805 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:05:51,805 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:05:51,805 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable467 [2022-12-06 00:05:51,805 INFO L420 AbstractCegarLoop]: === Iteration 469 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:05:51,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:05:51,805 INFO L85 PathProgramCache]: Analyzing trace with hash -177139000, now seen corresponding path program 1 times [2022-12-06 00:05:51,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:05:51,806 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392745639] [2022-12-06 00:05:51,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:05:51,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:05:51,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:05:51,895 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-06 00:05:51,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:05:51,895 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392745639] [2022-12-06 00:05:51,895 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [392745639] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:05:51,895 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:05:51,895 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:05:51,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786066365] [2022-12-06 00:05:51,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:05:51,896 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:05:51,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:05:51,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:05:51,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:05:51,896 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:05:51,896 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:05:51,896 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:05:51,896 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:05:51,896 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:05:52,282 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:05:52,282 INFO L131 PetriNetUnfolder]: For 27150/27195 co-relation queries the response was YES. [2022-12-06 00:05:52,292 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27150/27195 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13535 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:05:52,304 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:05:52,305 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:05:52,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:05:52,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:05:52,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:05:52,306 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:05:52,306 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:05:52,306 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:05:52,351 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:05:52,353 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:52,353 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:05:52,353 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:05:52,353 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:05:52,353 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:52,354 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:05:52,354 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:05:52,354 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:52,355 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:52,392 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:05:52,392 INFO L131 PetriNetUnfolder]: For 3185/3328 co-relation queries the response was YES. [2022-12-06 00:05:52,393 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3185/3328 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2988 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:05:52,396 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:52,396 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:05:52,605 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:05:52,605 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 252 [2022-12-06 00:05:52,605 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:05:52,605 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:05:52,605 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:05:52,605 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:05:52,606 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable468 [2022-12-06 00:05:52,606 INFO L420 AbstractCegarLoop]: === Iteration 470 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:05:52,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:05:52,606 INFO L85 PathProgramCache]: Analyzing trace with hash 1565671335, now seen corresponding path program 1 times [2022-12-06 00:05:52,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:05:52,606 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183751216] [2022-12-06 00:05:52,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:05:52,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:05:52,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:05:52,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-06 00:05:52,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:05:52,695 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183751216] [2022-12-06 00:05:52,695 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1183751216] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:05:52,695 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:05:52,696 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:05:52,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196853943] [2022-12-06 00:05:52,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:05:52,696 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:05:52,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:05:52,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:05:52,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:05:52,696 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:05:52,697 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:05:52,697 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:05:52,697 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:05:52,697 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:05:53,071 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:05:53,071 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:05:53,080 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13565 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:05:53,090 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:05:53,090 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:05:53,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:05:53,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:05:53,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:05:53,091 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:05:53,091 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:05:53,091 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:05:53,142 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:05:53,143 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:53,144 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:05:53,144 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:05:53,144 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:05:53,144 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:53,144 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:05:53,144 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:05:53,145 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:53,145 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:53,184 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:05:53,184 INFO L131 PetriNetUnfolder]: For 3309/3518 co-relation queries the response was YES. [2022-12-06 00:05:53,185 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3309/3518 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2987 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:05:53,188 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:53,188 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:05:53,378 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:05:53,379 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 235 [2022-12-06 00:05:53,379 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:05:53,379 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:05:53,379 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:05:53,379 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:05:53,380 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable469 [2022-12-06 00:05:53,380 INFO L420 AbstractCegarLoop]: === Iteration 471 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:05:53,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:05:53,380 INFO L85 PathProgramCache]: Analyzing trace with hash -986485626, now seen corresponding path program 1 times [2022-12-06 00:05:53,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:05:53,380 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819530864] [2022-12-06 00:05:53,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:05:53,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:05:53,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:05:53,453 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-06 00:05:53,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:05:53,454 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819530864] [2022-12-06 00:05:53,454 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [819530864] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:05:53,454 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:05:53,454 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:05:53,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063219751] [2022-12-06 00:05:53,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:05:53,454 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:05:53,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:05:53,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:05:53,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:05:53,455 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:05:53,455 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:05:53,455 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:05:53,455 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:05:53,455 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:05:53,811 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:05:53,812 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 00:05:53,820 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26969/27014 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13532 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:05:53,830 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:05:53,830 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:05:53,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:05:53,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:05:53,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:05:53,831 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:05:53,831 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:05:53,831 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:05:53,881 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:05:53,883 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:53,883 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:05:53,883 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:05:53,883 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:05:53,883 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:53,884 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:05:53,884 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:05:53,884 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:53,884 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:53,916 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:05:53,916 INFO L131 PetriNetUnfolder]: For 3122/3262 co-relation queries the response was YES. [2022-12-06 00:05:53,918 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3122/3262 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2960 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:05:53,921 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:53,921 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:05:54,106 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:05:54,106 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 223 [2022-12-06 00:05:54,107 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:05:54,107 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:05:54,107 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:05:54,107 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:05:54,107 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable470 [2022-12-06 00:05:54,107 INFO L420 AbstractCegarLoop]: === Iteration 472 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:05:54,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:05:54,107 INFO L85 PathProgramCache]: Analyzing trace with hash 756324709, now seen corresponding path program 1 times [2022-12-06 00:05:54,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:05:54,107 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834364737] [2022-12-06 00:05:54,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:05:54,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:05:54,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:05:54,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-06 00:05:54,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:05:54,190 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834364737] [2022-12-06 00:05:54,190 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1834364737] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:05:54,190 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:05:54,190 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:05:54,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204902266] [2022-12-06 00:05:54,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:05:54,190 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:05:54,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:05:54,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:05:54,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:05:54,191 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:05:54,191 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:05:54,191 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:05:54,191 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:05:54,191 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:05:54,552 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:05:54,553 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 00:05:54,560 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26969/27014 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13551 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:05:54,570 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:05:54,570 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:05:54,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:05:54,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:05:54,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:05:54,571 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:05:54,571 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:05:54,571 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:05:54,621 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:05:54,622 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:54,622 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:05:54,622 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:05:54,623 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:05:54,623 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:54,623 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:05:54,623 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:05:54,623 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:54,624 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:54,656 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:05:54,656 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 00:05:54,658 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3133/3273 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2975 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:05:54,661 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:54,661 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:05:54,857 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:05:54,857 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 235 [2022-12-06 00:05:54,857 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:05:54,858 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:05:54,858 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:05:54,858 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:05:54,858 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable471 [2022-12-06 00:05:54,858 INFO L420 AbstractCegarLoop]: === Iteration 473 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:05:54,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:05:54,858 INFO L85 PathProgramCache]: Analyzing trace with hash -1795832252, now seen corresponding path program 1 times [2022-12-06 00:05:54,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:05:54,858 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044688] [2022-12-06 00:05:54,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:05:54,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:05:54,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:05:54,940 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-06 00:05:54,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:05:54,940 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044688] [2022-12-06 00:05:54,941 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1044688] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:05:54,941 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:05:54,941 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:05:54,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605581139] [2022-12-06 00:05:54,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:05:54,941 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:05:54,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:05:54,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:05:54,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:05:54,942 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:05:54,942 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:05:54,942 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:05:54,942 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:05:54,942 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:05:55,375 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:05:55,375 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:05:55,383 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13549 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:05:55,392 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:05:55,392 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:05:55,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:05:55,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:05:55,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:05:55,395 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:05:55,395 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:05:55,395 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:05:55,436 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:05:55,438 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:55,438 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:05:55,438 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:05:55,438 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:05:55,438 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:55,439 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:05:55,439 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:05:55,439 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:55,440 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:55,472 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:05:55,472 INFO L131 PetriNetUnfolder]: For 3338/3547 co-relation queries the response was YES. [2022-12-06 00:05:55,473 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3338/3547 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 3002 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:05:55,476 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:55,476 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:05:55,676 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:05:55,676 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 238 [2022-12-06 00:05:55,676 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:05:55,676 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:05:55,676 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:05:55,677 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:05:55,677 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable472 [2022-12-06 00:05:55,677 INFO L420 AbstractCegarLoop]: === Iteration 474 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:05:55,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:05:55,677 INFO L85 PathProgramCache]: Analyzing trace with hash -53021917, now seen corresponding path program 1 times [2022-12-06 00:05:55,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:05:55,677 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228420232] [2022-12-06 00:05:55,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:05:55,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:05:55,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:05:55,748 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-06 00:05:55,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:05:55,748 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228420232] [2022-12-06 00:05:55,748 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1228420232] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:05:55,748 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:05:55,748 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:05:55,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962187839] [2022-12-06 00:05:55,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:05:55,749 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:05:55,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:05:55,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:05:55,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:05:55,749 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:05:55,749 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:05:55,749 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:05:55,749 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:05:55,749 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:05:56,135 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:05:56,135 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:05:56,144 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13568 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:05:56,154 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:05:56,154 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:05:56,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:05:56,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:05:56,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:05:56,155 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:05:56,155 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:05:56,155 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:05:56,204 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:05:56,205 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:56,205 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:05:56,206 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:05:56,206 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:05:56,206 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:56,206 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:05:56,206 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:05:56,206 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:56,209 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:56,242 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:05:56,243 INFO L131 PetriNetUnfolder]: For 3298/3507 co-relation queries the response was YES. [2022-12-06 00:05:56,244 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3298/3507 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2986 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:05:56,247 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:56,247 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:05:56,416 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:05:56,417 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 211 [2022-12-06 00:05:56,417 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:05:56,417 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:05:56,417 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:05:56,417 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:05:56,417 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable473 [2022-12-06 00:05:56,417 INFO L420 AbstractCegarLoop]: === Iteration 475 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:05:56,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:05:56,418 INFO L85 PathProgramCache]: Analyzing trace with hash 1689788418, now seen corresponding path program 1 times [2022-12-06 00:05:56,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:05:56,418 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808180052] [2022-12-06 00:05:56,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:05:56,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:05:56,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:05:56,529 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-06 00:05:56,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:05:56,530 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808180052] [2022-12-06 00:05:56,530 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1808180052] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:05:56,530 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:05:56,530 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:05:56,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731713546] [2022-12-06 00:05:56,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:05:56,530 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:05:56,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:05:56,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:05:56,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:05:56,530 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:05:56,530 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:05:56,531 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:05:56,531 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:05:56,531 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:05:56,879 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:05:56,879 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 00:05:56,887 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13568 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:05:56,898 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:05:56,898 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:05:56,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:05:56,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:05:56,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:05:56,899 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:05:56,899 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:05:56,899 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:05:56,944 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:05:56,946 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:56,946 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:05:56,946 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:05:56,946 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:05:56,946 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:56,947 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:05:56,947 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:05:56,947 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:56,948 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:56,978 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:05:56,979 INFO L131 PetriNetUnfolder]: For 3318/3528 co-relation queries the response was YES. [2022-12-06 00:05:56,980 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3318/3528 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2982 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:05:56,983 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:56,983 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:05:57,145 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:05:57,145 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 199 [2022-12-06 00:05:57,145 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:05:57,146 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:05:57,146 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:05:57,146 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:05:57,146 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable474 [2022-12-06 00:05:57,146 INFO L420 AbstractCegarLoop]: === Iteration 476 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:05:57,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:05:57,146 INFO L85 PathProgramCache]: Analyzing trace with hash -862368543, now seen corresponding path program 1 times [2022-12-06 00:05:57,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:05:57,146 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862428757] [2022-12-06 00:05:57,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:05:57,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:05:57,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:05:57,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-06 00:05:57,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:05:57,261 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862428757] [2022-12-06 00:05:57,261 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1862428757] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:05:57,261 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:05:57,261 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:05:57,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434807296] [2022-12-06 00:05:57,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:05:57,261 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:05:57,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:05:57,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:05:57,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:05:57,262 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:05:57,262 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:05:57,262 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:05:57,262 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:05:57,262 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:05:57,619 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:05:57,619 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 00:05:57,627 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26969/27014 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13519 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:05:57,637 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:05:57,638 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:05:57,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:05:57,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:05:57,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:05:57,639 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:05:57,639 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:05:57,639 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:05:57,689 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:05:57,691 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:57,691 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:05:57,691 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:05:57,691 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:05:57,691 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:57,692 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:05:57,692 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:05:57,692 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:57,693 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:57,724 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:05:57,724 INFO L131 PetriNetUnfolder]: For 3122/3262 co-relation queries the response was YES. [2022-12-06 00:05:57,726 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3122/3262 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2978 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:05:57,729 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:57,729 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:05:57,910 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:05:57,911 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 220 [2022-12-06 00:05:57,911 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:05:57,911 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:05:57,911 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:05:57,911 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:05:57,911 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable475 [2022-12-06 00:05:57,911 INFO L420 AbstractCegarLoop]: === Iteration 477 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:05:57,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:05:57,912 INFO L85 PathProgramCache]: Analyzing trace with hash 880441792, now seen corresponding path program 1 times [2022-12-06 00:05:57,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:05:57,912 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618978255] [2022-12-06 00:05:57,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:05:57,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:05:57,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:05:58,002 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-06 00:05:58,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:05:58,002 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618978255] [2022-12-06 00:05:58,002 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [618978255] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:05:58,002 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:05:58,002 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:05:58,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521658264] [2022-12-06 00:05:58,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:05:58,003 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:05:58,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:05:58,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:05:58,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:05:58,003 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:05:58,003 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:05:58,003 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:05:58,003 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:05:58,004 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:05:58,376 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:05:58,376 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 00:05:58,384 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13558 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:05:58,394 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:05:58,394 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:05:58,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:05:58,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:05:58,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:05:58,395 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:05:58,395 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:05:58,396 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:05:58,445 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:05:58,449 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:58,449 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:05:58,449 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:05:58,449 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:05:58,449 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:58,450 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:05:58,450 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:05:58,450 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:58,451 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:58,482 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:05:58,483 INFO L131 PetriNetUnfolder]: For 3348/3558 co-relation queries the response was YES. [2022-12-06 00:05:58,484 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3348/3558 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2996 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:05:58,487 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:58,487 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:05:58,670 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:05:58,670 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 221 [2022-12-06 00:05:58,670 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:05:58,671 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:05:58,671 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:05:58,671 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:05:58,671 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable476 [2022-12-06 00:05:58,671 INFO L420 AbstractCegarLoop]: === Iteration 478 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:05:58,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:05:58,671 INFO L85 PathProgramCache]: Analyzing trace with hash -1671715169, now seen corresponding path program 1 times [2022-12-06 00:05:58,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:05:58,671 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088232775] [2022-12-06 00:05:58,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:05:58,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:05:58,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:05:58,753 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-06 00:05:58,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:05:58,754 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088232775] [2022-12-06 00:05:58,754 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2088232775] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:05:58,754 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:05:58,754 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:05:58,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081042079] [2022-12-06 00:05:58,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:05:58,754 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:05:58,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:05:58,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:05:58,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:05:58,755 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:05:58,755 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:05:58,755 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:05:58,755 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:05:58,755 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:05:59,157 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:05:59,157 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:05:59,163 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13561 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:05:59,170 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:05:59,170 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:05:59,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:05:59,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:05:59,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:05:59,171 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:05:59,171 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:05:59,171 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:05:59,211 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:05:59,213 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:59,213 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:05:59,213 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:05:59,213 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:05:59,213 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:59,214 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:05:59,214 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:05:59,214 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:59,214 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:59,245 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:05:59,245 INFO L131 PetriNetUnfolder]: For 3293/3500 co-relation queries the response was YES. [2022-12-06 00:05:59,246 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3293/3500 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2994 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:05:59,249 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:05:59,249 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:05:59,558 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:05:59,559 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 346 [2022-12-06 00:05:59,559 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:05:59,559 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:05:59,559 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:05:59,559 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:05:59,559 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable477 [2022-12-06 00:05:59,559 INFO L420 AbstractCegarLoop]: === Iteration 479 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:05:59,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:05:59,560 INFO L85 PathProgramCache]: Analyzing trace with hash 71095166, now seen corresponding path program 1 times [2022-12-06 00:05:59,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:05:59,560 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556833523] [2022-12-06 00:05:59,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:05:59,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:05:59,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:05:59,649 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-06 00:05:59,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:05:59,649 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556833523] [2022-12-06 00:05:59,649 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1556833523] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:05:59,649 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:05:59,649 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:05:59,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963404689] [2022-12-06 00:05:59,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:05:59,650 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:05:59,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:05:59,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:05:59,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:05:59,650 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:05:59,650 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:05:59,650 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:05:59,650 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:05:59,650 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:06:00,021 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:06:00,022 INFO L131 PetriNetUnfolder]: For 27136/27181 co-relation queries the response was YES. [2022-12-06 00:06:00,029 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27136/27181 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13516 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:06:00,039 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:06:00,039 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:06:00,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:06:00,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:06:00,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:06:00,040 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:06:00,040 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:06:00,040 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:06:00,087 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:06:00,088 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:00,088 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:06:00,089 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:06:00,089 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:06:00,089 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:00,089 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:06:00,089 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:06:00,090 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:00,090 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:00,122 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:06:00,122 INFO L131 PetriNetUnfolder]: For 3167/3307 co-relation queries the response was YES. [2022-12-06 00:06:00,124 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3167/3307 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2983 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:06:00,127 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:00,127 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:06:00,300 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:06:00,301 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 212 [2022-12-06 00:06:00,301 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:06:00,301 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:06:00,301 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:06:00,301 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:06:00,301 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable478 [2022-12-06 00:06:00,301 INFO L420 AbstractCegarLoop]: === Iteration 480 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:06:00,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:06:00,302 INFO L85 PathProgramCache]: Analyzing trace with hash 1813905501, now seen corresponding path program 1 times [2022-12-06 00:06:00,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:06:00,302 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909159814] [2022-12-06 00:06:00,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:06:00,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:06:00,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:06:00,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-06 00:06:00,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:06:00,385 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909159814] [2022-12-06 00:06:00,385 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1909159814] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:06:00,385 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:06:00,385 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:06:00,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883592980] [2022-12-06 00:06:00,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:06:00,386 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:06:00,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:06:00,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:06:00,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:06:00,386 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:06:00,386 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:06:00,386 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:06:00,386 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:06:00,387 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:06:00,742 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:06:00,742 INFO L131 PetriNetUnfolder]: For 27146/27191 co-relation queries the response was YES. [2022-12-06 00:06:00,752 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27146/27191 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13509 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:06:00,762 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:06:00,762 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:06:00,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:06:00,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:06:00,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:06:00,763 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:06:00,763 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:06:00,763 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:06:00,811 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:06:00,813 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:00,813 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:06:00,813 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:06:00,813 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:06:00,813 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:00,814 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:06:00,814 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:06:00,814 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:00,815 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:00,847 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:06:00,847 INFO L131 PetriNetUnfolder]: For 3168/3309 co-relation queries the response was YES. [2022-12-06 00:06:00,849 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3168/3309 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 3003 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:06:00,851 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:00,852 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:06:01,048 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:06:01,048 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 235 [2022-12-06 00:06:01,049 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:06:01,049 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:06:01,049 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:06:01,049 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:06:01,049 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable479 [2022-12-06 00:06:01,049 INFO L420 AbstractCegarLoop]: === Iteration 481 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:06:01,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:06:01,049 INFO L85 PathProgramCache]: Analyzing trace with hash -738251460, now seen corresponding path program 1 times [2022-12-06 00:06:01,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:06:01,050 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738977775] [2022-12-06 00:06:01,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:06:01,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:06:01,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:06:01,135 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:06:01,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:06:01,135 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738977775] [2022-12-06 00:06:01,135 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [738977775] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:06:01,135 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:06:01,135 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:06:01,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312049397] [2022-12-06 00:06:01,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:06:01,136 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:06:01,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:06:01,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:06:01,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:06:01,136 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:06:01,136 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:06:01,136 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:06:01,136 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:06:01,136 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:06:01,509 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:06:01,509 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 00:06:01,516 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26965/27010 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13529 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:06:01,526 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:06:01,526 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:06:01,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:06:01,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:06:01,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:06:01,527 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:06:01,527 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:06:01,527 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:06:01,575 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:06:01,577 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:01,577 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:06:01,577 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:06:01,577 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:06:01,577 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:01,578 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:06:01,578 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:06:01,578 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:01,579 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:01,610 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:06:01,610 INFO L131 PetriNetUnfolder]: For 3135/3276 co-relation queries the response was YES. [2022-12-06 00:06:01,612 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3135/3276 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2973 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:06:01,614 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:01,614 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:06:01,790 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:06:01,791 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 214 [2022-12-06 00:06:01,791 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:06:01,791 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:06:01,791 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:06:01,791 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:06:01,791 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable480 [2022-12-06 00:06:01,791 INFO L420 AbstractCegarLoop]: === Iteration 482 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:06:01,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:06:01,792 INFO L85 PathProgramCache]: Analyzing trace with hash 1004558875, now seen corresponding path program 1 times [2022-12-06 00:06:01,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:06:01,792 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078771922] [2022-12-06 00:06:01,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:06:01,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:06:01,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:06:01,878 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-06 00:06:01,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:06:01,878 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078771922] [2022-12-06 00:06:01,878 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1078771922] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:06:01,878 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:06:01,878 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:06:01,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038241759] [2022-12-06 00:06:01,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:06:01,879 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:06:01,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:06:01,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:06:01,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:06:01,879 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:06:01,879 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:06:01,879 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:06:01,879 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:06:01,879 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:06:02,255 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:06:02,256 INFO L131 PetriNetUnfolder]: For 26955/27000 co-relation queries the response was YES. [2022-12-06 00:06:02,264 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26955/27000 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13543 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:06:02,276 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:06:02,276 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:06:02,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:06:02,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:06:02,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:06:02,277 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:06:02,277 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:06:02,277 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:06:02,327 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:06:02,328 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:02,328 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:06:02,329 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:06:02,329 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:06:02,329 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:02,329 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:06:02,329 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:06:02,329 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:02,334 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:02,366 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:06:02,367 INFO L131 PetriNetUnfolder]: For 3134/3275 co-relation queries the response was YES. [2022-12-06 00:06:02,368 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3134/3275 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2974 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:06:02,371 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:02,371 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:06:02,558 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:06:02,558 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 229 [2022-12-06 00:06:02,558 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:06:02,558 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:06:02,559 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:06:02,559 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:06:02,559 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable481 [2022-12-06 00:06:02,559 INFO L420 AbstractCegarLoop]: === Iteration 483 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:06:02,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:06:02,559 INFO L85 PathProgramCache]: Analyzing trace with hash -1547598086, now seen corresponding path program 1 times [2022-12-06 00:06:02,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:06:02,559 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879731350] [2022-12-06 00:06:02,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:06:02,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:06:02,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:06:02,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:06:02,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:06:02,664 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879731350] [2022-12-06 00:06:02,664 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1879731350] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:06:02,664 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:06:02,664 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:06:02,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734105354] [2022-12-06 00:06:02,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:06:02,664 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:06:02,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:06:02,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:06:02,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:06:02,665 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:06:02,665 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:06:02,665 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:06:02,665 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:06:02,665 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:06:03,021 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:06:03,021 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:06:03,029 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13582 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:06:03,039 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:06:03,039 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:06:03,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:06:03,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:06:03,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:06:03,040 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:06:03,040 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:06:03,040 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:06:03,136 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:06:03,137 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:03,138 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:06:03,138 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:06:03,138 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:06:03,138 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:03,139 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:06:03,139 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:06:03,139 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:03,140 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:03,177 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:06:03,177 INFO L131 PetriNetUnfolder]: For 3310/3519 co-relation queries the response was YES. [2022-12-06 00:06:03,178 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3310/3519 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2964 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:06:03,181 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:03,181 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:06:03,376 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:06:03,377 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 239 [2022-12-06 00:06:03,377 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:06:03,377 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:06:03,377 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:06:03,377 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:06:03,377 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable482 [2022-12-06 00:06:03,377 INFO L420 AbstractCegarLoop]: === Iteration 484 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:06:03,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:06:03,377 INFO L85 PathProgramCache]: Analyzing trace with hash 195212249, now seen corresponding path program 1 times [2022-12-06 00:06:03,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:06:03,378 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960172806] [2022-12-06 00:06:03,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:06:03,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:06:03,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:06:03,451 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-06 00:06:03,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:06:03,451 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960172806] [2022-12-06 00:06:03,451 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1960172806] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:06:03,451 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:06:03,451 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:06:03,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389591611] [2022-12-06 00:06:03,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:06:03,452 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:06:03,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:06:03,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:06:03,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:06:03,452 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:06:03,452 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:06:03,452 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:06:03,452 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:06:03,452 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:06:03,818 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:06:03,818 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 00:06:03,826 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26969/27014 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13560 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:06:03,838 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:06:03,838 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:06:03,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:06:03,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:06:03,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:06:03,839 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:06:03,839 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:06:03,839 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:06:03,893 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:06:03,914 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:03,914 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:06:03,915 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:06:03,915 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:06:03,915 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:03,915 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:06:03,915 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:06:03,915 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:03,916 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:03,952 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:06:03,953 INFO L131 PetriNetUnfolder]: For 3123/3264 co-relation queries the response was YES. [2022-12-06 00:06:03,954 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3123/3264 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2986 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:06:03,957 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:03,957 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:06:04,169 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:06:04,169 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 254 [2022-12-06 00:06:04,169 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:06:04,170 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:06:04,170 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:06:04,170 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:06:04,170 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable483 [2022-12-06 00:06:04,170 INFO L420 AbstractCegarLoop]: === Iteration 485 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:06:04,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:06:04,170 INFO L85 PathProgramCache]: Analyzing trace with hash 1938022584, now seen corresponding path program 1 times [2022-12-06 00:06:04,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:06:04,170 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978592393] [2022-12-06 00:06:04,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:06:04,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:06:04,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:06:04,249 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-06 00:06:04,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:06:04,249 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978592393] [2022-12-06 00:06:04,249 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1978592393] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:06:04,249 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:06:04,250 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:06:04,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291042841] [2022-12-06 00:06:04,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:06:04,250 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:06:04,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:06:04,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:06:04,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:06:04,250 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:06:04,250 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:06:04,250 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:06:04,251 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:06:04,251 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:06:04,614 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:06:04,615 INFO L131 PetriNetUnfolder]: For 26955/27000 co-relation queries the response was YES. [2022-12-06 00:06:04,625 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26955/27000 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13524 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:06:04,636 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:06:04,636 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:06:04,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:06:04,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:06:04,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:06:04,637 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:06:04,638 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:06:04,638 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:06:04,688 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:06:04,690 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:04,690 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:06:04,690 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:06:04,691 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:06:04,691 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:04,691 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:06:04,691 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:06:04,691 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:04,692 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:04,725 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:06:04,726 INFO L131 PetriNetUnfolder]: For 3146/3287 co-relation queries the response was YES. [2022-12-06 00:06:04,727 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3146/3287 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2963 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:06:04,730 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:04,730 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:06:04,907 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:06:04,908 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 217 [2022-12-06 00:06:04,908 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:06:04,908 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:06:04,908 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:06:04,908 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:06:04,908 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable484 [2022-12-06 00:06:04,908 INFO L420 AbstractCegarLoop]: === Iteration 486 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:06:04,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:06:04,909 INFO L85 PathProgramCache]: Analyzing trace with hash -614134377, now seen corresponding path program 1 times [2022-12-06 00:06:04,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:06:04,909 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560812223] [2022-12-06 00:06:04,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:06:04,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:06:04,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:06:04,997 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-06 00:06:04,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:06:04,998 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560812223] [2022-12-06 00:06:04,998 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1560812223] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:06:04,998 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:06:04,998 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:06:04,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039269981] [2022-12-06 00:06:04,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:06:04,998 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:06:04,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:06:04,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:06:04,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:06:04,999 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:06:04,999 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:06:04,999 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:06:04,999 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:06:04,999 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:06:05,382 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:06:05,383 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 00:06:05,391 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26969/27014 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13525 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:06:05,402 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:06:05,403 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:06:05,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:06:05,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:06:05,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:06:05,404 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:06:05,404 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:06:05,404 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:06:05,452 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:06:05,454 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:05,454 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:06:05,454 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:06:05,454 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:06:05,454 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:05,455 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:06:05,455 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:06:05,455 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:05,456 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:05,494 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:06:05,494 INFO L131 PetriNetUnfolder]: For 3122/3262 co-relation queries the response was YES. [2022-12-06 00:06:05,496 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3122/3262 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2974 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:06:05,501 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:05,501 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:06:05,690 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:06:05,691 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 237 [2022-12-06 00:06:05,691 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:06:05,691 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:06:05,691 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:06:05,691 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:06:05,691 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable485 [2022-12-06 00:06:05,691 INFO L420 AbstractCegarLoop]: === Iteration 487 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:06:05,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:06:05,692 INFO L85 PathProgramCache]: Analyzing trace with hash 1128675958, now seen corresponding path program 1 times [2022-12-06 00:06:05,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:06:05,692 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041691314] [2022-12-06 00:06:05,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:06:05,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:06:05,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:06:05,762 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-06 00:06:05,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:06:05,763 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041691314] [2022-12-06 00:06:05,763 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2041691314] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:06:05,763 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:06:05,763 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:06:05,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945114015] [2022-12-06 00:06:05,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:06:05,763 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:06:05,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:06:05,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:06:05,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:06:05,764 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:06:05,764 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:06:05,764 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:06:05,764 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:06:05,764 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:06:06,159 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:06:06,159 INFO L131 PetriNetUnfolder]: For 26955/27000 co-relation queries the response was YES. [2022-12-06 00:06:06,166 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26955/27000 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13545 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:06:06,177 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:06:06,177 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:06:06,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:06:06,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:06:06,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:06:06,178 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:06:06,178 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:06:06,178 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:06:06,232 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:06:06,233 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:06,233 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:06:06,234 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:06:06,234 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:06:06,234 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:06,234 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:06:06,234 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:06:06,234 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:06,235 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:06,271 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:06:06,271 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 00:06:06,273 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3133/3273 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2970 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:06:06,275 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:06,275 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:06:06,505 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:06:06,505 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 271 [2022-12-06 00:06:06,505 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:06:06,506 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:06:06,506 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:06:06,506 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:06:06,506 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable486 [2022-12-06 00:06:06,506 INFO L420 AbstractCegarLoop]: === Iteration 488 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:06:06,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:06:06,506 INFO L85 PathProgramCache]: Analyzing trace with hash -1423481003, now seen corresponding path program 1 times [2022-12-06 00:06:06,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:06:06,506 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055065393] [2022-12-06 00:06:06,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:06:06,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:06:06,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:06:06,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:06:06,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:06:06,589 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055065393] [2022-12-06 00:06:06,589 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1055065393] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:06:06,589 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:06:06,589 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:06:06,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989909055] [2022-12-06 00:06:06,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:06:06,589 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:06:06,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:06:06,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:06:06,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:06:06,590 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:06:06,590 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:06:06,590 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:06:06,590 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:06:06,590 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:06:06,998 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:06:06,999 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:06:07,008 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13565 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:06:07,019 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:06:07,019 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:06:07,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:06:07,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:06:07,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:06:07,020 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:06:07,020 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:06:07,020 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:06:07,072 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:06:07,073 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:07,074 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:06:07,074 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:06:07,074 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:06:07,074 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:07,075 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:06:07,075 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:06:07,075 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:07,076 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:07,116 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:06:07,116 INFO L131 PetriNetUnfolder]: For 3318/3528 co-relation queries the response was YES. [2022-12-06 00:06:07,118 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3318/3528 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2981 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:06:07,139 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:07,139 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:06:07,332 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:06:07,333 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 259 [2022-12-06 00:06:07,333 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:06:07,333 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:06:07,333 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:06:07,333 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:06:07,333 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable487 [2022-12-06 00:06:07,333 INFO L420 AbstractCegarLoop]: === Iteration 489 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:06:07,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:06:07,333 INFO L85 PathProgramCache]: Analyzing trace with hash 319329332, now seen corresponding path program 1 times [2022-12-06 00:06:07,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:06:07,334 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479116886] [2022-12-06 00:06:07,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:06:07,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:06:07,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:06:07,431 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-06 00:06:07,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:06:07,431 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479116886] [2022-12-06 00:06:07,431 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [479116886] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:06:07,431 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:06:07,431 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:06:07,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107236835] [2022-12-06 00:06:07,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:06:07,432 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:06:07,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:06:07,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:06:07,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:06:07,432 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:06:07,432 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:06:07,432 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:06:07,433 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:06:07,433 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:06:07,843 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:06:07,843 INFO L131 PetriNetUnfolder]: For 27229/27274 co-relation queries the response was YES. [2022-12-06 00:06:07,850 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27229/27274 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13543 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:06:07,859 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:06:07,859 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:06:07,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:06:07,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:06:07,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:06:07,860 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:06:07,860 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:06:07,860 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:06:07,908 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:06:07,910 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:07,910 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:06:07,910 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:06:07,910 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:06:07,911 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:07,911 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:06:07,911 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:06:07,911 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:07,912 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:07,950 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:06:07,950 INFO L131 PetriNetUnfolder]: For 3348/3558 co-relation queries the response was YES. [2022-12-06 00:06:07,952 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3348/3558 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2975 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:06:07,954 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:07,954 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:06:08,160 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:06:08,161 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 250 [2022-12-06 00:06:08,161 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:06:08,161 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:06:08,161 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:06:08,161 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:06:08,161 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable488 [2022-12-06 00:06:08,161 INFO L420 AbstractCegarLoop]: === Iteration 490 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:06:08,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:06:08,161 INFO L85 PathProgramCache]: Analyzing trace with hash 2062139667, now seen corresponding path program 1 times [2022-12-06 00:06:08,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:06:08,161 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7217806] [2022-12-06 00:06:08,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:06:08,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:06:08,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:06:08,230 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-06 00:06:08,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:06:08,230 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7217806] [2022-12-06 00:06:08,230 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [7217806] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:06:08,230 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:06:08,231 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:06:08,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781490287] [2022-12-06 00:06:08,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:06:08,231 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:06:08,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:06:08,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:06:08,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:06:08,231 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:06:08,231 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:06:08,231 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:06:08,231 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:06:08,232 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:06:08,583 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:06:08,584 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:06:08,591 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13551 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:06:08,601 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:06:08,601 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:06:08,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:06:08,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:06:08,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:06:08,602 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:06:08,602 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:06:08,602 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:06:08,650 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:06:08,652 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:08,652 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:06:08,652 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:06:08,652 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:06:08,652 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:08,653 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:06:08,653 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:06:08,653 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:08,654 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:08,684 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:06:08,685 INFO L131 PetriNetUnfolder]: For 3301/3509 co-relation queries the response was YES. [2022-12-06 00:06:08,686 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3301/3509 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2987 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:06:08,689 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:08,689 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:06:08,867 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:06:08,867 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 215 [2022-12-06 00:06:08,867 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:06:08,868 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:06:08,868 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:06:08,868 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:06:08,868 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable489 [2022-12-06 00:06:08,868 INFO L420 AbstractCegarLoop]: === Iteration 491 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:06:08,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:06:08,868 INFO L85 PathProgramCache]: Analyzing trace with hash -490017294, now seen corresponding path program 1 times [2022-12-06 00:06:08,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:06:08,868 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852249531] [2022-12-06 00:06:08,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:06:08,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:06:08,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:06:08,956 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-06 00:06:08,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:06:08,956 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852249531] [2022-12-06 00:06:08,956 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [852249531] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:06:08,956 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:06:08,956 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:06:08,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332547479] [2022-12-06 00:06:08,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:06:08,957 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:06:08,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:06:08,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:06:08,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:06:08,957 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:06:08,957 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:06:08,957 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:06:08,957 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:06:08,957 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:06:09,409 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:06:09,409 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 00:06:09,417 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13564 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:06:09,426 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:06:09,426 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:06:09,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:06:09,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:06:09,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:06:09,427 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:06:09,427 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:06:09,428 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:06:09,470 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:06:09,472 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:09,472 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:06:09,472 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:06:09,472 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:06:09,472 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:09,473 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:06:09,473 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:06:09,473 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:09,482 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:09,514 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:06:09,514 INFO L131 PetriNetUnfolder]: For 3310/3519 co-relation queries the response was YES. [2022-12-06 00:06:09,516 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3310/3519 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2987 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:06:09,518 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:09,518 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:06:09,695 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:06:09,695 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 223 [2022-12-06 00:06:09,696 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:06:09,696 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:06:09,696 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:06:09,696 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:06:09,696 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable490 [2022-12-06 00:06:09,696 INFO L420 AbstractCegarLoop]: === Iteration 492 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:06:09,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:06:09,696 INFO L85 PathProgramCache]: Analyzing trace with hash 1252793041, now seen corresponding path program 1 times [2022-12-06 00:06:09,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:06:09,696 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085230562] [2022-12-06 00:06:09,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:06:09,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:06:09,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:06:09,769 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-06 00:06:09,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:06:09,769 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085230562] [2022-12-06 00:06:09,769 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2085230562] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:06:09,770 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:06:09,770 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:06:09,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802295557] [2022-12-06 00:06:09,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:06:09,770 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:06:09,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:06:09,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:06:09,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:06:09,770 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:06:09,771 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:06:09,771 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:06:09,771 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:06:09,771 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:06:10,151 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:06:10,151 INFO L131 PetriNetUnfolder]: For 26955/27000 co-relation queries the response was YES. [2022-12-06 00:06:10,158 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26955/27000 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13515 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:06:10,168 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:06:10,168 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:06:10,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:06:10,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:06:10,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:06:10,169 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:06:10,169 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:06:10,169 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:06:10,219 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:06:10,221 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:10,221 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:06:10,221 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:06:10,221 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:06:10,221 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:10,222 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:06:10,222 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:06:10,222 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:10,223 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:10,256 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:06:10,256 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 00:06:10,257 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3133/3273 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2958 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:06:10,260 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:10,260 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:06:10,429 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:06:10,430 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 209 [2022-12-06 00:06:10,430 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:06:10,430 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:06:10,430 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:06:10,430 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:06:10,430 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable491 [2022-12-06 00:06:10,430 INFO L420 AbstractCegarLoop]: === Iteration 493 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:06:10,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:06:10,431 INFO L85 PathProgramCache]: Analyzing trace with hash -1299363920, now seen corresponding path program 1 times [2022-12-06 00:06:10,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:06:10,431 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449621117] [2022-12-06 00:06:10,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:06:10,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:06:10,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:06:10,500 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-06 00:06:10,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:06:10,501 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449621117] [2022-12-06 00:06:10,501 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1449621117] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:06:10,501 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:06:10,501 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:06:10,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963888401] [2022-12-06 00:06:10,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:06:10,501 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:06:10,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:06:10,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:06:10,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:06:10,501 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:06:10,502 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:06:10,502 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:06:10,502 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:06:10,502 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:06:10,849 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:06:10,849 INFO L131 PetriNetUnfolder]: For 27229/27274 co-relation queries the response was YES. [2022-12-06 00:06:10,857 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27229/27274 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13559 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:06:10,866 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:06:10,867 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:06:10,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:06:10,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:06:10,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:06:10,867 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:06:10,868 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:06:10,868 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:06:10,917 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:06:10,919 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:10,919 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:06:10,919 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:06:10,919 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:06:10,919 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:10,920 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:06:10,920 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:06:10,920 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:10,921 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:10,955 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:06:10,956 INFO L131 PetriNetUnfolder]: For 3327/3536 co-relation queries the response was YES. [2022-12-06 00:06:10,957 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3327/3536 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2973 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:06:10,960 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:10,960 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:06:11,175 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:06:11,176 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 257 [2022-12-06 00:06:11,176 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:06:11,176 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:06:11,176 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:06:11,177 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:06:11,177 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable492 [2022-12-06 00:06:11,177 INFO L420 AbstractCegarLoop]: === Iteration 494 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:06:11,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:06:11,177 INFO L85 PathProgramCache]: Analyzing trace with hash 443446415, now seen corresponding path program 1 times [2022-12-06 00:06:11,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:06:11,177 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086028036] [2022-12-06 00:06:11,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:06:11,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:06:11,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:06:11,280 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-06 00:06:11,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:06:11,281 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086028036] [2022-12-06 00:06:11,281 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1086028036] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:06:11,281 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:06:11,281 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:06:11,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514952938] [2022-12-06 00:06:11,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:06:11,281 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:06:11,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:06:11,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:06:11,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:06:11,282 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:06:11,282 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:06:11,282 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:06:11,282 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:06:11,282 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:06:11,656 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:06:11,656 INFO L131 PetriNetUnfolder]: For 26955/27000 co-relation queries the response was YES. [2022-12-06 00:06:11,663 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26955/27000 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13518 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:06:11,673 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:06:11,673 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:06:11,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:06:11,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:06:11,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:06:11,676 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:06:11,676 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:06:11,676 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:06:11,725 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:06:11,727 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:11,727 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:06:11,728 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:06:11,728 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:06:11,728 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:11,728 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:06:11,728 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:06:11,729 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:11,729 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:11,763 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:06:11,764 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 00:06:11,765 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3133/3273 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2977 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:06:11,768 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:11,768 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:06:11,973 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:06:11,973 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 245 [2022-12-06 00:06:11,974 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:06:11,974 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:06:11,974 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:06:11,974 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:06:11,974 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable493 [2022-12-06 00:06:11,974 INFO L420 AbstractCegarLoop]: === Iteration 495 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:06:11,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:06:11,974 INFO L85 PathProgramCache]: Analyzing trace with hash -2108710546, now seen corresponding path program 1 times [2022-12-06 00:06:11,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:06:11,974 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788631861] [2022-12-06 00:06:11,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:06:11,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:06:11,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:06:12,066 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-06 00:06:12,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:06:12,066 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788631861] [2022-12-06 00:06:12,067 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [788631861] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:06:12,067 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:06:12,067 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:06:12,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390939377] [2022-12-06 00:06:12,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:06:12,067 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:06:12,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:06:12,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:06:12,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:06:12,067 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:06:12,068 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:06:12,068 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:06:12,068 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:06:12,068 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:06:12,434 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:06:12,435 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 00:06:12,443 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26965/27010 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13517 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:06:12,455 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:06:12,455 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:06:12,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:06:12,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:06:12,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:06:12,460 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:06:12,460 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:06:12,460 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:06:12,510 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:06:12,512 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:12,512 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:06:12,512 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:06:12,513 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:06:12,513 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:12,513 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:06:12,513 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:06:12,513 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:12,514 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:12,548 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:06:12,548 INFO L131 PetriNetUnfolder]: For 3123/3264 co-relation queries the response was YES. [2022-12-06 00:06:12,550 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3123/3264 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2982 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:06:12,553 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:12,553 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:06:12,731 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:06:12,731 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 218 [2022-12-06 00:06:12,731 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:06:12,731 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:06:12,731 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:06:12,732 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:06:12,732 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable494 [2022-12-06 00:06:12,732 INFO L420 AbstractCegarLoop]: === Iteration 496 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:06:12,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:06:12,732 INFO L85 PathProgramCache]: Analyzing trace with hash -365900211, now seen corresponding path program 1 times [2022-12-06 00:06:12,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:06:12,732 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51590139] [2022-12-06 00:06:12,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:06:12,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:06:12,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:06:12,818 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-06 00:06:12,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:06:12,818 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51590139] [2022-12-06 00:06:12,818 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [51590139] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:06:12,818 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:06:12,818 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:06:12,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769775598] [2022-12-06 00:06:12,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:06:12,819 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:06:12,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:06:12,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:06:12,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:06:12,819 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:06:12,819 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:06:12,819 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:06:12,820 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:06:12,820 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:06:13,267 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:06:13,268 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:06:13,275 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13553 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:06:13,283 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:06:13,283 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:06:13,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:06:13,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:06:13,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:06:13,284 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:06:13,284 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:06:13,285 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:06:13,329 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:06:13,330 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:13,331 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:06:13,331 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:06:13,331 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:06:13,331 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:13,332 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:06:13,332 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:06:13,332 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:13,332 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:13,366 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:06:13,366 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 00:06:13,368 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3312/3520 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2982 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:06:13,371 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:13,371 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:06:13,558 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:06:13,558 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 227 [2022-12-06 00:06:13,558 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:06:13,559 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:06:13,559 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:06:13,559 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:06:13,559 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable495 [2022-12-06 00:06:13,559 INFO L420 AbstractCegarLoop]: === Iteration 497 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:06:13,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:06:13,559 INFO L85 PathProgramCache]: Analyzing trace with hash 1376910124, now seen corresponding path program 1 times [2022-12-06 00:06:13,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:06:13,559 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146912919] [2022-12-06 00:06:13,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:06:13,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:06:13,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:06:13,627 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-06 00:06:13,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:06:13,628 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146912919] [2022-12-06 00:06:13,628 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1146912919] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:06:13,628 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:06:13,628 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:06:13,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876664919] [2022-12-06 00:06:13,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:06:13,628 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:06:13,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:06:13,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:06:13,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:06:13,629 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:06:13,629 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:06:13,629 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:06:13,629 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:06:13,629 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:06:14,046 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:06:14,046 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:06:14,053 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13579 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:06:14,064 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:06:14,064 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:06:14,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:06:14,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:06:14,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:06:14,065 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:06:14,065 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:06:14,065 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:06:14,118 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:06:14,119 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:14,119 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:06:14,120 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:06:14,120 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:06:14,120 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:14,120 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:06:14,120 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:06:14,121 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:14,121 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:14,157 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:06:14,157 INFO L131 PetriNetUnfolder]: For 3349/3561 co-relation queries the response was YES. [2022-12-06 00:06:14,158 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3349/3561 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2976 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:06:14,161 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:14,161 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:06:14,357 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:06:14,357 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 237 [2022-12-06 00:06:14,358 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:06:14,358 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:06:14,358 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:06:14,358 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:06:14,358 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable496 [2022-12-06 00:06:14,358 INFO L420 AbstractCegarLoop]: === Iteration 498 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:06:14,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:06:14,358 INFO L85 PathProgramCache]: Analyzing trace with hash -1175246837, now seen corresponding path program 1 times [2022-12-06 00:06:14,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:06:14,358 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388844528] [2022-12-06 00:06:14,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:06:14,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:06:14,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:06:14,447 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-06 00:06:14,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:06:14,448 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388844528] [2022-12-06 00:06:14,448 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1388844528] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:06:14,448 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:06:14,448 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:06:14,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400641801] [2022-12-06 00:06:14,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:06:14,448 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:06:14,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:06:14,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:06:14,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:06:14,449 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:06:14,449 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:06:14,449 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:06:14,449 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:06:14,449 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:06:14,815 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:06:14,815 INFO L131 PetriNetUnfolder]: For 27146/27191 co-relation queries the response was YES. [2022-12-06 00:06:14,823 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27146/27191 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13536 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:06:14,835 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:06:14,835 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:06:14,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:06:14,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:06:14,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:06:14,840 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:06:14,840 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:06:14,840 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:06:14,890 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:06:14,892 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:14,892 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:06:14,892 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:06:14,892 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:06:14,892 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:14,893 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:06:14,893 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:06:14,893 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:14,894 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:14,928 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:06:14,928 INFO L131 PetriNetUnfolder]: For 3167/3307 co-relation queries the response was YES. [2022-12-06 00:06:14,930 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3167/3307 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 3003 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:06:14,933 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:14,933 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:06:15,129 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:06:15,130 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 238 [2022-12-06 00:06:15,130 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:06:15,130 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:06:15,130 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:06:15,130 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:06:15,130 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable497 [2022-12-06 00:06:15,130 INFO L420 AbstractCegarLoop]: === Iteration 499 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:06:15,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:06:15,131 INFO L85 PathProgramCache]: Analyzing trace with hash 567563498, now seen corresponding path program 1 times [2022-12-06 00:06:15,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:06:15,131 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786014699] [2022-12-06 00:06:15,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:06:15,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:06:15,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:06:15,278 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-06 00:06:15,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:06:15,278 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786014699] [2022-12-06 00:06:15,278 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [786014699] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:06:15,279 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:06:15,279 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:06:15,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959121600] [2022-12-06 00:06:15,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:06:15,279 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:06:15,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:06:15,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:06:15,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:06:15,280 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:06:15,280 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:06:15,280 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:06:15,280 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:06:15,280 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:06:15,661 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:06:15,662 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:06:15,669 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13551 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:06:15,678 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:06:15,679 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:06:15,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:06:15,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:06:15,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:06:15,679 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:06:15,679 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:06:15,680 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:06:15,729 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:06:15,730 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:15,730 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:06:15,731 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:06:15,731 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:06:15,731 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:15,731 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:06:15,731 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:06:15,731 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:15,732 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:15,764 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:06:15,765 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 00:06:15,766 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3321/3530 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2985 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:06:15,768 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:15,769 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:06:15,969 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:06:15,970 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 239 [2022-12-06 00:06:15,970 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:06:15,970 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:06:15,970 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:06:15,970 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:06:15,970 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable498 [2022-12-06 00:06:15,970 INFO L420 AbstractCegarLoop]: === Iteration 500 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:06:15,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:06:15,971 INFO L85 PathProgramCache]: Analyzing trace with hash -1984593463, now seen corresponding path program 1 times [2022-12-06 00:06:15,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:06:15,971 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645421930] [2022-12-06 00:06:15,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:06:15,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:06:15,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:06:16,052 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-06 00:06:16,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:06:16,052 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645421930] [2022-12-06 00:06:16,052 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [645421930] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:06:16,052 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:06:16,052 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:06:16,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960477293] [2022-12-06 00:06:16,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:06:16,053 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:06:16,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:06:16,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:06:16,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:06:16,053 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:06:16,053 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:06:16,054 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:06:16,054 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:06:16,054 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:06:16,410 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:06:16,411 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:06:16,421 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13560 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:06:16,432 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:06:16,432 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:06:16,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:06:16,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:06:16,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:06:16,433 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:06:16,433 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:06:16,433 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:06:16,481 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:06:16,482 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:16,483 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:06:16,483 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:06:16,483 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:06:16,483 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:16,483 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:06:16,483 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:06:16,484 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:16,484 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:16,520 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:06:16,521 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 00:06:16,522 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3321/3530 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2982 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:06:16,525 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:16,525 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:06:16,720 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:06:16,721 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 238 [2022-12-06 00:06:16,721 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:06:16,721 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:06:16,721 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:06:16,721 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:06:16,721 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable499 [2022-12-06 00:06:16,721 INFO L420 AbstractCegarLoop]: === Iteration 501 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:06:16,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:06:16,722 INFO L85 PathProgramCache]: Analyzing trace with hash -241783128, now seen corresponding path program 1 times [2022-12-06 00:06:16,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:06:16,722 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091614304] [2022-12-06 00:06:16,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:06:16,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:06:16,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:06:16,829 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-06 00:06:16,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:06:16,830 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091614304] [2022-12-06 00:06:16,830 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1091614304] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:06:16,830 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:06:16,830 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:06:16,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846443793] [2022-12-06 00:06:16,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:06:16,830 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:06:16,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:06:16,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:06:16,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:06:16,831 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:06:16,831 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:06:16,831 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:06:16,831 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:06:16,831 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:06:17,191 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:06:17,191 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:06:17,200 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13559 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:06:17,211 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:06:17,212 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:06:17,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:06:17,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:06:17,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:06:17,212 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:06:17,213 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:06:17,213 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:06:17,263 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:06:17,264 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:17,264 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:06:17,265 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:06:17,265 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:06:17,265 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:17,265 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:06:17,266 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:06:17,266 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:17,266 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:17,326 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:06:17,326 INFO L131 PetriNetUnfolder]: For 3338/3547 co-relation queries the response was YES. [2022-12-06 00:06:17,327 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3338/3547 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2980 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:06:17,330 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:17,330 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:06:17,515 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:06:17,516 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 251 [2022-12-06 00:06:17,516 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:06:17,516 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:06:17,516 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:06:17,516 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:06:17,516 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable500 [2022-12-06 00:06:17,516 INFO L420 AbstractCegarLoop]: === Iteration 502 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:06:17,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:06:17,516 INFO L85 PathProgramCache]: Analyzing trace with hash 1501027207, now seen corresponding path program 1 times [2022-12-06 00:06:17,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:06:17,517 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517414319] [2022-12-06 00:06:17,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:06:17,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:06:17,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:06:17,597 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-06 00:06:17,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:06:17,597 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517414319] [2022-12-06 00:06:17,597 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1517414319] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:06:17,598 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:06:17,598 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:06:17,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634732472] [2022-12-06 00:06:17,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:06:17,598 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:06:17,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:06:17,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:06:17,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:06:17,598 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:06:17,598 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:06:17,599 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:06:17,599 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:06:17,599 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:06:17,960 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:06:17,960 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 00:06:17,968 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26969/27014 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13542 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:06:17,979 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:06:17,979 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:06:17,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:06:17,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:06:17,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:06:17,980 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:06:17,980 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:06:17,980 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:06:18,031 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:06:18,032 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:18,033 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:06:18,033 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:06:18,033 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:06:18,033 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:18,034 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:06:18,034 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:06:18,034 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:18,035 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:18,065 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:06:18,065 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 00:06:18,067 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3133/3273 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2981 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:06:18,069 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:18,069 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:06:18,247 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:06:18,248 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 215 [2022-12-06 00:06:18,248 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:06:18,248 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:06:18,248 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:06:18,248 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:06:18,248 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable501 [2022-12-06 00:06:18,248 INFO L420 AbstractCegarLoop]: === Iteration 503 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:06:18,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:06:18,249 INFO L85 PathProgramCache]: Analyzing trace with hash -1051129754, now seen corresponding path program 1 times [2022-12-06 00:06:18,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:06:18,249 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524303648] [2022-12-06 00:06:18,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:06:18,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:06:18,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:06:18,332 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-06 00:06:18,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:06:18,332 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524303648] [2022-12-06 00:06:18,332 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1524303648] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:06:18,332 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:06:18,332 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:06:18,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406055409] [2022-12-06 00:06:18,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:06:18,333 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:06:18,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:06:18,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:06:18,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:06:18,333 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:06:18,333 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:06:18,333 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:06:18,333 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:06:18,333 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:06:18,697 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:06:18,697 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:06:18,705 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13553 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:06:18,718 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:06:18,718 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:06:18,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:06:18,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:06:18,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:06:18,719 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:06:18,719 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:06:18,719 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:06:18,768 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:06:18,770 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:18,770 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:06:18,770 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:06:18,770 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:06:18,770 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:18,771 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:06:18,771 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:06:18,771 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:18,772 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:18,803 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:06:18,804 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 00:06:18,805 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3321/3530 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2986 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:06:18,808 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:18,808 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:06:18,994 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:06:18,995 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 225 [2022-12-06 00:06:18,995 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:06:18,995 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:06:18,995 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:06:18,995 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:06:18,995 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable502 [2022-12-06 00:06:18,995 INFO L420 AbstractCegarLoop]: === Iteration 504 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:06:18,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:06:18,995 INFO L85 PathProgramCache]: Analyzing trace with hash 691680581, now seen corresponding path program 1 times [2022-12-06 00:06:18,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:06:18,996 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629088169] [2022-12-06 00:06:18,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:06:18,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:06:19,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:06:19,068 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-06 00:06:19,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:06:19,069 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629088169] [2022-12-06 00:06:19,069 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [629088169] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:06:19,069 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:06:19,069 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:06:19,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305496587] [2022-12-06 00:06:19,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:06:19,070 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:06:19,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:06:19,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:06:19,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:06:19,070 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:06:19,070 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:06:19,070 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:06:19,070 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:06:19,070 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:06:19,469 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:06:19,470 INFO L131 PetriNetUnfolder]: For 27229/27274 co-relation queries the response was YES. [2022-12-06 00:06:19,477 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27229/27274 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13568 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:06:19,486 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:06:19,487 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:06:19,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:06:19,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:06:19,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:06:19,488 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:06:19,488 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:06:19,488 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:06:19,535 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:06:19,536 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:19,536 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:06:19,537 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:06:19,537 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:06:19,537 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:19,537 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:06:19,537 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:06:19,538 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:19,538 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:19,570 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:06:19,570 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 00:06:19,571 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3312/3520 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2990 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:06:19,574 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:19,574 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:06:19,742 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:06:19,742 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 205 [2022-12-06 00:06:19,743 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:06:19,743 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:06:19,743 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:06:19,743 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:06:19,743 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable503 [2022-12-06 00:06:19,743 INFO L420 AbstractCegarLoop]: === Iteration 505 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:06:19,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:06:19,743 INFO L85 PathProgramCache]: Analyzing trace with hash -1860476380, now seen corresponding path program 1 times [2022-12-06 00:06:19,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:06:19,743 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942755898] [2022-12-06 00:06:19,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:06:19,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:06:19,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:06:19,812 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-06 00:06:19,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:06:19,813 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942755898] [2022-12-06 00:06:19,813 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1942755898] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:06:19,813 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:06:19,813 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:06:19,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488722114] [2022-12-06 00:06:19,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:06:19,813 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:06:19,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:06:19,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:06:19,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:06:19,814 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:06:19,814 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:06:19,814 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:06:19,814 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:06:19,814 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:06:20,176 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:06:20,177 INFO L131 PetriNetUnfolder]: For 27229/27274 co-relation queries the response was YES. [2022-12-06 00:06:20,186 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27229/27274 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13562 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:06:20,198 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:06:20,198 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:06:20,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:06:20,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:06:20,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:06:20,199 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:06:20,199 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:06:20,199 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:06:20,247 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:06:20,249 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:20,249 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:06:20,249 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:06:20,249 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:06:20,249 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:20,250 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:06:20,250 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:06:20,250 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:20,251 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:20,282 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:06:20,282 INFO L131 PetriNetUnfolder]: For 3327/3536 co-relation queries the response was YES. [2022-12-06 00:06:20,284 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3327/3536 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2994 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:06:20,286 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:20,286 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:06:20,463 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:06:20,463 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 214 [2022-12-06 00:06:20,463 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:06:20,463 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:06:20,463 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:06:20,464 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:06:20,464 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable504 [2022-12-06 00:06:20,464 INFO L420 AbstractCegarLoop]: === Iteration 506 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:06:20,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:06:20,464 INFO L85 PathProgramCache]: Analyzing trace with hash -117666045, now seen corresponding path program 1 times [2022-12-06 00:06:20,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:06:20,464 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261352320] [2022-12-06 00:06:20,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:06:20,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:06:20,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:06:20,564 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-06 00:06:20,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:06:20,565 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261352320] [2022-12-06 00:06:20,565 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1261352320] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:06:20,565 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:06:20,565 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:06:20,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119648402] [2022-12-06 00:06:20,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:06:20,566 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:06:20,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:06:20,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:06:20,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:06:20,566 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:06:20,566 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:06:20,566 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:06:20,566 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:06:20,567 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:06:20,966 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:06:20,966 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:06:20,974 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13576 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:06:20,986 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:06:20,986 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:06:20,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:06:20,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:06:20,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:06:20,987 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:06:20,987 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:06:20,987 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:06:21,035 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:06:21,037 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:21,037 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:06:21,037 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:06:21,037 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:06:21,037 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:21,038 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:06:21,038 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:06:21,038 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:21,039 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:21,070 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:06:21,071 INFO L131 PetriNetUnfolder]: For 3304/3511 co-relation queries the response was YES. [2022-12-06 00:06:21,072 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3304/3511 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2986 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:06:21,075 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:21,075 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:06:21,256 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:06:21,257 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 220 [2022-12-06 00:06:21,257 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:06:21,257 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:06:21,257 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:06:21,257 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:06:21,257 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable505 [2022-12-06 00:06:21,257 INFO L420 AbstractCegarLoop]: === Iteration 507 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:06:21,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:06:21,258 INFO L85 PathProgramCache]: Analyzing trace with hash 1625144290, now seen corresponding path program 1 times [2022-12-06 00:06:21,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:06:21,258 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676552104] [2022-12-06 00:06:21,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:06:21,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:06:21,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:06:21,343 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-06 00:06:21,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:06:21,343 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676552104] [2022-12-06 00:06:21,343 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1676552104] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:06:21,344 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:06:21,344 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:06:21,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713545007] [2022-12-06 00:06:21,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:06:21,344 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:06:21,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:06:21,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:06:21,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:06:21,344 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:06:21,344 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:06:21,344 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:06:21,344 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:06:21,345 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:06:21,716 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:06:21,716 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 00:06:21,724 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26969/27014 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13526 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:06:21,734 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:06:21,734 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:06:21,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:06:21,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:06:21,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:06:21,735 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:06:21,735 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:06:21,735 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:06:21,784 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:06:21,785 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:21,785 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:06:21,785 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:06:21,786 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:06:21,786 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:21,786 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:06:21,786 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:06:21,786 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:21,787 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:21,819 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:06:21,820 INFO L131 PetriNetUnfolder]: For 3122/3262 co-relation queries the response was YES. [2022-12-06 00:06:21,821 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3122/3262 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2979 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:06:21,824 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:21,824 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:06:21,999 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:06:21,999 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 213 [2022-12-06 00:06:21,999 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:06:22,000 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:06:22,000 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:06:22,000 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:06:22,000 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable506 [2022-12-06 00:06:22,000 INFO L420 AbstractCegarLoop]: === Iteration 508 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:06:22,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:06:22,000 INFO L85 PathProgramCache]: Analyzing trace with hash -927012671, now seen corresponding path program 1 times [2022-12-06 00:06:22,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:06:22,000 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401806723] [2022-12-06 00:06:22,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:06:22,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:06:22,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:06:22,111 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-06 00:06:22,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:06:22,112 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401806723] [2022-12-06 00:06:22,112 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1401806723] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:06:22,112 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:06:22,112 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:06:22,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915708418] [2022-12-06 00:06:22,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:06:22,112 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:06:22,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:06:22,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:06:22,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:06:22,113 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:06:22,113 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:06:22,113 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:06:22,113 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:06:22,113 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:06:22,489 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:06:22,489 INFO L131 PetriNetUnfolder]: For 26955/27000 co-relation queries the response was YES. [2022-12-06 00:06:22,497 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26955/27000 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13503 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:06:22,507 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:06:22,507 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:06:22,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:06:22,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:06:22,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:06:22,508 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:06:22,508 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:06:22,508 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:06:22,556 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:06:22,557 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:22,558 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:06:22,558 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:06:22,558 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:06:22,558 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:22,559 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:06:22,559 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:06:22,559 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:22,559 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:22,592 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:06:22,592 INFO L131 PetriNetUnfolder]: For 3122/3262 co-relation queries the response was YES. [2022-12-06 00:06:22,593 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3122/3262 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2972 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:06:22,596 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:22,596 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:06:22,806 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:06:22,806 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 248 [2022-12-06 00:06:22,806 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:06:22,806 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:06:22,806 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:06:22,807 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:06:22,807 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable507 [2022-12-06 00:06:22,807 INFO L420 AbstractCegarLoop]: === Iteration 509 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:06:22,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:06:22,807 INFO L85 PathProgramCache]: Analyzing trace with hash 815797664, now seen corresponding path program 1 times [2022-12-06 00:06:22,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:06:22,807 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467422509] [2022-12-06 00:06:22,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:06:22,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:06:22,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:06:22,905 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-06 00:06:22,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:06:22,905 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467422509] [2022-12-06 00:06:22,905 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1467422509] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:06:22,906 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:06:22,906 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:06:22,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542939825] [2022-12-06 00:06:22,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:06:22,906 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:06:22,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:06:22,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:06:22,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:06:22,907 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:06:22,907 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:06:22,907 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:06:22,907 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:06:22,907 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:06:23,338 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:06:23,338 INFO L131 PetriNetUnfolder]: For 27136/27181 co-relation queries the response was YES. [2022-12-06 00:06:23,344 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27136/27181 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13507 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:06:23,351 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:06:23,351 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:06:23,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:06:23,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:06:23,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:06:23,354 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:06:23,354 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:06:23,354 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:06:23,394 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:06:23,396 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:23,396 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:06:23,396 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:06:23,396 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:06:23,396 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:23,397 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:06:23,397 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:06:23,397 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:23,398 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:23,428 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:06:23,429 INFO L131 PetriNetUnfolder]: For 3169/3310 co-relation queries the response was YES. [2022-12-06 00:06:23,430 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3169/3310 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2998 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:06:23,432 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:23,432 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:06:23,623 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:06:23,624 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 228 [2022-12-06 00:06:23,624 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:06:23,624 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:06:23,624 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:06:23,624 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:06:23,624 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable508 [2022-12-06 00:06:23,624 INFO L420 AbstractCegarLoop]: === Iteration 510 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:06:23,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:06:23,625 INFO L85 PathProgramCache]: Analyzing trace with hash -1736359297, now seen corresponding path program 1 times [2022-12-06 00:06:23,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:06:23,625 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288992481] [2022-12-06 00:06:23,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:06:23,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:06:23,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:06:23,700 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-06 00:06:23,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:06:23,700 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288992481] [2022-12-06 00:06:23,700 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1288992481] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:06:23,700 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:06:23,700 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:06:23,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179370045] [2022-12-06 00:06:23,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:06:23,706 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:06:23,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:06:23,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:06:23,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:06:23,706 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:06:23,706 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:06:23,706 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:06:23,706 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:06:23,706 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:06:24,038 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:06:24,038 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 00:06:24,044 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13559 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:06:24,053 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:06:24,053 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:06:24,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:06:24,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:06:24,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:06:24,054 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:06:24,054 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:06:24,054 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:06:24,092 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:06:24,094 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:24,094 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:06:24,094 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:06:24,094 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:06:24,094 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:24,094 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:06:24,094 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:06:24,095 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:24,095 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:24,120 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:06:24,120 INFO L131 PetriNetUnfolder]: For 3298/3507 co-relation queries the response was YES. [2022-12-06 00:06:24,121 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3298/3507 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2997 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:06:24,123 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:24,123 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:06:24,275 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:06:24,276 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 182 [2022-12-06 00:06:24,276 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:06:24,276 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:06:24,276 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:06:24,276 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:06:24,276 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable509 [2022-12-06 00:06:24,276 INFO L420 AbstractCegarLoop]: === Iteration 511 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:06:24,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:06:24,276 INFO L85 PathProgramCache]: Analyzing trace with hash 6451038, now seen corresponding path program 1 times [2022-12-06 00:06:24,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:06:24,277 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100842740] [2022-12-06 00:06:24,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:06:24,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:06:24,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:06:24,382 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-06 00:06:24,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:06:24,382 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100842740] [2022-12-06 00:06:24,382 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2100842740] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:06:24,382 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:06:24,382 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:06:24,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453531020] [2022-12-06 00:06:24,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:06:24,383 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:06:24,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:06:24,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:06:24,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:06:24,383 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:06:24,383 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:06:24,383 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:06:24,383 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:06:24,383 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:06:24,739 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:06:24,740 INFO L131 PetriNetUnfolder]: For 26955/27000 co-relation queries the response was YES. [2022-12-06 00:06:24,747 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26955/27000 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13531 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:06:24,757 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:06:24,758 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:06:24,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:06:24,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:06:24,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:06:24,759 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:06:24,759 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:06:24,759 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:06:24,809 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:06:24,810 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:24,810 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:06:24,811 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:06:24,811 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:06:24,811 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:24,811 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:06:24,811 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:06:24,816 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:24,819 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:24,851 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:06:24,851 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 00:06:24,852 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3133/3273 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2971 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:06:24,855 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:24,855 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:06:25,046 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:06:25,047 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 236 [2022-12-06 00:06:25,047 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:06:25,047 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:06:25,047 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:06:25,047 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:06:25,047 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable510 [2022-12-06 00:06:25,048 INFO L420 AbstractCegarLoop]: === Iteration 512 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:06:25,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:06:25,048 INFO L85 PathProgramCache]: Analyzing trace with hash 1749261373, now seen corresponding path program 1 times [2022-12-06 00:06:25,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:06:25,048 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562760855] [2022-12-06 00:06:25,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:06:25,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:06:25,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:06:25,123 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-06 00:06:25,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:06:25,124 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562760855] [2022-12-06 00:06:25,124 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1562760855] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:06:25,124 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:06:25,124 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:06:25,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724426903] [2022-12-06 00:06:25,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:06:25,124 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:06:25,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:06:25,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:06:25,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:06:25,125 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:06:25,125 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:06:25,125 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:06:25,125 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:06:25,125 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:06:25,471 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:06:25,471 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:06:25,479 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13569 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:06:25,489 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:06:25,490 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:06:25,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:06:25,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:06:25,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:06:25,491 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:06:25,492 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:06:25,492 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:06:25,537 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:06:25,539 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:25,539 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:06:25,539 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:06:25,543 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:06:25,544 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:25,544 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:06:25,544 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:06:25,545 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:25,545 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:25,576 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:06:25,577 INFO L131 PetriNetUnfolder]: For 3301/3509 co-relation queries the response was YES. [2022-12-06 00:06:25,578 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3301/3509 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2994 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:06:25,581 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:25,581 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:06:25,792 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:06:25,793 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 251 [2022-12-06 00:06:25,793 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:06:25,793 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:06:25,793 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:06:25,793 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:06:25,793 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable511 [2022-12-06 00:06:25,794 INFO L420 AbstractCegarLoop]: === Iteration 513 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:06:25,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:06:25,794 INFO L85 PathProgramCache]: Analyzing trace with hash -802895588, now seen corresponding path program 1 times [2022-12-06 00:06:25,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:06:25,794 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216758434] [2022-12-06 00:06:25,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:06:25,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:06:25,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:06:25,896 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-06 00:06:25,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:06:25,896 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216758434] [2022-12-06 00:06:25,896 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1216758434] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:06:25,896 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:06:25,896 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:06:25,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596168185] [2022-12-06 00:06:25,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:06:25,897 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:06:25,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:06:25,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:06:25,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:06:25,897 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:06:25,897 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:06:25,898 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:06:25,898 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:06:25,898 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:06:26,267 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:06:26,267 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 00:06:26,275 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26969/27014 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13533 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:06:26,286 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:06:26,286 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:06:26,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:06:26,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:06:26,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:06:26,287 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:06:26,287 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:06:26,287 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:06:26,328 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:06:26,329 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:26,330 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:06:26,330 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:06:26,330 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:06:26,330 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:26,330 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:06:26,330 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:06:26,331 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:26,331 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:26,360 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:06:26,361 INFO L131 PetriNetUnfolder]: For 3146/3287 co-relation queries the response was YES. [2022-12-06 00:06:26,362 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3146/3287 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2989 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:06:26,364 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:26,364 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:06:26,524 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:06:26,527 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 197 [2022-12-06 00:06:26,527 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:06:26,527 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:06:26,527 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:06:26,528 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:06:26,528 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable512 [2022-12-06 00:06:26,528 INFO L420 AbstractCegarLoop]: === Iteration 514 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:06:26,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:06:26,528 INFO L85 PathProgramCache]: Analyzing trace with hash 939914747, now seen corresponding path program 1 times [2022-12-06 00:06:26,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:06:26,528 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742101812] [2022-12-06 00:06:26,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:06:26,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:06:26,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:06:26,614 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:06:26,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:06:26,614 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742101812] [2022-12-06 00:06:26,614 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [742101812] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:06:26,614 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:06:26,614 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:06:26,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708801716] [2022-12-06 00:06:26,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:06:26,615 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:06:26,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:06:26,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:06:26,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:06:26,615 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:06:26,615 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:06:26,615 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:06:26,615 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:06:26,615 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:06:26,949 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:06:26,950 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:06:26,955 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13580 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:06:26,963 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:06:26,963 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:06:26,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:06:26,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:06:26,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:06:26,964 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:06:26,964 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:06:26,964 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:06:27,006 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:06:27,007 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:27,008 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:06:27,008 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:06:27,008 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:06:27,008 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:27,009 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:06:27,009 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:06:27,009 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:27,009 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:27,056 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:06:27,056 INFO L131 PetriNetUnfolder]: For 3298/3507 co-relation queries the response was YES. [2022-12-06 00:06:27,058 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3298/3507 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2985 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:06:27,060 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:27,060 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:06:27,257 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:06:27,257 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 249 [2022-12-06 00:06:27,257 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:06:27,258 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:06:27,258 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:06:27,258 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:06:27,258 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable513 [2022-12-06 00:06:27,258 INFO L420 AbstractCegarLoop]: === Iteration 515 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:06:27,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:06:27,258 INFO L85 PathProgramCache]: Analyzing trace with hash -1612242214, now seen corresponding path program 1 times [2022-12-06 00:06:27,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:06:27,258 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027621352] [2022-12-06 00:06:27,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:06:27,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:06:27,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:06:27,335 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-06 00:06:27,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:06:27,336 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027621352] [2022-12-06 00:06:27,336 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1027621352] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:06:27,336 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:06:27,336 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:06:27,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860469616] [2022-12-06 00:06:27,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:06:27,336 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:06:27,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:06:27,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:06:27,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:06:27,337 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:06:27,337 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:06:27,337 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:06:27,337 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:06:27,337 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:06:27,631 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:06:27,631 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 00:06:27,639 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13564 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:06:27,649 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:06:27,649 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:06:27,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:06:27,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:06:27,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:06:27,650 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:06:27,650 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:06:27,650 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:06:27,691 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:06:27,693 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:27,693 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:06:27,693 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:06:27,693 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:06:27,693 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:27,694 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:06:27,694 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:06:27,694 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:27,695 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:27,728 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:06:27,728 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 00:06:27,729 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3312/3520 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2984 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:06:27,731 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:27,731 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:06:27,885 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:06:27,886 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 193 [2022-12-06 00:06:27,886 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:06:27,886 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:06:27,886 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:06:27,886 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:06:27,886 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable514 [2022-12-06 00:06:27,886 INFO L420 AbstractCegarLoop]: === Iteration 516 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:06:27,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:06:27,886 INFO L85 PathProgramCache]: Analyzing trace with hash 130568121, now seen corresponding path program 1 times [2022-12-06 00:06:27,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:06:27,886 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995880537] [2022-12-06 00:06:27,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:06:27,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:06:27,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:06:27,944 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-06 00:06:27,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:06:27,944 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995880537] [2022-12-06 00:06:27,944 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [995880537] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:06:27,944 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:06:27,944 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:06:27,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391976342] [2022-12-06 00:06:27,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:06:27,944 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:06:27,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:06:27,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:06:27,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:06:27,945 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:06:27,945 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:06:27,945 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:06:27,945 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:06:27,945 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:06:28,302 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:06:28,302 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:06:28,310 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13551 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:06:28,320 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:06:28,320 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:06:28,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:06:28,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:06:28,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:06:28,321 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:06:28,321 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:06:28,321 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:06:28,369 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:06:28,370 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:28,370 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:06:28,371 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:06:28,371 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:06:28,371 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:28,371 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:06:28,371 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:06:28,372 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:28,372 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:28,403 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:06:28,403 INFO L131 PetriNetUnfolder]: For 3310/3519 co-relation queries the response was YES. [2022-12-06 00:06:28,405 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3310/3519 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2973 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:06:28,407 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:28,408 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:06:28,586 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:06:28,586 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 215 [2022-12-06 00:06:28,587 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:06:28,587 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:06:28,587 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:06:28,587 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:06:28,587 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable515 [2022-12-06 00:06:28,587 INFO L420 AbstractCegarLoop]: === Iteration 517 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:06:28,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:06:28,587 INFO L85 PathProgramCache]: Analyzing trace with hash 1873378456, now seen corresponding path program 1 times [2022-12-06 00:06:28,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:06:28,588 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897985903] [2022-12-06 00:06:28,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:06:28,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:06:28,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:06:28,659 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-06 00:06:28,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:06:28,659 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897985903] [2022-12-06 00:06:28,659 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1897985903] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:06:28,660 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:06:28,660 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:06:28,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255947607] [2022-12-06 00:06:28,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:06:28,660 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:06:28,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:06:28,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:06:28,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:06:28,660 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:06:28,660 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:06:28,660 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:06:28,660 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:06:28,660 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:06:28,966 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:06:28,966 INFO L131 PetriNetUnfolder]: For 26955/27000 co-relation queries the response was YES. [2022-12-06 00:06:28,973 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26955/27000 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13534 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:06:28,982 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:06:28,982 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:06:28,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:06:28,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:06:28,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:06:28,983 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:06:28,983 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:06:28,983 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:06:29,017 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:06:29,018 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:29,019 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:06:29,019 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:06:29,019 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:06:29,019 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:29,019 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:06:29,019 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:06:29,020 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:29,020 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:29,046 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:06:29,046 INFO L131 PetriNetUnfolder]: For 3151/3294 co-relation queries the response was YES. [2022-12-06 00:06:29,047 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3151/3294 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2974 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:06:29,049 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:29,049 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:06:29,210 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:06:29,210 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 191 [2022-12-06 00:06:29,211 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:06:29,211 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:06:29,211 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:06:29,211 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:06:29,211 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable516 [2022-12-06 00:06:29,211 INFO L420 AbstractCegarLoop]: === Iteration 518 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:06:29,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:06:29,211 INFO L85 PathProgramCache]: Analyzing trace with hash -678778505, now seen corresponding path program 1 times [2022-12-06 00:06:29,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:06:29,211 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109243904] [2022-12-06 00:06:29,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:06:29,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:06:29,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:06:29,286 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-06 00:06:29,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:06:29,287 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109243904] [2022-12-06 00:06:29,287 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [109243904] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:06:29,287 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:06:29,287 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:06:29,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107462371] [2022-12-06 00:06:29,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:06:29,287 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:06:29,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:06:29,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:06:29,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:06:29,287 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:06:29,287 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:06:29,288 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:06:29,288 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:06:29,288 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:06:29,597 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:06:29,597 INFO L131 PetriNetUnfolder]: For 27146/27191 co-relation queries the response was YES. [2022-12-06 00:06:29,605 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27146/27191 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13526 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:06:29,615 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:06:29,615 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:06:29,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:06:29,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:06:29,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:06:29,616 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:06:29,616 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:06:29,616 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:06:29,655 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:06:29,657 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:29,657 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:06:29,657 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:06:29,657 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:06:29,657 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:29,658 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:06:29,658 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:06:29,658 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:29,658 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:29,685 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:06:29,685 INFO L131 PetriNetUnfolder]: For 3167/3307 co-relation queries the response was YES. [2022-12-06 00:06:29,686 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3167/3307 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2996 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:06:29,688 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:29,688 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:06:29,846 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:06:29,847 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 190 [2022-12-06 00:06:29,847 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:06:29,847 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:06:29,847 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:06:29,847 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:06:29,847 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable517 [2022-12-06 00:06:29,847 INFO L420 AbstractCegarLoop]: === Iteration 519 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:06:29,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:06:29,848 INFO L85 PathProgramCache]: Analyzing trace with hash 1064031830, now seen corresponding path program 1 times [2022-12-06 00:06:29,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:06:29,848 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459512605] [2022-12-06 00:06:29,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:06:29,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:06:29,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:06:29,909 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-06 00:06:29,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:06:29,909 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459512605] [2022-12-06 00:06:29,909 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [459512605] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:06:29,909 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:06:29,909 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:06:29,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443170972] [2022-12-06 00:06:29,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:06:29,909 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:06:29,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:06:29,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:06:29,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:06:29,910 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:06:29,910 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:06:29,910 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:06:29,910 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:06:29,910 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:06:30,219 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:06:30,219 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:06:30,225 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13558 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:06:30,234 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:06:30,234 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:06:30,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:06:30,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:06:30,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:06:30,235 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:06:30,235 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:06:30,235 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:06:30,271 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:06:30,273 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:30,273 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:06:30,273 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:06:30,273 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:06:30,273 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:30,274 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:06:30,274 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:06:30,274 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:30,274 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:30,299 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:06:30,299 INFO L131 PetriNetUnfolder]: For 3310/3519 co-relation queries the response was YES. [2022-12-06 00:06:30,300 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3310/3519 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2979 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:06:30,302 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:30,303 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:06:30,468 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:06:30,469 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 196 [2022-12-06 00:06:30,469 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:06:30,469 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:06:30,469 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:06:30,469 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:06:30,469 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable518 [2022-12-06 00:06:30,469 INFO L420 AbstractCegarLoop]: === Iteration 520 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:06:30,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:06:30,469 INFO L85 PathProgramCache]: Analyzing trace with hash -1488125131, now seen corresponding path program 1 times [2022-12-06 00:06:30,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:06:30,470 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120329011] [2022-12-06 00:06:30,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:06:30,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:06:30,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:06:30,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-06 00:06:30,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:06:30,536 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120329011] [2022-12-06 00:06:30,536 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1120329011] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:06:30,536 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:06:30,536 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:06:30,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701328264] [2022-12-06 00:06:30,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:06:30,536 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:06:30,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:06:30,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:06:30,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:06:30,537 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:06:30,537 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:06:30,537 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:06:30,537 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:06:30,537 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:06:30,842 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:06:30,842 INFO L131 PetriNetUnfolder]: For 26955/27000 co-relation queries the response was YES. [2022-12-06 00:06:30,848 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26955/27000 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13564 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:06:30,856 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:06:30,856 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:06:30,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:06:30,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:06:30,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:06:30,857 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:06:30,857 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:06:30,857 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:06:30,894 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:06:30,895 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:30,896 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:06:30,896 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:06:30,896 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:06:30,896 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:30,896 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:06:30,896 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:06:30,896 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:30,897 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:30,922 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:06:30,922 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 00:06:30,923 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3133/3273 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2955 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:06:30,925 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:30,926 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:06:31,078 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:06:31,078 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 182 [2022-12-06 00:06:31,078 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:06:31,078 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:06:31,079 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:06:31,079 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:06:31,079 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable519 [2022-12-06 00:06:31,079 INFO L420 AbstractCegarLoop]: === Iteration 521 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:06:31,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:06:31,079 INFO L85 PathProgramCache]: Analyzing trace with hash 254685204, now seen corresponding path program 1 times [2022-12-06 00:06:31,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:06:31,079 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648855726] [2022-12-06 00:06:31,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:06:31,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:06:31,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:06:31,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:06:31,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:06:31,150 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648855726] [2022-12-06 00:06:31,150 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [648855726] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:06:31,150 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:06:31,150 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:06:31,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232377588] [2022-12-06 00:06:31,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:06:31,150 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:06:31,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:06:31,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:06:31,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:06:31,151 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:06:31,151 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:06:31,151 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:06:31,151 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:06:31,151 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:06:31,449 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:06:31,450 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 00:06:31,455 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26965/27010 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13526 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:06:31,464 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:06:31,464 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:06:31,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:06:31,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:06:31,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:06:31,465 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:06:31,465 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:06:31,465 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:06:31,506 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:06:31,507 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:31,507 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:06:31,507 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:06:31,507 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:06:31,507 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:31,508 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:06:31,508 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:06:31,508 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:31,508 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:31,537 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:06:31,537 INFO L131 PetriNetUnfolder]: For 3151/3294 co-relation queries the response was YES. [2022-12-06 00:06:31,539 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3151/3294 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2972 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:06:31,542 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:31,542 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:06:31,686 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:06:31,687 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 180 [2022-12-06 00:06:31,687 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:06:31,687 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:06:31,687 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:06:31,687 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:06:31,687 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable520 [2022-12-06 00:06:31,687 INFO L420 AbstractCegarLoop]: === Iteration 522 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:06:31,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:06:31,688 INFO L85 PathProgramCache]: Analyzing trace with hash 1997495539, now seen corresponding path program 1 times [2022-12-06 00:06:31,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:06:31,688 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640643290] [2022-12-06 00:06:31,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:06:31,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:06:31,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:06:31,764 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-06 00:06:31,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:06:31,764 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640643290] [2022-12-06 00:06:31,764 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [640643290] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:06:31,764 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:06:31,764 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:06:31,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51137282] [2022-12-06 00:06:31,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:06:31,764 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:06:31,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:06:31,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:06:31,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:06:31,765 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:06:31,765 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:06:31,765 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:06:31,765 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:06:31,765 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:06:32,185 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:06:32,185 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 00:06:32,191 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26969/27014 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13523 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:06:32,199 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:06:32,199 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:06:32,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:06:32,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:06:32,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:06:32,200 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:06:32,200 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:06:32,200 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:06:32,242 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:06:32,243 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:32,243 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:06:32,244 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:06:32,244 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:06:32,244 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:32,244 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:06:32,244 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:06:32,245 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:32,245 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:32,276 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:06:32,276 INFO L131 PetriNetUnfolder]: For 3122/3262 co-relation queries the response was YES. [2022-12-06 00:06:32,278 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3122/3262 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2986 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:06:32,281 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:32,281 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:06:32,454 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:06:32,454 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 210 [2022-12-06 00:06:32,455 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:06:32,455 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:06:32,455 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:06:32,455 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:06:32,455 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable521 [2022-12-06 00:06:32,455 INFO L420 AbstractCegarLoop]: === Iteration 523 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:06:32,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:06:32,455 INFO L85 PathProgramCache]: Analyzing trace with hash -554661422, now seen corresponding path program 1 times [2022-12-06 00:06:32,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:06:32,455 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056534890] [2022-12-06 00:06:32,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:06:32,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:06:32,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:06:32,540 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-06 00:06:32,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:06:32,540 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056534890] [2022-12-06 00:06:32,540 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1056534890] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:06:32,540 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:06:32,540 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:06:32,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438920388] [2022-12-06 00:06:32,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:06:32,541 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:06:32,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:06:32,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:06:32,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:06:32,541 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:06:32,541 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:06:32,541 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:06:32,541 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:06:32,541 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:06:32,902 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:06:32,903 INFO L131 PetriNetUnfolder]: For 27136/27181 co-relation queries the response was YES. [2022-12-06 00:06:32,910 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27136/27181 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13532 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:06:32,920 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:06:32,920 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:06:32,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:06:32,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:06:32,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:06:32,921 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:06:32,921 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:06:32,921 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:06:32,968 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:06:32,970 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:32,970 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:06:32,970 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:06:32,970 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:06:32,970 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:32,971 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:06:32,971 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:06:32,971 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:32,971 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:33,002 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:06:33,002 INFO L131 PetriNetUnfolder]: For 3167/3307 co-relation queries the response was YES. [2022-12-06 00:06:33,004 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3167/3307 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2982 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:06:33,006 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:33,006 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:06:33,185 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:06:33,186 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 216 [2022-12-06 00:06:33,186 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:06:33,186 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:06:33,186 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:06:33,186 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:06:33,186 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable522 [2022-12-06 00:06:33,186 INFO L420 AbstractCegarLoop]: === Iteration 524 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:06:33,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:06:33,186 INFO L85 PathProgramCache]: Analyzing trace with hash 1188148913, now seen corresponding path program 1 times [2022-12-06 00:06:33,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:06:33,187 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646612388] [2022-12-06 00:06:33,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:06:33,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:06:33,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:06:33,304 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-06 00:06:33,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:06:33,304 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646612388] [2022-12-06 00:06:33,304 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1646612388] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:06:33,304 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:06:33,304 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:06:33,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621239533] [2022-12-06 00:06:33,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:06:33,304 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:06:33,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:06:33,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:06:33,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:06:33,305 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:06:33,305 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:06:33,305 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:06:33,305 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:06:33,305 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:06:33,655 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:06:33,655 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:06:33,663 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13567 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:06:33,673 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:06:33,673 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:06:33,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:06:33,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:06:33,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:06:33,674 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:06:33,674 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:06:33,687 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:06:33,745 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:06:33,746 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:33,746 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:06:33,747 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:06:33,747 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:06:33,747 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:33,747 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:06:33,748 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:06:33,748 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:33,748 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:33,781 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:06:33,781 INFO L131 PetriNetUnfolder]: For 3301/3509 co-relation queries the response was YES. [2022-12-06 00:06:33,782 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3301/3509 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2982 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:06:33,785 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:33,785 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:06:33,963 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:06:33,964 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 217 [2022-12-06 00:06:33,964 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:06:33,964 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:06:33,964 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:06:33,964 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:06:33,964 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable523 [2022-12-06 00:06:33,964 INFO L420 AbstractCegarLoop]: === Iteration 525 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:06:33,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:06:33,965 INFO L85 PathProgramCache]: Analyzing trace with hash -1364008048, now seen corresponding path program 1 times [2022-12-06 00:06:33,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:06:33,965 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307532374] [2022-12-06 00:06:33,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:06:33,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:06:33,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:06:34,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-06 00:06:34,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:06:34,036 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307532374] [2022-12-06 00:06:34,036 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1307532374] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:06:34,036 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:06:34,037 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:06:34,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572747613] [2022-12-06 00:06:34,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:06:34,037 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:06:34,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:06:34,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:06:34,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:06:34,037 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:06:34,037 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:06:34,037 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:06:34,037 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:06:34,038 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:06:34,408 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:06:34,409 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:06:34,416 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13572 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:06:34,426 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:06:34,427 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:06:34,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:06:34,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:06:34,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:06:34,427 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:06:34,427 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:06:34,428 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:06:34,479 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:06:34,481 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:34,481 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:06:34,481 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:06:34,481 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:06:34,481 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:34,482 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:06:34,482 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:06:34,482 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:34,483 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:34,514 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:06:34,515 INFO L131 PetriNetUnfolder]: For 3348/3558 co-relation queries the response was YES. [2022-12-06 00:06:34,516 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3348/3558 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2995 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:06:34,519 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:34,519 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:06:34,705 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:06:34,706 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 225 [2022-12-06 00:06:34,706 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:06:34,706 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:06:34,706 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:06:34,706 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:06:34,706 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable524 [2022-12-06 00:06:34,706 INFO L420 AbstractCegarLoop]: === Iteration 526 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:06:34,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:06:34,706 INFO L85 PathProgramCache]: Analyzing trace with hash 378802287, now seen corresponding path program 1 times [2022-12-06 00:06:34,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:06:34,706 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417316416] [2022-12-06 00:06:34,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:06:34,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:06:34,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:06:34,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-06 00:06:34,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:06:34,782 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417316416] [2022-12-06 00:06:34,782 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1417316416] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:06:34,782 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:06:34,782 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:06:34,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189549408] [2022-12-06 00:06:34,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:06:34,782 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:06:34,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:06:34,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:06:34,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:06:34,783 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:06:34,783 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:06:34,783 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:06:34,783 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:06:34,783 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:06:35,100 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:06:35,100 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:06:35,113 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13560 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:06:35,123 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:06:35,123 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:06:35,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:06:35,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:06:35,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:06:35,124 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:06:35,124 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:06:35,124 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:06:35,173 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:06:35,175 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:35,175 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:06:35,175 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:06:35,175 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:06:35,175 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:35,176 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:06:35,176 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:06:35,176 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:35,177 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:35,209 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:06:35,209 INFO L131 PetriNetUnfolder]: For 3299/3508 co-relation queries the response was YES. [2022-12-06 00:06:35,210 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3299/3508 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2991 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:06:35,213 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:35,213 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:06:35,381 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:06:35,381 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 206 [2022-12-06 00:06:35,381 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:06:35,381 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:06:35,382 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:06:35,382 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:06:35,382 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable525 [2022-12-06 00:06:35,382 INFO L420 AbstractCegarLoop]: === Iteration 527 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:06:35,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:06:35,382 INFO L85 PathProgramCache]: Analyzing trace with hash 2121612622, now seen corresponding path program 1 times [2022-12-06 00:06:35,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:06:35,382 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686057740] [2022-12-06 00:06:35,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:06:35,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:06:35,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:06:35,457 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-06 00:06:35,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:06:35,457 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686057740] [2022-12-06 00:06:35,457 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1686057740] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:06:35,457 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:06:35,457 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:06:35,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690944813] [2022-12-06 00:06:35,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:06:35,458 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:06:35,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:06:35,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:06:35,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:06:35,458 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:06:35,458 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:06:35,458 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:06:35,458 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:06:35,459 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:06:35,827 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:06:35,827 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 00:06:35,835 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26969/27014 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13536 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:06:35,844 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:06:35,844 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:06:35,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:06:35,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:06:35,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:06:35,845 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:06:35,845 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:06:35,845 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:06:35,888 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:06:35,942 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:35,942 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:06:35,942 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:06:35,943 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:06:35,943 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:35,943 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:06:35,943 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:06:35,943 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:35,944 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:35,974 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:06:35,974 INFO L131 PetriNetUnfolder]: For 3134/3275 co-relation queries the response was YES. [2022-12-06 00:06:35,976 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3134/3275 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2972 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:06:35,978 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:35,978 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:06:36,157 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:06:36,158 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 215 [2022-12-06 00:06:36,158 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:06:36,158 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:06:36,158 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:06:36,158 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:06:36,158 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable526 [2022-12-06 00:06:36,158 INFO L420 AbstractCegarLoop]: === Iteration 528 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:06:36,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:06:36,159 INFO L85 PathProgramCache]: Analyzing trace with hash -430544339, now seen corresponding path program 1 times [2022-12-06 00:06:36,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:06:36,159 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987386263] [2022-12-06 00:06:36,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:06:36,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:06:36,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:06:36,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-06 00:06:36,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:06:36,308 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987386263] [2022-12-06 00:06:36,308 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1987386263] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:06:36,308 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:06:36,308 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:06:36,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409159695] [2022-12-06 00:06:36,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:06:36,308 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:06:36,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:06:36,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:06:36,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:06:36,309 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:06:36,309 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:06:36,309 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:06:36,309 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:06:36,309 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:06:36,621 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:06:36,621 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 00:06:36,627 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26965/27010 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13518 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:06:36,635 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:06:36,635 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:06:36,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:06:36,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:06:36,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:06:36,636 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:06:36,636 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:06:36,636 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:06:36,673 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:06:36,674 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:36,675 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:06:36,675 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:06:36,675 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:06:36,675 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:36,675 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:06:36,675 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:06:36,675 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:36,676 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:36,701 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:06:36,702 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 00:06:36,703 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3133/3273 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2986 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:06:36,705 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:36,705 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:06:36,857 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:06:36,857 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 182 [2022-12-06 00:06:36,857 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:06:36,857 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:06:36,858 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:06:36,858 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:06:36,858 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable527 [2022-12-06 00:06:36,858 INFO L420 AbstractCegarLoop]: === Iteration 529 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:06:36,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:06:36,858 INFO L85 PathProgramCache]: Analyzing trace with hash 1312265996, now seen corresponding path program 1 times [2022-12-06 00:06:36,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:06:36,858 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007013915] [2022-12-06 00:06:36,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:06:36,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:06:36,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:06:36,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-06 00:06:36,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:06:36,926 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007013915] [2022-12-06 00:06:36,926 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1007013915] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:06:36,926 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:06:36,926 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:06:36,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066252766] [2022-12-06 00:06:36,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:06:36,927 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:06:36,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:06:36,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:06:36,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:06:36,927 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:06:36,927 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:06:36,927 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:06:36,927 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:06:36,927 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:06:37,231 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:06:37,231 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:06:37,237 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13556 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:06:37,245 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:06:37,245 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:06:37,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:06:37,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:06:37,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:06:37,245 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:06:37,245 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:06:37,246 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:06:37,280 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:06:37,281 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:37,282 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:06:37,282 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:06:37,282 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:06:37,282 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:37,282 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:06:37,282 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:06:37,282 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:37,283 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:37,307 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:06:37,307 INFO L131 PetriNetUnfolder]: For 3348/3558 co-relation queries the response was YES. [2022-12-06 00:06:37,308 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3348/3558 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2982 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:06:37,310 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:37,310 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:06:37,469 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:06:37,469 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 187 [2022-12-06 00:06:37,469 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:06:37,469 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:06:37,469 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:06:37,469 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:06:37,469 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable528 [2022-12-06 00:06:37,469 INFO L420 AbstractCegarLoop]: === Iteration 530 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:06:37,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:06:37,470 INFO L85 PathProgramCache]: Analyzing trace with hash -1239890965, now seen corresponding path program 1 times [2022-12-06 00:06:37,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:06:37,470 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104334711] [2022-12-06 00:06:37,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:06:37,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:06:37,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:06:37,540 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-06 00:06:37,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:06:37,540 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104334711] [2022-12-06 00:06:37,541 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2104334711] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:06:37,541 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:06:37,541 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:06:37,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7233739] [2022-12-06 00:06:37,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:06:37,541 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:06:37,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:06:37,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:06:37,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:06:37,541 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:06:37,541 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:06:37,541 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:06:37,541 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:06:37,541 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:06:37,824 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:06:37,824 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:06:37,829 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13559 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:06:37,836 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:06:37,837 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:06:37,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:06:37,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:06:37,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:06:37,837 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:06:37,837 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:06:37,837 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:06:37,871 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:06:37,873 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:37,873 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:06:37,873 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:06:37,873 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:06:37,873 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:37,873 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:06:37,873 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:06:37,874 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:37,874 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:37,898 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:06:37,899 INFO L131 PetriNetUnfolder]: For 3304/3511 co-relation queries the response was YES. [2022-12-06 00:06:37,899 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3304/3511 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2992 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:06:37,901 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:37,901 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:06:38,046 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:06:38,046 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 173 [2022-12-06 00:06:38,046 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:06:38,047 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:06:38,047 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:06:38,047 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:06:38,047 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable529 [2022-12-06 00:06:38,047 INFO L420 AbstractCegarLoop]: === Iteration 531 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:06:38,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:06:38,047 INFO L85 PathProgramCache]: Analyzing trace with hash 502919370, now seen corresponding path program 1 times [2022-12-06 00:06:38,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:06:38,047 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877234245] [2022-12-06 00:06:38,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:06:38,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:06:38,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:06:38,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-06 00:06:38,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:06:38,113 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877234245] [2022-12-06 00:06:38,113 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [877234245] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:06:38,113 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:06:38,113 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:06:38,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004611026] [2022-12-06 00:06:38,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:06:38,113 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:06:38,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:06:38,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:06:38,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:06:38,114 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:06:38,114 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:06:38,114 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:06:38,114 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:06:38,114 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:06:38,403 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:06:38,404 INFO L131 PetriNetUnfolder]: For 27229/27274 co-relation queries the response was YES. [2022-12-06 00:06:38,409 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27229/27274 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13555 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:06:38,418 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:06:38,418 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:06:38,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:06:38,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:06:38,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:06:38,419 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:06:38,419 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:06:38,419 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:06:38,456 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:06:38,457 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:38,457 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:06:38,457 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:06:38,457 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:06:38,457 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:38,458 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:06:38,458 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:06:38,458 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:38,458 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:38,483 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:06:38,483 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 00:06:38,484 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3312/3520 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2975 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:06:38,486 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:38,486 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:06:38,636 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:06:38,636 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 179 [2022-12-06 00:06:38,636 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:06:38,636 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:06:38,636 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:06:38,636 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:06:38,636 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable530 [2022-12-06 00:06:38,636 INFO L420 AbstractCegarLoop]: === Iteration 532 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:06:38,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:06:38,637 INFO L85 PathProgramCache]: Analyzing trace with hash -2049237591, now seen corresponding path program 1 times [2022-12-06 00:06:38,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:06:38,637 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651354276] [2022-12-06 00:06:38,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:06:38,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:06:38,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:06:38,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-06 00:06:38,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:06:38,695 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651354276] [2022-12-06 00:06:38,695 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [651354276] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:06:38,695 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:06:38,695 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:06:38,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583784129] [2022-12-06 00:06:38,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:06:38,696 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:06:38,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:06:38,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:06:38,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:06:38,696 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:06:38,696 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:06:38,696 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:06:38,696 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:06:38,696 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:06:38,979 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:06:38,979 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:06:38,985 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13579 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:06:38,993 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:06:38,993 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:06:38,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:06:38,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:06:38,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:06:38,994 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:06:38,994 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:06:38,994 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:06:39,032 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:06:39,033 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:39,033 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:06:39,033 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:06:39,033 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:06:39,033 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:39,034 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:06:39,034 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:06:39,034 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:39,035 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:39,070 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:06:39,070 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 00:06:39,071 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3312/3520 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2990 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:06:39,073 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:39,073 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:06:39,223 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:06:39,223 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 190 [2022-12-06 00:06:39,224 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:06:39,224 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:06:39,224 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:06:39,224 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:06:39,224 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable531 [2022-12-06 00:06:39,224 INFO L420 AbstractCegarLoop]: === Iteration 533 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:06:39,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:06:39,224 INFO L85 PathProgramCache]: Analyzing trace with hash -306427256, now seen corresponding path program 1 times [2022-12-06 00:06:39,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:06:39,224 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122734587] [2022-12-06 00:06:39,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:06:39,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:06:39,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:06:39,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-06 00:06:39,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:06:39,295 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122734587] [2022-12-06 00:06:39,296 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1122734587] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:06:39,296 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:06:39,296 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:06:39,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726305705] [2022-12-06 00:06:39,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:06:39,296 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:06:39,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:06:39,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:06:39,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:06:39,296 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:06:39,297 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:06:39,297 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:06:39,297 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:06:39,297 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:06:39,581 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:06:39,581 INFO L131 PetriNetUnfolder]: For 27229/27274 co-relation queries the response was YES. [2022-12-06 00:06:39,587 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27229/27274 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13547 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:06:39,595 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:06:39,595 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:06:39,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:06:39,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:06:39,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:06:39,596 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:06:39,596 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:06:39,596 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:06:39,632 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:06:39,633 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:39,633 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:06:39,634 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:06:39,634 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:06:39,634 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:39,634 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:06:39,634 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:06:39,634 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:39,635 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:39,661 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:06:39,661 INFO L131 PetriNetUnfolder]: For 3348/3558 co-relation queries the response was YES. [2022-12-06 00:06:39,662 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3348/3558 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2971 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:06:39,664 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:39,664 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:06:39,812 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:06:39,812 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 178 [2022-12-06 00:06:39,812 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:06:39,812 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:06:39,812 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:06:39,812 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:06:39,812 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable532 [2022-12-06 00:06:39,812 INFO L420 AbstractCegarLoop]: === Iteration 534 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:06:39,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:06:39,813 INFO L85 PathProgramCache]: Analyzing trace with hash 1436383079, now seen corresponding path program 1 times [2022-12-06 00:06:39,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:06:39,813 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357361719] [2022-12-06 00:06:39,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:06:39,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:06:39,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:06:39,878 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-06 00:06:39,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:06:39,879 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357361719] [2022-12-06 00:06:39,879 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1357361719] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:06:39,879 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:06:39,879 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:06:39,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486927162] [2022-12-06 00:06:39,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:06:39,879 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:06:39,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:06:39,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:06:39,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:06:39,879 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:06:39,880 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:06:39,880 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:06:39,880 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:06:39,880 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:06:40,165 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:06:40,165 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:06:40,171 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13538 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:06:40,179 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:06:40,179 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:06:40,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:06:40,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:06:40,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:06:40,179 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:06:40,180 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:06:40,180 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:06:40,215 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:06:40,216 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:40,216 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:06:40,216 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:06:40,216 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:06:40,217 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:40,217 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:06:40,217 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:06:40,217 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:40,218 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:40,241 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:06:40,242 INFO L131 PetriNetUnfolder]: For 3293/3500 co-relation queries the response was YES. [2022-12-06 00:06:40,243 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3293/3500 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2979 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:06:40,244 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:40,245 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:06:40,381 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:06:40,382 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 166 [2022-12-06 00:06:40,382 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:06:40,382 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:06:40,382 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:06:40,382 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:06:40,382 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable533 [2022-12-06 00:06:40,382 INFO L420 AbstractCegarLoop]: === Iteration 535 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:06:40,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:06:40,383 INFO L85 PathProgramCache]: Analyzing trace with hash -1115773882, now seen corresponding path program 1 times [2022-12-06 00:06:40,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:06:40,383 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855692610] [2022-12-06 00:06:40,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:06:40,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:06:40,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:06:40,450 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-06 00:06:40,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:06:40,451 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855692610] [2022-12-06 00:06:40,451 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [855692610] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:06:40,451 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:06:40,451 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:06:40,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344927059] [2022-12-06 00:06:40,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:06:40,451 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:06:40,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:06:40,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:06:40,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:06:40,451 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:06:40,452 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:06:40,452 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:06:40,452 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:06:40,452 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:06:40,757 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:06:40,757 INFO L131 PetriNetUnfolder]: For 27136/27181 co-relation queries the response was YES. [2022-12-06 00:06:40,762 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27136/27181 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13518 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:06:40,769 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:06:40,769 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:06:40,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:06:40,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:06:40,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:06:40,770 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:06:40,770 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:06:40,770 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:06:40,800 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:06:40,801 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:40,801 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:06:40,801 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:06:40,801 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:06:40,802 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:40,802 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:06:40,802 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:06:40,802 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:40,803 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:40,826 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:06:40,827 INFO L131 PetriNetUnfolder]: For 3167/3307 co-relation queries the response was YES. [2022-12-06 00:06:40,828 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3167/3307 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2980 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:06:40,829 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:40,830 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:06:40,983 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:06:40,984 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 183 [2022-12-06 00:06:40,984 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:06:40,984 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:06:40,984 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:06:40,984 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:06:40,984 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable534 [2022-12-06 00:06:40,984 INFO L420 AbstractCegarLoop]: === Iteration 536 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:06:40,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:06:40,984 INFO L85 PathProgramCache]: Analyzing trace with hash 627036453, now seen corresponding path program 1 times [2022-12-06 00:06:40,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:06:40,985 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068911582] [2022-12-06 00:06:40,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:06:40,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:06:40,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:06:41,051 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-06 00:06:41,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:06:41,052 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068911582] [2022-12-06 00:06:41,052 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2068911582] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:06:41,052 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:06:41,052 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:06:41,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395039597] [2022-12-06 00:06:41,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:06:41,052 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:06:41,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:06:41,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:06:41,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:06:41,052 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:06:41,052 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:06:41,053 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:06:41,053 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:06:41,053 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:06:41,346 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:06:41,346 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:06:41,352 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13573 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:06:41,360 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:06:41,361 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:06:41,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:06:41,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:06:41,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:06:41,361 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:06:41,361 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:06:41,361 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:06:41,397 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:06:41,398 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:41,398 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:06:41,399 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:06:41,399 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:06:41,399 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:41,399 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:06:41,399 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:06:41,400 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:41,400 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:41,425 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:06:41,425 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 00:06:41,426 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3312/3520 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2986 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:06:41,428 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:41,428 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:06:41,569 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:06:41,569 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 170 [2022-12-06 00:06:41,569 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:06:41,569 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:06:41,569 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:06:41,569 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:06:41,569 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable535 [2022-12-06 00:06:41,569 INFO L420 AbstractCegarLoop]: === Iteration 537 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:06:41,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:06:41,570 INFO L85 PathProgramCache]: Analyzing trace with hash -1925120508, now seen corresponding path program 1 times [2022-12-06 00:06:41,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:06:41,570 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909619595] [2022-12-06 00:06:41,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:06:41,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:06:41,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:06:41,629 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-06 00:06:41,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:06:41,630 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909619595] [2022-12-06 00:06:41,630 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1909619595] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:06:41,630 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:06:41,630 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:06:41,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171881093] [2022-12-06 00:06:41,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:06:41,630 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:06:41,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:06:41,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:06:41,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:06:41,630 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:06:41,631 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:06:41,631 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:06:41,631 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:06:41,631 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:06:41,914 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:06:41,914 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:06:41,920 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13544 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:06:41,927 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:06:41,927 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:06:41,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:06:41,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:06:41,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:06:41,928 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:06:41,928 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:06:41,928 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:06:41,964 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:06:41,965 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:41,965 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:06:41,966 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:06:41,966 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:06:41,966 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:41,966 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:06:41,966 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:06:41,966 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:41,967 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:41,992 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:06:41,992 INFO L131 PetriNetUnfolder]: For 3348/3558 co-relation queries the response was YES. [2022-12-06 00:06:41,993 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3348/3558 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2983 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:06:41,995 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:41,995 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:06:42,139 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:06:42,139 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 173 [2022-12-06 00:06:42,139 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:06:42,140 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:06:42,140 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:06:42,140 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:06:42,140 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable536 [2022-12-06 00:06:42,140 INFO L420 AbstractCegarLoop]: === Iteration 538 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:06:42,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:06:42,140 INFO L85 PathProgramCache]: Analyzing trace with hash -182310173, now seen corresponding path program 1 times [2022-12-06 00:06:42,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:06:42,140 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000873739] [2022-12-06 00:06:42,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:06:42,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:06:42,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:06:42,217 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-06 00:06:42,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:06:42,218 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000873739] [2022-12-06 00:06:42,218 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2000873739] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:06:42,218 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:06:42,218 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:06:42,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753612252] [2022-12-06 00:06:42,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:06:42,218 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:06:42,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:06:42,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:06:42,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:06:42,218 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:06:42,218 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:06:42,218 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:06:42,218 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:06:42,218 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:06:42,492 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:06:42,492 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 00:06:42,497 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26969/27014 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13518 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:06:42,504 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:06:42,504 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:06:42,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:06:42,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:06:42,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:06:42,505 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:06:42,505 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:06:42,505 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:06:42,537 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:06:42,538 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:42,539 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:06:42,539 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:06:42,539 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:06:42,539 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:42,539 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:06:42,539 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:06:42,539 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:42,540 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:42,564 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:06:42,564 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 00:06:42,565 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3133/3273 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2985 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:06:42,566 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:42,566 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:06:42,712 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:06:42,713 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 174 [2022-12-06 00:06:42,713 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:06:42,713 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:06:42,713 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:06:42,713 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:06:42,713 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable537 [2022-12-06 00:06:42,713 INFO L420 AbstractCegarLoop]: === Iteration 539 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:06:42,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:06:42,713 INFO L85 PathProgramCache]: Analyzing trace with hash 1560500162, now seen corresponding path program 1 times [2022-12-06 00:06:42,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:06:42,713 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941079259] [2022-12-06 00:06:42,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:06:42,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:06:42,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:06:42,770 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-06 00:06:42,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:06:42,770 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941079259] [2022-12-06 00:06:42,770 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [941079259] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:06:42,770 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:06:42,770 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:06:42,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175932428] [2022-12-06 00:06:42,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:06:42,771 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:06:42,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:06:42,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:06:42,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:06:42,771 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:06:42,771 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:06:42,771 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:06:42,771 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:06:42,771 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:06:43,044 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:06:43,044 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:06:43,050 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13580 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:06:43,057 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:06:43,057 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:06:43,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:06:43,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:06:43,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:06:43,059 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:06:43,060 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:06:43,060 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:06:43,109 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:06:43,111 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:43,111 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:06:43,111 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:06:43,111 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:06:43,111 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:43,112 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:06:43,112 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:06:43,112 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:43,113 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:43,147 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:06:43,147 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 00:06:43,148 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3312/3520 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2979 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:06:43,151 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:43,151 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:06:43,300 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:06:43,301 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 190 [2022-12-06 00:06:43,301 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:06:43,301 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:06:43,301 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:06:43,301 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:06:43,301 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable538 [2022-12-06 00:06:43,301 INFO L420 AbstractCegarLoop]: === Iteration 540 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:06:43,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:06:43,301 INFO L85 PathProgramCache]: Analyzing trace with hash -991656799, now seen corresponding path program 1 times [2022-12-06 00:06:43,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:06:43,301 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121163219] [2022-12-06 00:06:43,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:06:43,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:06:43,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:06:43,370 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-06 00:06:43,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:06:43,370 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121163219] [2022-12-06 00:06:43,370 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2121163219] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:06:43,370 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:06:43,370 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:06:43,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918454949] [2022-12-06 00:06:43,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:06:43,371 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:06:43,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:06:43,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:06:43,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:06:43,371 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:06:43,371 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:06:43,371 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:06:43,371 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:06:43,371 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:06:43,684 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:06:43,685 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:06:43,690 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13569 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:06:43,697 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:06:43,697 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:06:43,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:06:43,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:06:43,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:06:43,697 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:06:43,698 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:06:43,698 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:06:43,727 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:06:43,728 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:43,728 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:06:43,728 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:06:43,729 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:06:43,729 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:43,729 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:06:43,729 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:06:43,729 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:43,730 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:43,754 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:06:43,754 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 00:06:43,755 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3312/3520 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2988 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:06:43,757 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:43,757 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:06:43,896 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:06:43,897 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 168 [2022-12-06 00:06:43,897 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:06:43,897 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:06:43,897 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:06:43,897 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:06:43,897 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable539 [2022-12-06 00:06:43,897 INFO L420 AbstractCegarLoop]: === Iteration 541 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:06:43,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:06:43,897 INFO L85 PathProgramCache]: Analyzing trace with hash 751153536, now seen corresponding path program 1 times [2022-12-06 00:06:43,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:06:43,897 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10168113] [2022-12-06 00:06:43,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:06:43,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:06:43,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:06:43,957 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-06 00:06:43,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:06:43,957 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10168113] [2022-12-06 00:06:43,957 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [10168113] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:06:43,957 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:06:43,957 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:06:43,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642909272] [2022-12-06 00:06:43,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:06:43,958 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:06:43,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:06:43,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:06:43,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:06:43,958 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:06:43,958 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:06:43,958 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:06:43,958 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:06:43,958 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:06:44,231 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:06:44,231 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:06:44,236 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13558 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:06:44,243 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:06:44,244 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:06:44,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:06:44,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:06:44,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:06:44,244 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:06:44,244 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:06:44,244 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:06:44,278 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:06:44,280 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:44,280 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:06:44,280 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:06:44,280 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:06:44,280 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:44,280 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:06:44,281 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:06:44,281 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:44,281 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:44,305 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:06:44,305 INFO L131 PetriNetUnfolder]: For 3348/3558 co-relation queries the response was YES. [2022-12-06 00:06:44,306 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3348/3558 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2991 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:06:44,308 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:44,308 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:06:44,460 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:06:44,460 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 180 [2022-12-06 00:06:44,460 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:06:44,460 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:06:44,460 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:06:44,460 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:06:44,460 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable540 [2022-12-06 00:06:44,460 INFO L420 AbstractCegarLoop]: === Iteration 542 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:06:44,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:06:44,461 INFO L85 PathProgramCache]: Analyzing trace with hash -1801003425, now seen corresponding path program 1 times [2022-12-06 00:06:44,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:06:44,461 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537368779] [2022-12-06 00:06:44,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:06:44,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:06:44,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:06:44,519 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-06 00:06:44,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:06:44,519 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537368779] [2022-12-06 00:06:44,519 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [537368779] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:06:44,519 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:06:44,519 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:06:44,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692316626] [2022-12-06 00:06:44,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:06:44,520 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:06:44,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:06:44,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:06:44,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:06:44,520 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:06:44,520 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:06:44,520 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:06:44,520 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:06:44,520 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:06:44,788 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:06:44,788 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:06:44,794 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13552 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:06:44,802 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:06:44,802 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:06:44,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:06:44,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:06:44,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:06:44,803 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:06:44,803 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:06:44,803 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:06:44,839 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:06:44,840 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:44,840 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:06:44,840 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:06:44,840 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:06:44,840 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:44,841 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:06:44,841 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:06:44,841 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:44,841 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:44,866 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:06:44,866 INFO L131 PetriNetUnfolder]: For 3293/3500 co-relation queries the response was YES. [2022-12-06 00:06:44,867 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3293/3500 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 3003 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:06:44,869 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:44,869 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:06:45,015 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:06:45,015 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 175 [2022-12-06 00:06:45,015 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:06:45,015 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:06:45,015 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:06:45,015 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:06:45,015 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable541 [2022-12-06 00:06:45,015 INFO L420 AbstractCegarLoop]: === Iteration 543 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:06:45,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:06:45,016 INFO L85 PathProgramCache]: Analyzing trace with hash -58193090, now seen corresponding path program 1 times [2022-12-06 00:06:45,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:06:45,016 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123612258] [2022-12-06 00:06:45,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:06:45,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:06:45,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:06:45,069 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-06 00:06:45,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:06:45,069 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123612258] [2022-12-06 00:06:45,069 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1123612258] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:06:45,069 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:06:45,070 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:06:45,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938964825] [2022-12-06 00:06:45,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:06:45,070 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:06:45,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:06:45,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:06:45,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:06:45,070 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:06:45,070 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:06:45,070 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:06:45,070 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:06:45,070 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:06:45,342 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:06:45,342 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:06:45,348 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13549 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:06:45,355 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:06:45,356 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:06:45,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:06:45,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:06:45,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:06:45,356 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:06:45,356 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:06:45,356 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:06:45,390 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:06:45,391 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:45,391 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:06:45,392 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:06:45,392 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:06:45,392 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:45,392 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:06:45,392 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:06:45,392 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:45,393 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:45,416 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:06:45,417 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 00:06:45,417 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3321/3530 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2984 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:06:45,419 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:45,419 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:06:45,572 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:06:45,573 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 181 [2022-12-06 00:06:45,573 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:06:45,573 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:06:45,573 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:06:45,573 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:06:45,573 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable542 [2022-12-06 00:06:45,573 INFO L420 AbstractCegarLoop]: === Iteration 544 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:06:45,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:06:45,573 INFO L85 PathProgramCache]: Analyzing trace with hash 1684617245, now seen corresponding path program 1 times [2022-12-06 00:06:45,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:06:45,573 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348306926] [2022-12-06 00:06:45,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:06:45,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:06:45,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:06:45,640 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-06 00:06:45,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:06:45,640 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348306926] [2022-12-06 00:06:45,640 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [348306926] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:06:45,640 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:06:45,640 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:06:45,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699113024] [2022-12-06 00:06:45,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:06:45,641 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:06:45,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:06:45,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:06:45,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:06:45,641 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:06:45,641 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:06:45,641 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:06:45,641 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:06:45,641 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:06:45,925 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:06:45,925 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:06:45,932 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13550 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:06:45,940 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:06:45,940 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:06:45,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:06:45,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:06:45,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:06:45,941 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:06:45,941 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:06:45,941 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:06:45,975 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:06:45,977 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:45,977 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:06:45,977 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:06:45,977 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:06:45,977 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:45,977 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:06:45,977 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:06:45,978 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:45,978 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:46,002 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:06:46,002 INFO L131 PetriNetUnfolder]: For 3301/3509 co-relation queries the response was YES. [2022-12-06 00:06:46,003 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3301/3509 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2983 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:06:46,005 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:46,005 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:06:46,154 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:06:46,155 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 178 [2022-12-06 00:06:46,155 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:06:46,155 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:06:46,155 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:06:46,155 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:06:46,155 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable543 [2022-12-06 00:06:46,155 INFO L420 AbstractCegarLoop]: === Iteration 545 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:06:46,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:06:46,155 INFO L85 PathProgramCache]: Analyzing trace with hash -867539716, now seen corresponding path program 1 times [2022-12-06 00:06:46,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:06:46,156 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603615603] [2022-12-06 00:06:46,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:06:46,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:06:46,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:06:46,220 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-06 00:06:46,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:06:46,221 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603615603] [2022-12-06 00:06:46,221 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1603615603] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:06:46,221 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:06:46,221 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:06:46,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26409305] [2022-12-06 00:06:46,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:06:46,221 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:06:46,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:06:46,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:06:46,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:06:46,221 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:06:46,222 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:06:46,222 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:06:46,222 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:06:46,222 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:06:46,493 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:06:46,493 INFO L131 PetriNetUnfolder]: For 27136/27181 co-relation queries the response was YES. [2022-12-06 00:06:46,498 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27136/27181 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13532 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:06:46,505 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:06:46,506 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:06:46,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:06:46,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:06:46,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:06:46,506 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:06:46,506 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:06:46,506 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:06:46,539 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:06:46,540 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:46,541 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:06:46,541 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:06:46,541 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:06:46,541 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:46,541 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:06:46,541 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:06:46,541 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:46,542 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:46,571 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:06:46,572 INFO L131 PetriNetUnfolder]: For 3180/3321 co-relation queries the response was YES. [2022-12-06 00:06:46,572 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3180/3321 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 3001 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:06:46,574 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:46,574 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:06:46,716 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:06:46,717 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 176 [2022-12-06 00:06:46,717 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:06:46,717 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:06:46,717 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:06:46,717 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:06:46,717 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable544 [2022-12-06 00:06:46,717 INFO L420 AbstractCegarLoop]: === Iteration 546 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:06:46,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:06:46,717 INFO L85 PathProgramCache]: Analyzing trace with hash 875270619, now seen corresponding path program 1 times [2022-12-06 00:06:46,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:06:46,718 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006347227] [2022-12-06 00:06:46,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:06:46,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:06:46,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:06:46,783 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-06 00:06:46,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:06:46,784 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006347227] [2022-12-06 00:06:46,784 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1006347227] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:06:46,784 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:06:46,784 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:06:46,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828974521] [2022-12-06 00:06:46,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:06:46,784 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:06:46,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:06:46,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:06:46,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:06:46,785 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:06:46,785 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:06:46,785 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:06:46,785 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:06:46,785 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:06:47,066 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:06:47,066 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:06:47,072 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13562 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:06:47,079 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:06:47,079 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:06:47,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:06:47,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:06:47,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:06:47,080 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:06:47,080 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:06:47,080 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:06:47,114 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:06:47,115 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:47,115 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:06:47,115 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:06:47,116 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:06:47,116 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:47,116 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:06:47,116 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:06:47,116 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:47,117 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:47,140 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:06:47,141 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 00:06:47,141 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3312/3520 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2990 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:06:47,143 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:47,143 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:06:47,289 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:06:47,290 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 174 [2022-12-06 00:06:47,290 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:06:47,290 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:06:47,290 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:06:47,290 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:06:47,290 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable545 [2022-12-06 00:06:47,290 INFO L420 AbstractCegarLoop]: === Iteration 547 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:06:47,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:06:47,290 INFO L85 PathProgramCache]: Analyzing trace with hash -1676886342, now seen corresponding path program 1 times [2022-12-06 00:06:47,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:06:47,290 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642261815] [2022-12-06 00:06:47,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:06:47,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:06:47,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:06:47,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-06 00:06:47,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:06:47,356 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642261815] [2022-12-06 00:06:47,356 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1642261815] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:06:47,357 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:06:47,357 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:06:47,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516559262] [2022-12-06 00:06:47,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:06:47,357 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:06:47,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:06:47,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:06:47,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:06:47,357 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:06:47,357 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:06:47,357 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:06:47,357 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:06:47,357 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:06:47,633 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:06:47,633 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:06:47,638 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13554 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:06:47,645 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:06:47,645 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:06:47,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:06:47,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:06:47,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:06:47,646 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:06:47,646 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:06:47,646 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:06:47,685 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:06:47,686 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:47,686 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:06:47,686 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:06:47,686 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:06:47,686 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:47,687 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:06:47,687 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:06:47,687 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:47,687 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:47,711 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:06:47,712 INFO L131 PetriNetUnfolder]: For 3318/3528 co-relation queries the response was YES. [2022-12-06 00:06:47,713 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3318/3528 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2987 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:06:47,715 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:47,715 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:06:47,860 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:06:47,860 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 174 [2022-12-06 00:06:47,860 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:06:47,860 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:06:47,860 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:06:47,860 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:06:47,860 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable546 [2022-12-06 00:06:47,860 INFO L420 AbstractCegarLoop]: === Iteration 548 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:06:47,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:06:47,861 INFO L85 PathProgramCache]: Analyzing trace with hash 65923993, now seen corresponding path program 1 times [2022-12-06 00:06:47,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:06:47,861 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085720414] [2022-12-06 00:06:47,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:06:47,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:06:47,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:06:47,927 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-06 00:06:47,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:06:47,927 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085720414] [2022-12-06 00:06:47,927 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1085720414] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:06:47,927 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:06:47,928 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:06:47,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654756595] [2022-12-06 00:06:47,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:06:47,928 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:06:47,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:06:47,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:06:47,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:06:47,928 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:06:47,928 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:06:47,928 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:06:47,928 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:06:47,928 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:06:48,228 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:06:48,228 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:06:48,233 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13568 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:06:48,241 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:06:48,241 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:06:48,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:06:48,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:06:48,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:06:48,242 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:06:48,242 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:06:48,242 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:06:48,274 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:06:48,275 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:48,275 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:06:48,275 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:06:48,275 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:06:48,275 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:48,275 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:06:48,276 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:06:48,276 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:48,276 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:48,300 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:06:48,300 INFO L131 PetriNetUnfolder]: For 3310/3519 co-relation queries the response was YES. [2022-12-06 00:06:48,300 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3310/3519 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2976 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:06:48,302 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:48,302 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:06:48,459 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:06:48,459 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 184 [2022-12-06 00:06:48,459 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:06:48,459 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:06:48,459 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:06:48,459 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:06:48,459 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable547 [2022-12-06 00:06:48,459 INFO L420 AbstractCegarLoop]: === Iteration 549 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:06:48,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:06:48,460 INFO L85 PathProgramCache]: Analyzing trace with hash 1808734328, now seen corresponding path program 1 times [2022-12-06 00:06:48,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:06:48,460 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489119468] [2022-12-06 00:06:48,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:06:48,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:06:48,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:06:48,525 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-06 00:06:48,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:06:48,525 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489119468] [2022-12-06 00:06:48,525 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1489119468] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:06:48,525 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:06:48,525 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:06:48,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847133265] [2022-12-06 00:06:48,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:06:48,525 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:06:48,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:06:48,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:06:48,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:06:48,526 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:06:48,526 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:06:48,526 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:06:48,526 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:06:48,526 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:06:48,796 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:06:48,796 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:06:48,802 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13581 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:06:48,810 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:06:48,810 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:06:48,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:06:48,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:06:48,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:06:48,810 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:06:48,811 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:06:48,811 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:06:48,845 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:06:48,847 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:48,847 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:06:48,847 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:06:48,847 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:06:48,847 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:48,847 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:06:48,847 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:06:48,848 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:48,848 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:48,872 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:06:48,873 INFO L131 PetriNetUnfolder]: For 3328/3540 co-relation queries the response was YES. [2022-12-06 00:06:48,873 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3328/3540 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2995 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:06:48,875 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:48,875 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:06:49,027 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:06:49,027 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 180 [2022-12-06 00:06:49,027 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:06:49,028 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:06:49,028 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:06:49,028 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:06:49,028 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable548 [2022-12-06 00:06:49,028 INFO L420 AbstractCegarLoop]: === Iteration 550 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:06:49,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:06:49,028 INFO L85 PathProgramCache]: Analyzing trace with hash -743422633, now seen corresponding path program 1 times [2022-12-06 00:06:49,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:06:49,028 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382999640] [2022-12-06 00:06:49,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:06:49,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:06:49,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:06:49,095 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-06 00:06:49,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:06:49,095 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382999640] [2022-12-06 00:06:49,095 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1382999640] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:06:49,095 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:06:49,096 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:06:49,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372016286] [2022-12-06 00:06:49,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:06:49,096 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:06:49,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:06:49,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:06:49,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:06:49,096 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:06:49,096 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:06:49,096 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:06:49,096 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:06:49,096 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:06:49,384 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:06:49,384 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 00:06:49,390 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26969/27014 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13549 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:06:49,397 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:06:49,397 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:06:49,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:06:49,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:06:49,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:06:49,398 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:06:49,398 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:06:49,398 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:06:49,432 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:06:49,433 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:49,433 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:06:49,434 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:06:49,434 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:06:49,434 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:49,434 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:06:49,434 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:06:49,434 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:49,435 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:49,459 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:06:49,459 INFO L131 PetriNetUnfolder]: For 3122/3262 co-relation queries the response was YES. [2022-12-06 00:06:49,460 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3122/3262 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2965 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:06:49,462 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:49,462 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:06:49,626 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:06:49,626 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 192 [2022-12-06 00:06:49,627 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:06:49,627 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:06:49,627 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:06:49,627 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:06:49,627 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable549 [2022-12-06 00:06:49,627 INFO L420 AbstractCegarLoop]: === Iteration 551 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:06:49,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:06:49,627 INFO L85 PathProgramCache]: Analyzing trace with hash 999387702, now seen corresponding path program 1 times [2022-12-06 00:06:49,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:06:49,627 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307520973] [2022-12-06 00:06:49,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:06:49,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:06:49,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:06:49,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-06 00:06:49,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:06:49,695 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307520973] [2022-12-06 00:06:49,695 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [307520973] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:06:49,695 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:06:49,695 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:06:49,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230638863] [2022-12-06 00:06:49,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:06:49,695 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:06:49,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:06:49,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:06:49,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:06:49,696 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:06:49,696 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:06:49,696 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:06:49,696 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:06:49,696 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:06:49,983 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:06:49,984 INFO L131 PetriNetUnfolder]: For 26955/27000 co-relation queries the response was YES. [2022-12-06 00:06:49,989 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26955/27000 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13552 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:06:49,996 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:06:49,997 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:06:49,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:06:49,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:06:49,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:06:49,997 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:06:49,997 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:06:49,997 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:06:50,034 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:06:50,035 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:50,036 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:06:50,036 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:06:50,036 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:06:50,036 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:50,037 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:06:50,037 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:06:50,037 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:50,038 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:50,073 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:06:50,073 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 00:06:50,074 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3133/3273 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2972 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:06:50,077 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:50,077 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:06:50,246 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:06:50,247 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 211 [2022-12-06 00:06:50,247 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:06:50,247 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:06:50,247 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:06:50,247 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:06:50,247 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable550 [2022-12-06 00:06:50,247 INFO L420 AbstractCegarLoop]: === Iteration 552 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:06:50,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:06:50,248 INFO L85 PathProgramCache]: Analyzing trace with hash -1552769259, now seen corresponding path program 1 times [2022-12-06 00:06:50,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:06:50,248 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943513630] [2022-12-06 00:06:50,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:06:50,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:06:50,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:06:50,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-06 00:06:50,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:06:50,328 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943513630] [2022-12-06 00:06:50,329 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1943513630] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:06:50,329 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:06:50,329 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:06:50,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508812136] [2022-12-06 00:06:50,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:06:50,329 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:06:50,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:06:50,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:06:50,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:06:50,329 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:06:50,329 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:06:50,329 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:06:50,329 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:06:50,329 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:06:50,613 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:06:50,614 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:06:50,619 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13584 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:06:50,627 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:06:50,627 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:06:50,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:06:50,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:06:50,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:06:50,628 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:06:50,628 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:06:50,628 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:06:50,663 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:06:50,664 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:50,665 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:06:50,665 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:06:50,665 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:06:50,665 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:50,665 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:06:50,665 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:06:50,665 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:50,666 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:50,691 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:06:50,691 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 00:06:50,692 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3312/3520 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2978 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:06:50,694 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:50,694 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:06:50,840 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:06:50,841 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 176 [2022-12-06 00:06:50,841 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:06:50,841 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:06:50,841 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:06:50,841 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:06:50,841 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable551 [2022-12-06 00:06:50,841 INFO L420 AbstractCegarLoop]: === Iteration 553 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:06:50,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:06:50,842 INFO L85 PathProgramCache]: Analyzing trace with hash 190041076, now seen corresponding path program 1 times [2022-12-06 00:06:50,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:06:50,842 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794293785] [2022-12-06 00:06:50,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:06:50,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:06:50,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:06:50,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-06 00:06:50,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:06:50,920 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794293785] [2022-12-06 00:06:50,920 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [794293785] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:06:50,920 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:06:50,920 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:06:50,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651527279] [2022-12-06 00:06:50,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:06:50,921 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:06:50,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:06:50,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:06:50,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:06:50,921 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:06:50,921 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:06:50,921 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:06:50,921 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:06:50,921 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:06:51,256 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:06:51,256 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:06:51,263 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13549 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:06:51,272 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:06:51,272 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:06:51,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:06:51,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:06:51,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:06:51,280 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:06:51,280 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:06:51,280 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:06:51,318 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:06:51,320 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:51,320 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:06:51,320 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:06:51,320 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:06:51,320 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:51,320 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:06:51,321 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:06:51,321 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:51,323 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:51,356 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:06:51,356 INFO L131 PetriNetUnfolder]: For 3348/3558 co-relation queries the response was YES. [2022-12-06 00:06:51,357 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3348/3558 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2974 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:06:51,359 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:51,359 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:06:51,523 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:06:51,524 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 204 [2022-12-06 00:06:51,524 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:06:51,524 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:06:51,524 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:06:51,524 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:06:51,524 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable552 [2022-12-06 00:06:51,524 INFO L420 AbstractCegarLoop]: === Iteration 554 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:06:51,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:06:51,525 INFO L85 PathProgramCache]: Analyzing trace with hash 1932851411, now seen corresponding path program 1 times [2022-12-06 00:06:51,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:06:51,525 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139703115] [2022-12-06 00:06:51,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:06:51,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:06:51,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:06:51,586 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-06 00:06:51,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:06:51,587 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139703115] [2022-12-06 00:06:51,587 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1139703115] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:06:51,587 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:06:51,587 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:06:51,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7827176] [2022-12-06 00:06:51,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:06:51,587 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:06:51,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:06:51,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:06:51,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:06:51,587 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:06:51,587 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:06:51,587 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:06:51,588 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:06:51,588 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:06:51,888 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:06:51,889 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:06:51,894 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13566 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:06:51,903 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:06:51,903 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:06:51,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:06:51,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:06:51,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:06:51,907 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:06:51,908 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:06:51,908 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:06:51,949 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:06:51,950 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:51,950 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:06:51,950 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:06:51,950 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:06:51,950 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:51,951 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:06:51,951 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:06:51,951 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:51,951 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:51,983 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:06:51,984 INFO L131 PetriNetUnfolder]: For 3301/3509 co-relation queries the response was YES. [2022-12-06 00:06:51,985 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3301/3509 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2996 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:06:51,987 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:51,987 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:06:52,163 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:06:52,163 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 213 [2022-12-06 00:06:52,163 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:06:52,163 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:06:52,163 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:06:52,164 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:06:52,164 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable553 [2022-12-06 00:06:52,164 INFO L420 AbstractCegarLoop]: === Iteration 555 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:06:52,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:06:52,164 INFO L85 PathProgramCache]: Analyzing trace with hash -619305550, now seen corresponding path program 1 times [2022-12-06 00:06:52,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:06:52,164 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768222513] [2022-12-06 00:06:52,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:06:52,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:06:52,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:06:52,219 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-06 00:06:52,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:06:52,220 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768222513] [2022-12-06 00:06:52,220 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [768222513] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:06:52,220 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:06:52,220 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:06:52,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150462324] [2022-12-06 00:06:52,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:06:52,220 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:06:52,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:06:52,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:06:52,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:06:52,220 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:06:52,220 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:06:52,220 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:06:52,221 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:06:52,221 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:06:52,516 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:06:52,516 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 00:06:52,522 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13551 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:06:52,530 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:06:52,530 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:06:52,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:06:52,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:06:52,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:06:52,531 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:06:52,531 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:06:52,531 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:06:52,564 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:06:52,565 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:52,565 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:06:52,566 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:06:52,566 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:06:52,566 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:52,566 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:06:52,566 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:06:52,566 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:52,567 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:52,591 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:06:52,591 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 00:06:52,592 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3321/3530 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2979 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:06:52,594 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:52,594 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:06:52,762 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:06:52,763 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 197 [2022-12-06 00:06:52,763 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:06:52,763 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:06:52,763 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:06:52,763 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:06:52,763 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable554 [2022-12-06 00:06:52,763 INFO L420 AbstractCegarLoop]: === Iteration 556 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:06:52,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:06:52,764 INFO L85 PathProgramCache]: Analyzing trace with hash 1123504785, now seen corresponding path program 1 times [2022-12-06 00:06:52,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:06:52,764 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606772433] [2022-12-06 00:06:52,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:06:52,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:06:52,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:06:52,833 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:06:52,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:06:52,833 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606772433] [2022-12-06 00:06:52,833 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1606772433] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:06:52,833 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:06:52,833 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:06:52,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676436546] [2022-12-06 00:06:52,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:06:52,833 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:06:52,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:06:52,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:06:52,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:06:52,834 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:06:52,834 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:06:52,834 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:06:52,834 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:06:52,834 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:06:53,117 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:06:53,117 INFO L131 PetriNetUnfolder]: For 27229/27274 co-relation queries the response was YES. [2022-12-06 00:06:53,123 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27229/27274 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13577 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:06:53,131 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:06:53,131 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:06:53,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:06:53,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:06:53,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:06:53,132 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:06:53,132 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:06:53,132 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:06:53,167 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:06:53,168 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:53,169 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:06:53,169 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:06:53,169 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:06:53,169 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:53,169 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:06:53,169 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:06:53,169 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:53,170 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:53,194 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:06:53,194 INFO L131 PetriNetUnfolder]: For 3301/3509 co-relation queries the response was YES. [2022-12-06 00:06:53,195 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3301/3509 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2985 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:06:53,197 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:53,197 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:06:53,348 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:06:53,348 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 179 [2022-12-06 00:06:53,348 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:06:53,349 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:06:53,349 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:06:53,349 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:06:53,349 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable555 [2022-12-06 00:06:53,349 INFO L420 AbstractCegarLoop]: === Iteration 557 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:06:53,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:06:53,349 INFO L85 PathProgramCache]: Analyzing trace with hash -1428652176, now seen corresponding path program 1 times [2022-12-06 00:06:53,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:06:53,349 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190453961] [2022-12-06 00:06:53,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:06:53,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:06:53,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:06:53,405 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-06 00:06:53,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:06:53,405 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190453961] [2022-12-06 00:06:53,405 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1190453961] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:06:53,405 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:06:53,405 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:06:53,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954831127] [2022-12-06 00:06:53,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:06:53,405 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:06:53,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:06:53,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:06:53,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:06:53,406 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:06:53,406 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:06:53,406 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:06:53,406 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:06:53,406 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:06:53,688 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:06:53,688 INFO L131 PetriNetUnfolder]: For 26955/27000 co-relation queries the response was YES. [2022-12-06 00:06:53,694 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26955/27000 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13554 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:06:53,701 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:06:53,701 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:06:53,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:06:53,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:06:53,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:06:53,702 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:06:53,702 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:06:53,702 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:06:53,738 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:06:53,739 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:53,739 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:06:53,739 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:06:53,740 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:06:53,740 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:53,740 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:06:53,740 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:06:53,740 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:53,741 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:53,764 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:06:53,764 INFO L131 PetriNetUnfolder]: For 3135/3276 co-relation queries the response was YES. [2022-12-06 00:06:53,765 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3135/3276 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2980 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:06:53,767 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:53,767 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:06:53,915 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:06:53,916 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 177 [2022-12-06 00:06:53,916 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:06:53,916 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:06:53,916 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:06:53,916 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:06:53,916 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable556 [2022-12-06 00:06:53,916 INFO L420 AbstractCegarLoop]: === Iteration 558 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:06:53,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:06:53,916 INFO L85 PathProgramCache]: Analyzing trace with hash 314158159, now seen corresponding path program 1 times [2022-12-06 00:06:53,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:06:53,916 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179360143] [2022-12-06 00:06:53,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:06:53,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:06:53,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:06:53,976 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-06 00:06:53,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:06:53,976 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179360143] [2022-12-06 00:06:53,976 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [179360143] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:06:53,977 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:06:53,977 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:06:53,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086022029] [2022-12-06 00:06:53,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:06:53,977 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:06:53,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:06:53,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:06:53,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:06:53,977 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:06:53,977 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:06:53,977 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:06:53,977 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:06:53,977 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:06:54,281 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:06:54,281 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 00:06:54,286 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26969/27014 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13552 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:06:54,291 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:06:54,291 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:06:54,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:06:54,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:06:54,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:06:54,292 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:06:54,292 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:06:54,292 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:06:54,323 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:06:54,324 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:54,324 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:06:54,324 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:06:54,324 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:06:54,325 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:54,325 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:06:54,325 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:06:54,325 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:54,326 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:54,350 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:06:54,350 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 00:06:54,351 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3133/3273 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2963 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:06:54,353 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:54,353 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:06:54,491 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:06:54,492 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 168 [2022-12-06 00:06:54,492 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:06:54,492 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:06:54,492 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:06:54,492 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:06:54,492 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable557 [2022-12-06 00:06:54,492 INFO L420 AbstractCegarLoop]: === Iteration 559 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:06:54,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:06:54,492 INFO L85 PathProgramCache]: Analyzing trace with hash 2056968494, now seen corresponding path program 1 times [2022-12-06 00:06:54,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:06:54,492 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637206269] [2022-12-06 00:06:54,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:06:54,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:06:54,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:06:54,548 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-06 00:06:54,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:06:54,549 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637206269] [2022-12-06 00:06:54,549 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [637206269] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:06:54,549 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:06:54,549 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:06:54,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139198963] [2022-12-06 00:06:54,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:06:54,549 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:06:54,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:06:54,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:06:54,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:06:54,549 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:06:54,549 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:06:54,549 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:06:54,549 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:06:54,550 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:06:54,821 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:06:54,821 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:06:54,827 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13563 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:06:54,835 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:06:54,835 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:06:54,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:06:54,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:06:54,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:06:54,836 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:06:54,836 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:06:54,836 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:06:54,872 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:06:54,873 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:54,873 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:06:54,874 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:06:54,874 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:06:54,874 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:54,874 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:06:54,874 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:06:54,874 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:54,875 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:54,900 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:06:54,901 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 00:06:54,902 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3312/3520 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2992 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:06:54,904 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:54,904 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:06:55,054 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:06:55,054 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 180 [2022-12-06 00:06:55,054 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:06:55,054 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:06:55,054 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:06:55,054 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:06:55,055 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable558 [2022-12-06 00:06:55,055 INFO L420 AbstractCegarLoop]: === Iteration 560 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:06:55,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:06:55,055 INFO L85 PathProgramCache]: Analyzing trace with hash -495188467, now seen corresponding path program 1 times [2022-12-06 00:06:55,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:06:55,055 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071168259] [2022-12-06 00:06:55,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:06:55,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:06:55,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:06:55,108 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-06 00:06:55,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:06:55,109 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071168259] [2022-12-06 00:06:55,109 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1071168259] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:06:55,109 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:06:55,109 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:06:55,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883151064] [2022-12-06 00:06:55,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:06:55,109 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:06:55,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:06:55,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:06:55,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:06:55,109 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:06:55,110 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:06:55,110 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:06:55,110 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:06:55,110 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:06:55,397 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:06:55,397 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:06:55,403 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13557 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:06:55,410 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:06:55,411 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:06:55,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:06:55,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:06:55,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:06:55,411 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:06:55,411 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:06:55,412 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:06:55,446 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:06:55,447 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:55,447 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:06:55,447 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:06:55,447 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:06:55,447 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:55,448 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:06:55,448 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:06:55,448 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:55,449 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:55,478 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:06:55,478 INFO L131 PetriNetUnfolder]: For 3301/3509 co-relation queries the response was YES. [2022-12-06 00:06:55,479 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3301/3509 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2990 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:06:55,481 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:55,481 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:06:55,633 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:06:55,634 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 187 [2022-12-06 00:06:55,634 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:06:55,634 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:06:55,634 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:06:55,634 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:06:55,634 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable559 [2022-12-06 00:06:55,634 INFO L420 AbstractCegarLoop]: === Iteration 561 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:06:55,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:06:55,634 INFO L85 PathProgramCache]: Analyzing trace with hash 1247621868, now seen corresponding path program 1 times [2022-12-06 00:06:55,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:06:55,634 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645049258] [2022-12-06 00:06:55,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:06:55,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:06:55,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:06:55,703 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-06 00:06:55,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:06:55,703 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645049258] [2022-12-06 00:06:55,703 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1645049258] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:06:55,703 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:06:55,703 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:06:55,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978383918] [2022-12-06 00:06:55,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:06:55,703 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:06:55,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:06:55,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:06:55,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:06:55,704 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:06:55,704 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:06:55,704 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:06:55,704 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:06:55,704 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:06:55,991 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:06:55,991 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 00:06:55,997 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13552 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:06:56,004 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:06:56,005 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:06:56,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:06:56,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:06:56,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:06:56,005 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:06:56,005 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:06:56,005 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:06:56,038 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:06:56,039 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:56,039 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:06:56,040 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:06:56,040 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:06:56,040 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:56,040 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:06:56,040 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:06:56,041 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:56,041 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:56,075 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:06:56,075 INFO L131 PetriNetUnfolder]: For 3338/3547 co-relation queries the response was YES. [2022-12-06 00:06:56,076 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3338/3547 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2984 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:06:56,078 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:56,078 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:06:56,224 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:06:56,224 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 184 [2022-12-06 00:06:56,224 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:06:56,224 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:06:56,224 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:06:56,225 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:06:56,225 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable560 [2022-12-06 00:06:56,225 INFO L420 AbstractCegarLoop]: === Iteration 562 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:06:56,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:06:56,225 INFO L85 PathProgramCache]: Analyzing trace with hash -1304535093, now seen corresponding path program 1 times [2022-12-06 00:06:56,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:06:56,225 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990368922] [2022-12-06 00:06:56,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:06:56,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:06:56,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:06:56,289 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-06 00:06:56,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:06:56,289 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990368922] [2022-12-06 00:06:56,289 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1990368922] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:06:56,289 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:06:56,289 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:06:56,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584933773] [2022-12-06 00:06:56,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:06:56,289 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:06:56,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:06:56,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:06:56,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:06:56,290 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:06:56,290 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:06:56,290 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:06:56,290 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:06:56,290 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:06:56,573 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:06:56,573 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:06:56,578 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13549 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:06:56,585 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:06:56,586 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:06:56,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:06:56,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:06:56,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:06:56,586 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:06:56,586 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:06:56,586 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:06:56,620 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:06:56,622 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:56,622 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:06:56,622 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:06:56,622 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:06:56,622 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:56,622 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:06:56,623 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:06:56,623 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:56,623 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:56,647 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:06:56,647 INFO L131 PetriNetUnfolder]: For 3301/3509 co-relation queries the response was YES. [2022-12-06 00:06:56,648 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3301/3509 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2990 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:06:56,650 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:56,650 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:06:56,825 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:06:56,825 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 203 [2022-12-06 00:06:56,825 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:06:56,825 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:06:56,825 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:06:56,826 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:06:56,826 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable561 [2022-12-06 00:06:56,826 INFO L420 AbstractCegarLoop]: === Iteration 563 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:06:56,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:06:56,826 INFO L85 PathProgramCache]: Analyzing trace with hash 438275242, now seen corresponding path program 1 times [2022-12-06 00:06:56,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:06:56,826 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005012530] [2022-12-06 00:06:56,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:06:56,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:06:56,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:06:56,904 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-06 00:06:56,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:06:56,904 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005012530] [2022-12-06 00:06:56,904 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2005012530] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:06:56,904 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:06:56,904 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:06:56,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550245693] [2022-12-06 00:06:56,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:06:56,904 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:06:56,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:06:56,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:06:56,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:06:56,905 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:06:56,905 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:06:56,905 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:06:56,905 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:06:56,905 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:06:57,191 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:06:57,192 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 00:06:57,198 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13558 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:06:57,205 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:06:57,206 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:06:57,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:06:57,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:06:57,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:06:57,206 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:06:57,206 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:06:57,206 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:06:57,241 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:06:57,242 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:57,242 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:06:57,242 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:06:57,242 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:06:57,243 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:57,243 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:06:57,243 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:06:57,243 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:57,244 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:57,276 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:06:57,276 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 00:06:57,277 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3312/3520 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2967 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:06:57,279 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:57,279 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:06:57,439 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:06:57,440 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 198 [2022-12-06 00:06:57,440 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:06:57,440 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:06:57,440 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:06:57,440 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:06:57,440 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable562 [2022-12-06 00:06:57,440 INFO L420 AbstractCegarLoop]: === Iteration 564 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:06:57,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:06:57,441 INFO L85 PathProgramCache]: Analyzing trace with hash -2113881719, now seen corresponding path program 1 times [2022-12-06 00:06:57,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:06:57,441 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990121750] [2022-12-06 00:06:57,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:06:57,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:06:57,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:06:57,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:06:57,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:06:57,516 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990121750] [2022-12-06 00:06:57,516 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [990121750] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:06:57,517 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:06:57,517 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:06:57,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574930489] [2022-12-06 00:06:57,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:06:57,517 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:06:57,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:06:57,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:06:57,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:06:57,517 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:06:57,517 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:06:57,517 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:06:57,517 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:06:57,517 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:06:57,798 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:06:57,798 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:06:57,803 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13543 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:06:57,811 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:06:57,811 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:06:57,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:06:57,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:06:57,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:06:57,812 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:06:57,812 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:06:57,812 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:06:57,849 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:06:57,850 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:57,850 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:06:57,850 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:06:57,850 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:06:57,850 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:57,851 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:06:57,851 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:06:57,851 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:57,851 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:57,875 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:06:57,875 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 00:06:57,876 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3321/3530 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2974 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:06:57,878 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:57,878 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:06:58,032 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:06:58,032 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 182 [2022-12-06 00:06:58,032 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:06:58,032 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:06:58,032 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:06:58,033 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:06:58,033 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable563 [2022-12-06 00:06:58,033 INFO L420 AbstractCegarLoop]: === Iteration 565 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:06:58,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:06:58,033 INFO L85 PathProgramCache]: Analyzing trace with hash -371071384, now seen corresponding path program 1 times [2022-12-06 00:06:58,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:06:58,033 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235693174] [2022-12-06 00:06:58,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:06:58,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:06:58,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:06:58,089 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-06 00:06:58,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:06:58,090 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235693174] [2022-12-06 00:06:58,090 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [235693174] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:06:58,090 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:06:58,090 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:06:58,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061956336] [2022-12-06 00:06:58,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:06:58,090 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:06:58,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:06:58,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:06:58,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:06:58,091 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:06:58,091 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:06:58,091 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:06:58,091 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:06:58,091 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:06:58,359 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:06:58,360 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:06:58,365 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13547 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:06:58,373 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:06:58,373 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:06:58,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:06:58,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:06:58,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:06:58,373 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:06:58,374 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:06:58,374 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:06:58,409 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:06:58,411 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:58,411 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:06:58,411 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:06:58,411 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:06:58,411 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:58,412 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:06:58,412 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:06:58,412 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:58,412 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:58,436 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:06:58,436 INFO L131 PetriNetUnfolder]: For 3338/3547 co-relation queries the response was YES. [2022-12-06 00:06:58,437 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3338/3547 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2978 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:06:58,439 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:58,439 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:06:58,587 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:06:58,587 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 176 [2022-12-06 00:06:58,587 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:06:58,587 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:06:58,587 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:06:58,587 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:06:58,588 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable564 [2022-12-06 00:06:58,588 INFO L420 AbstractCegarLoop]: === Iteration 566 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:06:58,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:06:58,588 INFO L85 PathProgramCache]: Analyzing trace with hash 1371738951, now seen corresponding path program 1 times [2022-12-06 00:06:58,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:06:58,588 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93738938] [2022-12-06 00:06:58,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:06:58,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:06:58,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:06:58,656 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-06 00:06:58,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:06:58,656 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93738938] [2022-12-06 00:06:58,656 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [93738938] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:06:58,656 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:06:58,656 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:06:58,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132120181] [2022-12-06 00:06:58,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:06:58,656 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:06:58,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:06:58,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:06:58,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:06:58,657 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:06:58,657 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:06:58,657 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:06:58,657 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:06:58,657 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:06:58,955 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:06:58,955 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:06:58,960 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13545 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:06:58,967 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:06:58,967 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:06:58,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:06:58,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:06:58,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:06:58,968 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:06:58,968 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:06:58,968 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:06:59,000 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:06:59,001 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:59,001 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:06:59,001 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:06:59,001 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:06:59,001 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:59,002 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:06:59,002 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:06:59,002 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:59,002 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:59,026 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:06:59,026 INFO L131 PetriNetUnfolder]: For 3298/3507 co-relation queries the response was YES. [2022-12-06 00:06:59,027 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3298/3507 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 3002 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:06:59,029 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:59,029 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:06:59,201 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:06:59,201 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 200 [2022-12-06 00:06:59,201 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:06:59,201 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:06:59,202 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:06:59,202 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:06:59,202 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable565 [2022-12-06 00:06:59,202 INFO L420 AbstractCegarLoop]: === Iteration 567 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:06:59,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:06:59,202 INFO L85 PathProgramCache]: Analyzing trace with hash -1180418010, now seen corresponding path program 1 times [2022-12-06 00:06:59,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:06:59,202 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123032494] [2022-12-06 00:06:59,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:06:59,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:06:59,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:06:59,266 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-06 00:06:59,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:06:59,266 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123032494] [2022-12-06 00:06:59,266 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2123032494] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:06:59,266 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:06:59,266 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:06:59,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727264216] [2022-12-06 00:06:59,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:06:59,266 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:06:59,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:06:59,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:06:59,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:06:59,267 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:06:59,267 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:06:59,267 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:06:59,267 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:06:59,267 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:06:59,553 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:06:59,553 INFO L131 PetriNetUnfolder]: For 27136/27181 co-relation queries the response was YES. [2022-12-06 00:06:59,559 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27136/27181 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13518 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:06:59,567 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:06:59,567 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:06:59,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:06:59,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:06:59,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:06:59,568 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:06:59,568 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:06:59,568 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:06:59,603 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:06:59,604 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:59,604 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:06:59,604 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:06:59,604 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:06:59,604 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:59,605 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:06:59,605 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:06:59,605 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:59,605 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:59,630 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:06:59,630 INFO L131 PetriNetUnfolder]: For 3156/3296 co-relation queries the response was YES. [2022-12-06 00:06:59,631 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3156/3296 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 3006 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:06:59,633 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:06:59,633 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:06:59,782 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:06:59,783 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 179 [2022-12-06 00:06:59,783 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:06:59,783 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:06:59,783 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:06:59,783 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:06:59,783 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable566 [2022-12-06 00:06:59,783 INFO L420 AbstractCegarLoop]: === Iteration 568 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:06:59,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:06:59,783 INFO L85 PathProgramCache]: Analyzing trace with hash 562392325, now seen corresponding path program 1 times [2022-12-06 00:06:59,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:06:59,783 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942240708] [2022-12-06 00:06:59,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:06:59,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:06:59,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:06:59,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:06:59,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:06:59,840 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942240708] [2022-12-06 00:06:59,840 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1942240708] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:06:59,840 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:06:59,840 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:06:59,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353341135] [2022-12-06 00:06:59,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:06:59,840 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:06:59,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:06:59,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:06:59,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:06:59,841 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:06:59,841 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:06:59,841 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:06:59,841 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:06:59,841 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:07:00,125 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:07:00,125 INFO L131 PetriNetUnfolder]: For 26955/27000 co-relation queries the response was YES. [2022-12-06 00:07:00,131 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26955/27000 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13531 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:07:00,139 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:07:00,139 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:07:00,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:07:00,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:07:00,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:07:00,140 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:07:00,140 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:07:00,140 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:07:00,181 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:07:00,182 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:00,182 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:07:00,183 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:07:00,183 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:07:00,183 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:00,183 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:07:00,183 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:07:00,183 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:00,184 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:00,209 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:07:00,209 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 00:07:00,210 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3133/3273 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2981 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:07:00,213 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:00,213 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:07:00,362 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:07:00,363 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 180 [2022-12-06 00:07:00,363 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:07:00,363 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:00,363 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:07:00,363 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:07:00,363 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable567 [2022-12-06 00:07:00,363 INFO L420 AbstractCegarLoop]: === Iteration 569 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:07:00,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:07:00,363 INFO L85 PathProgramCache]: Analyzing trace with hash -1989764636, now seen corresponding path program 1 times [2022-12-06 00:07:00,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:07:00,363 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725476575] [2022-12-06 00:07:00,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:07:00,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:07:00,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:07:00,440 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-06 00:07:00,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:07:00,440 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725476575] [2022-12-06 00:07:00,440 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1725476575] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:07:00,440 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:07:00,440 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:07:00,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783877051] [2022-12-06 00:07:00,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:07:00,441 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:07:00,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:07:00,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:07:00,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:07:00,441 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:07:00,441 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:00,441 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:07:00,441 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:07:00,441 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:07:00,722 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:07:00,722 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:07:00,728 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13559 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:07:00,735 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:07:00,735 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:07:00,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:07:00,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:07:00,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:07:00,736 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:07:00,736 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:07:00,736 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:07:00,772 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:07:00,773 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:00,774 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:07:00,774 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:07:00,774 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:07:00,774 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:00,774 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:07:00,774 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:07:00,774 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:00,775 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:00,799 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:07:00,799 INFO L131 PetriNetUnfolder]: For 3338/3547 co-relation queries the response was YES. [2022-12-06 00:07:00,800 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3338/3547 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2983 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:07:00,802 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:00,802 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:07:00,953 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:07:00,953 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 179 [2022-12-06 00:07:00,953 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:07:00,954 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:00,954 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:07:00,954 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:07:00,954 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable568 [2022-12-06 00:07:00,954 INFO L420 AbstractCegarLoop]: === Iteration 570 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:07:00,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:07:00,954 INFO L85 PathProgramCache]: Analyzing trace with hash -246954301, now seen corresponding path program 1 times [2022-12-06 00:07:00,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:07:00,954 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007039222] [2022-12-06 00:07:00,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:07:00,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:07:00,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:07:01,012 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-06 00:07:01,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:07:01,012 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007039222] [2022-12-06 00:07:01,012 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1007039222] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:07:01,012 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:07:01,012 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:07:01,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496135319] [2022-12-06 00:07:01,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:07:01,013 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:07:01,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:07:01,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:07:01,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:07:01,013 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:07:01,013 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:01,013 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:07:01,013 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:07:01,013 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:07:01,286 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:07:01,286 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:07:01,292 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13567 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:07:01,299 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:07:01,299 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:07:01,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:07:01,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:07:01,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:07:01,300 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:07:01,300 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:07:01,300 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:07:01,336 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:07:01,337 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:01,337 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:07:01,338 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:07:01,338 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:07:01,338 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:01,338 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:07:01,338 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:07:01,338 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:01,339 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:01,362 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:07:01,363 INFO L131 PetriNetUnfolder]: For 3298/3507 co-relation queries the response was YES. [2022-12-06 00:07:01,364 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3298/3507 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2979 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:07:01,365 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:01,366 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:07:01,532 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:07:01,533 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 195 [2022-12-06 00:07:01,533 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:07:01,533 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:01,533 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:07:01,533 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:07:01,533 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable569 [2022-12-06 00:07:01,533 INFO L420 AbstractCegarLoop]: === Iteration 571 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:07:01,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:07:01,533 INFO L85 PathProgramCache]: Analyzing trace with hash 1495856034, now seen corresponding path program 1 times [2022-12-06 00:07:01,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:07:01,533 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411111172] [2022-12-06 00:07:01,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:07:01,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:07:01,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:07:01,595 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-06 00:07:01,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:07:01,595 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411111172] [2022-12-06 00:07:01,595 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1411111172] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:07:01,595 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:07:01,595 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:07:01,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119169227] [2022-12-06 00:07:01,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:07:01,596 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:07:01,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:07:01,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:07:01,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:07:01,596 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:07:01,596 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:01,596 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:07:01,596 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:07:01,596 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:07:01,911 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:07:01,911 INFO L131 PetriNetUnfolder]: For 26955/27000 co-relation queries the response was YES. [2022-12-06 00:07:01,916 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26955/27000 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13527 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:07:01,922 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:07:01,922 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:07:01,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:07:01,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:07:01,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:07:01,923 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:07:01,923 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:07:01,923 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:07:01,956 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:07:01,957 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:01,957 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:07:01,958 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:07:01,958 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:07:01,958 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:01,958 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:07:01,958 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:07:01,958 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:01,959 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:01,984 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:07:01,984 INFO L131 PetriNetUnfolder]: For 3122/3262 co-relation queries the response was YES. [2022-12-06 00:07:01,985 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3122/3262 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2983 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:07:01,987 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:01,987 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:07:02,134 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:07:02,134 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 176 [2022-12-06 00:07:02,134 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:07:02,134 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:02,134 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:07:02,134 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:07:02,134 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable570 [2022-12-06 00:07:02,134 INFO L420 AbstractCegarLoop]: === Iteration 572 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:07:02,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:07:02,135 INFO L85 PathProgramCache]: Analyzing trace with hash -1056300927, now seen corresponding path program 1 times [2022-12-06 00:07:02,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:07:02,135 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084966055] [2022-12-06 00:07:02,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:07:02,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:07:02,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:07:02,215 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-06 00:07:02,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:07:02,215 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084966055] [2022-12-06 00:07:02,215 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2084966055] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:07:02,215 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:07:02,215 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:07:02,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410478610] [2022-12-06 00:07:02,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:07:02,216 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:07:02,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:07:02,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:07:02,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:07:02,216 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:07:02,216 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:02,216 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:07:02,216 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:07:02,216 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:07:02,498 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:07:02,498 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 00:07:02,503 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13570 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:07:02,511 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:07:02,511 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:07:02,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:07:02,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:07:02,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:07:02,512 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:07:02,512 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:07:02,512 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:07:02,547 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:07:02,548 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:02,548 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:07:02,548 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:07:02,548 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:07:02,548 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:02,549 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:07:02,549 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:07:02,549 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:02,549 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:02,574 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:07:02,574 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 00:07:02,575 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3321/3530 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2995 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:07:02,577 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:02,577 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:07:02,717 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:07:02,718 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 170 [2022-12-06 00:07:02,718 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:07:02,718 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:02,718 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:07:02,718 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:07:02,718 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable571 [2022-12-06 00:07:02,718 INFO L420 AbstractCegarLoop]: === Iteration 573 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:07:02,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:07:02,718 INFO L85 PathProgramCache]: Analyzing trace with hash 686509408, now seen corresponding path program 1 times [2022-12-06 00:07:02,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:07:02,718 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368168824] [2022-12-06 00:07:02,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:07:02,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:07:02,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:07:02,784 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-06 00:07:02,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:07:02,784 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368168824] [2022-12-06 00:07:02,784 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1368168824] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:07:02,784 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:07:02,784 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:07:02,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607026826] [2022-12-06 00:07:02,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:07:02,785 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:07:02,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:07:02,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:07:02,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:07:02,785 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:07:02,785 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:02,785 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:07:02,785 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:07:02,785 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:07:03,074 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:07:03,074 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:07:03,079 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13560 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:07:03,087 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:07:03,088 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:07:03,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:07:03,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:07:03,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:07:03,088 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:07:03,088 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:07:03,088 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:07:03,122 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:07:03,123 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:03,123 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:07:03,123 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:07:03,123 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:07:03,123 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:03,124 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:07:03,124 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:07:03,124 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:03,124 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:03,149 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:07:03,149 INFO L131 PetriNetUnfolder]: For 3327/3536 co-relation queries the response was YES. [2022-12-06 00:07:03,150 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3327/3536 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2975 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:07:03,152 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:03,152 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:07:03,307 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:07:03,308 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 185 [2022-12-06 00:07:03,308 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:07:03,308 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:03,308 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:07:03,308 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:07:03,308 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable572 [2022-12-06 00:07:03,308 INFO L420 AbstractCegarLoop]: === Iteration 574 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:07:03,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:07:03,308 INFO L85 PathProgramCache]: Analyzing trace with hash -1865647553, now seen corresponding path program 1 times [2022-12-06 00:07:03,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:07:03,308 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379263566] [2022-12-06 00:07:03,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:07:03,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:07:03,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:07:03,382 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-06 00:07:03,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:07:03,382 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379263566] [2022-12-06 00:07:03,382 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1379263566] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:07:03,382 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:07:03,382 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:07:03,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268333851] [2022-12-06 00:07:03,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:07:03,383 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:07:03,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:07:03,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:07:03,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:07:03,383 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:07:03,383 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:03,383 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:07:03,383 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:07:03,383 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:07:03,657 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:07:03,657 INFO L131 PetriNetUnfolder]: For 27136/27181 co-relation queries the response was YES. [2022-12-06 00:07:03,662 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27136/27181 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13532 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:07:03,670 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:07:03,670 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:07:03,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:07:03,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:07:03,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:07:03,671 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:07:03,672 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:07:03,672 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:07:03,706 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:07:03,707 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:03,707 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:07:03,707 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:07:03,707 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:07:03,708 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:03,708 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:07:03,708 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:07:03,708 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:03,709 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:03,733 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:07:03,734 INFO L131 PetriNetUnfolder]: For 3167/3307 co-relation queries the response was YES. [2022-12-06 00:07:03,734 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3167/3307 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2992 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:07:03,736 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:03,737 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:07:03,888 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:07:03,889 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 182 [2022-12-06 00:07:03,889 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:07:03,889 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:03,889 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:07:03,889 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:07:03,889 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable573 [2022-12-06 00:07:03,889 INFO L420 AbstractCegarLoop]: === Iteration 575 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:07:03,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:07:03,889 INFO L85 PathProgramCache]: Analyzing trace with hash -122837218, now seen corresponding path program 1 times [2022-12-06 00:07:03,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:07:03,889 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617097020] [2022-12-06 00:07:03,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:07:03,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:07:03,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:07:03,956 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-06 00:07:03,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:07:03,956 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617097020] [2022-12-06 00:07:03,956 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [617097020] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:07:03,956 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:07:03,956 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:07:03,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824064183] [2022-12-06 00:07:03,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:07:03,956 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:07:03,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:07:03,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:07:03,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:07:03,957 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:07:03,957 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:03,957 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:07:03,957 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:07:03,957 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:07:04,249 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:07:04,249 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 00:07:04,255 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26965/27010 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13521 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:07:04,262 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:07:04,262 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:07:04,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:07:04,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:07:04,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:07:04,263 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:07:04,263 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:07:04,263 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:07:04,298 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:07:04,300 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:04,300 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:07:04,300 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:07:04,300 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:07:04,300 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:04,300 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:07:04,300 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:07:04,301 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:04,301 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:04,325 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:07:04,325 INFO L131 PetriNetUnfolder]: For 3123/3264 co-relation queries the response was YES. [2022-12-06 00:07:04,326 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3123/3264 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2968 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:07:04,327 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:04,327 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:07:04,470 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:07:04,471 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 171 [2022-12-06 00:07:04,471 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:07:04,471 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:04,471 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:07:04,471 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:07:04,471 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable574 [2022-12-06 00:07:04,471 INFO L420 AbstractCegarLoop]: === Iteration 576 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:07:04,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:07:04,471 INFO L85 PathProgramCache]: Analyzing trace with hash 1619973117, now seen corresponding path program 1 times [2022-12-06 00:07:04,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:07:04,471 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669058663] [2022-12-06 00:07:04,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:07:04,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:07:04,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:07:04,554 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-06 00:07:04,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:07:04,554 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669058663] [2022-12-06 00:07:04,554 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1669058663] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:07:04,554 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:07:04,555 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:07:04,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218838976] [2022-12-06 00:07:04,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:07:04,555 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:07:04,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:07:04,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:07:04,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:07:04,555 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:07:04,555 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:04,555 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:07:04,556 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:07:04,556 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:07:04,873 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:07:04,873 INFO L131 PetriNetUnfolder]: For 27136/27181 co-relation queries the response was YES. [2022-12-06 00:07:04,878 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27136/27181 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13521 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:07:04,883 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:07:04,883 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:07:04,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:07:04,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:07:04,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:07:04,884 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:07:04,884 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:07:04,884 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:07:04,913 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:07:04,914 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:04,914 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:07:04,914 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:07:04,914 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:07:04,914 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:04,915 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:07:04,915 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:07:04,915 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:04,915 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:04,939 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:07:04,939 INFO L131 PetriNetUnfolder]: For 3167/3307 co-relation queries the response was YES. [2022-12-06 00:07:04,940 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3167/3307 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2986 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:07:04,942 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:04,942 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:07:05,095 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:07:05,096 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 182 [2022-12-06 00:07:05,096 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:07:05,096 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:05,096 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:07:05,096 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:07:05,096 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable575 [2022-12-06 00:07:05,096 INFO L420 AbstractCegarLoop]: === Iteration 577 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:07:05,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:07:05,096 INFO L85 PathProgramCache]: Analyzing trace with hash -932183844, now seen corresponding path program 1 times [2022-12-06 00:07:05,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:07:05,096 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402058734] [2022-12-06 00:07:05,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:07:05,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:07:05,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:07:05,174 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-06 00:07:05,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:07:05,174 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402058734] [2022-12-06 00:07:05,174 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [402058734] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:07:05,174 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:07:05,174 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:07:05,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290180818] [2022-12-06 00:07:05,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:07:05,175 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:07:05,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:07:05,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:07:05,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:07:05,175 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:07:05,175 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:05,175 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:07:05,175 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:07:05,175 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:07:05,447 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:07:05,447 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 00:07:05,452 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26969/27014 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13524 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:07:05,458 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:07:05,459 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:07:05,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:07:05,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:07:05,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:07:05,459 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:07:05,459 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:07:05,459 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:07:05,493 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:07:05,494 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:05,494 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:07:05,494 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:07:05,494 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:07:05,494 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:05,495 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:07:05,495 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:07:05,495 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:05,495 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:05,519 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:07:05,519 INFO L131 PetriNetUnfolder]: For 3146/3287 co-relation queries the response was YES. [2022-12-06 00:07:05,519 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3146/3287 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2964 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:07:05,521 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:05,521 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:07:05,668 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:07:05,668 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 174 [2022-12-06 00:07:05,668 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:07:05,668 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:05,668 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:07:05,668 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:07:05,668 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable576 [2022-12-06 00:07:05,669 INFO L420 AbstractCegarLoop]: === Iteration 578 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:07:05,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:07:05,669 INFO L85 PathProgramCache]: Analyzing trace with hash 810626491, now seen corresponding path program 1 times [2022-12-06 00:07:05,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:07:05,669 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364835441] [2022-12-06 00:07:05,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:07:05,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:07:05,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:07:05,737 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-06 00:07:05,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:07:05,737 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364835441] [2022-12-06 00:07:05,737 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1364835441] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:07:05,737 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:07:05,737 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:07:05,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546875648] [2022-12-06 00:07:05,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:07:05,737 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:07:05,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:07:05,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:07:05,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:07:05,738 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:07:05,738 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:05,738 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:07:05,738 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:07:05,738 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:07:06,029 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:07:06,029 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 00:07:06,036 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26965/27010 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13524 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:07:06,044 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:07:06,044 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:07:06,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:07:06,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:07:06,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:07:06,045 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:07:06,045 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:07:06,045 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:07:06,080 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:07:06,081 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:06,081 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:07:06,081 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:07:06,081 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:07:06,082 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:06,082 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:07:06,082 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:07:06,082 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:06,083 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:06,107 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:07:06,107 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 00:07:06,108 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3133/3273 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2973 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:07:06,109 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:06,109 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:07:06,280 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:07:06,280 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 199 [2022-12-06 00:07:06,280 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:07:06,281 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:06,281 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:07:06,281 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:07:06,281 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable577 [2022-12-06 00:07:06,281 INFO L420 AbstractCegarLoop]: === Iteration 579 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:07:06,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:07:06,281 INFO L85 PathProgramCache]: Analyzing trace with hash -1741530470, now seen corresponding path program 1 times [2022-12-06 00:07:06,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:07:06,281 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125072242] [2022-12-06 00:07:06,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:07:06,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:07:06,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:07:06,343 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-06 00:07:06,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:07:06,344 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125072242] [2022-12-06 00:07:06,344 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2125072242] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:07:06,344 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:07:06,344 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:07:06,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056781448] [2022-12-06 00:07:06,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:07:06,344 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:07:06,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:07:06,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:07:06,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:07:06,344 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:07:06,345 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:06,345 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:07:06,345 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:07:06,345 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:07:06,617 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:07:06,617 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:07:06,622 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13553 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:07:06,629 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:07:06,629 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:07:06,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:07:06,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:07:06,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:07:06,629 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:07:06,630 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:07:06,630 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:07:06,660 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:07:06,661 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:06,661 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:07:06,662 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:07:06,662 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:07:06,662 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:06,662 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:07:06,662 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:07:06,662 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:06,663 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:06,686 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:07:06,686 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 00:07:06,687 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3321/3530 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2984 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:07:06,689 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:06,689 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:07:06,837 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:07:06,838 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 176 [2022-12-06 00:07:06,838 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:07:06,838 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:06,838 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:07:06,838 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:07:06,838 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable578 [2022-12-06 00:07:06,838 INFO L420 AbstractCegarLoop]: === Iteration 580 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:07:06,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:07:06,838 INFO L85 PathProgramCache]: Analyzing trace with hash 1279865, now seen corresponding path program 1 times [2022-12-06 00:07:06,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:07:06,838 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911731944] [2022-12-06 00:07:06,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:07:06,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:07:06,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:07:06,900 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-06 00:07:06,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:07:06,900 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911731944] [2022-12-06 00:07:06,900 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [911731944] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:07:06,900 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:07:06,900 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:07:06,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653655611] [2022-12-06 00:07:06,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:07:06,900 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:07:06,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:07:06,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:07:06,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:07:06,901 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:07:06,901 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:06,901 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:07:06,901 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:07:06,901 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:07:07,170 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:07:07,171 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 00:07:07,176 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26969/27014 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13528 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:07:07,182 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:07:07,182 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:07:07,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:07:07,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:07:07,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:07:07,183 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:07:07,183 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:07:07,183 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:07:07,216 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:07:07,218 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:07,218 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:07:07,218 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:07:07,218 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:07:07,218 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:07,218 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:07:07,218 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:07:07,218 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:07,219 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:07,242 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:07:07,242 INFO L131 PetriNetUnfolder]: For 3123/3264 co-relation queries the response was YES. [2022-12-06 00:07:07,243 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3123/3264 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2970 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:07:07,245 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:07,245 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:07:07,397 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:07:07,397 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 179 [2022-12-06 00:07:07,397 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:07:07,398 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:07,398 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:07:07,398 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:07:07,398 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable579 [2022-12-06 00:07:07,398 INFO L420 AbstractCegarLoop]: === Iteration 581 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:07:07,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:07:07,398 INFO L85 PathProgramCache]: Analyzing trace with hash 1744090200, now seen corresponding path program 1 times [2022-12-06 00:07:07,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:07:07,398 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100258392] [2022-12-06 00:07:07,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:07:07,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:07:07,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:07:07,464 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-06 00:07:07,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:07:07,465 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100258392] [2022-12-06 00:07:07,465 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [100258392] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:07:07,465 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:07:07,465 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:07:07,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863666482] [2022-12-06 00:07:07,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:07:07,465 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:07:07,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:07:07,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:07:07,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:07:07,465 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:07:07,466 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:07,466 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:07:07,466 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:07:07,466 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:07:07,739 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:07:07,740 INFO L131 PetriNetUnfolder]: For 26955/27000 co-relation queries the response was YES. [2022-12-06 00:07:07,745 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26955/27000 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13519 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:07:07,752 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:07:07,752 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:07:07,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:07:07,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:07:07,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:07:07,753 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:07:07,753 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:07:07,753 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:07:07,788 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:07:07,789 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:07,789 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:07:07,790 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:07:07,790 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:07:07,790 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:07,790 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:07:07,790 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:07:07,790 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:07,791 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:07,820 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:07:07,821 INFO L131 PetriNetUnfolder]: For 3135/3276 co-relation queries the response was YES. [2022-12-06 00:07:07,821 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3135/3276 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2969 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:07:07,823 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:07,823 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:07:07,971 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:07:07,972 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 182 [2022-12-06 00:07:07,972 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:07:07,972 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:07,972 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:07:07,972 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:07:07,972 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable580 [2022-12-06 00:07:07,972 INFO L420 AbstractCegarLoop]: === Iteration 582 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:07:07,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:07:07,973 INFO L85 PathProgramCache]: Analyzing trace with hash -808066761, now seen corresponding path program 1 times [2022-12-06 00:07:07,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:07:07,973 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006617753] [2022-12-06 00:07:07,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:07:07,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:07:07,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:07:08,030 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-06 00:07:08,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:07:08,030 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006617753] [2022-12-06 00:07:08,030 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2006617753] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:07:08,030 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:07:08,030 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:07:08,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302434463] [2022-12-06 00:07:08,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:07:08,030 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:07:08,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:07:08,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:07:08,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:07:08,031 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:07:08,031 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:08,031 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:07:08,031 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:07:08,031 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:07:08,298 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:07:08,298 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 00:07:08,304 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13563 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:07:08,311 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:07:08,311 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:07:08,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:07:08,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:07:08,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:07:08,312 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:07:08,312 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:07:08,312 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:07:08,347 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:07:08,348 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:08,349 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:07:08,349 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:07:08,349 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:07:08,349 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:08,349 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:07:08,349 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:07:08,349 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:08,350 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:08,373 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:07:08,374 INFO L131 PetriNetUnfolder]: For 3309/3518 co-relation queries the response was YES. [2022-12-06 00:07:08,374 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3309/3518 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2985 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:07:08,376 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:08,376 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:07:08,529 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:07:08,530 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 181 [2022-12-06 00:07:08,530 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:07:08,530 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:08,530 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:07:08,530 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:07:08,530 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable581 [2022-12-06 00:07:08,530 INFO L420 AbstractCegarLoop]: === Iteration 583 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:07:08,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:07:08,530 INFO L85 PathProgramCache]: Analyzing trace with hash 934743574, now seen corresponding path program 1 times [2022-12-06 00:07:08,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:07:08,530 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069017939] [2022-12-06 00:07:08,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:07:08,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:07:08,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:07:08,594 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-06 00:07:08,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:07:08,594 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069017939] [2022-12-06 00:07:08,594 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1069017939] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:07:08,594 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:07:08,594 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:07:08,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966851] [2022-12-06 00:07:08,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:07:08,595 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:07:08,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:07:08,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:07:08,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:07:08,595 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:07:08,595 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:08,595 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:07:08,595 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:07:08,595 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:07:08,874 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:07:08,874 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:07:08,880 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13573 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:07:08,887 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:07:08,887 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:07:08,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:07:08,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:07:08,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:07:08,888 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:07:08,888 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:07:08,888 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:07:08,923 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:07:08,924 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:08,924 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:07:08,924 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:07:08,925 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:07:08,925 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:08,925 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:07:08,925 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:07:08,925 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:08,926 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:08,949 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:07:08,949 INFO L131 PetriNetUnfolder]: For 3318/3528 co-relation queries the response was YES. [2022-12-06 00:07:08,950 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3318/3528 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2974 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:07:08,952 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:08,952 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:07:09,127 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:07:09,127 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 203 [2022-12-06 00:07:09,127 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:07:09,127 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:09,127 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:07:09,127 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:07:09,127 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable582 [2022-12-06 00:07:09,128 INFO L420 AbstractCegarLoop]: === Iteration 584 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:07:09,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:07:09,128 INFO L85 PathProgramCache]: Analyzing trace with hash -1617413387, now seen corresponding path program 1 times [2022-12-06 00:07:09,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:07:09,128 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944056455] [2022-12-06 00:07:09,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:07:09,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:07:09,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:07:09,184 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-06 00:07:09,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:07:09,184 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944056455] [2022-12-06 00:07:09,184 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1944056455] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:07:09,184 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:07:09,184 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:07:09,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466449522] [2022-12-06 00:07:09,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:07:09,185 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:07:09,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:07:09,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:07:09,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:07:09,185 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:07:09,185 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:09,185 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:07:09,185 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:07:09,185 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:07:09,467 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:07:09,467 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:07:09,472 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13575 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:07:09,479 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:07:09,479 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:07:09,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:07:09,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:07:09,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:07:09,479 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:07:09,479 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:07:09,480 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:07:09,512 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:07:09,513 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:09,513 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:07:09,513 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:07:09,513 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:07:09,513 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:09,513 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:07:09,514 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:07:09,514 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:09,514 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:09,538 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:07:09,538 INFO L131 PetriNetUnfolder]: For 3318/3528 co-relation queries the response was YES. [2022-12-06 00:07:09,539 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3318/3528 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2991 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:07:09,541 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:09,541 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:07:09,684 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:07:09,684 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 171 [2022-12-06 00:07:09,684 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:07:09,684 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:09,684 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:07:09,684 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:07:09,684 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable583 [2022-12-06 00:07:09,684 INFO L420 AbstractCegarLoop]: === Iteration 585 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:07:09,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:07:09,685 INFO L85 PathProgramCache]: Analyzing trace with hash 125396948, now seen corresponding path program 1 times [2022-12-06 00:07:09,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:07:09,685 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660934367] [2022-12-06 00:07:09,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:07:09,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:07:09,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:07:09,743 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-06 00:07:09,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:07:09,743 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660934367] [2022-12-06 00:07:09,743 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1660934367] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:07:09,743 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:07:09,743 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:07:09,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873425400] [2022-12-06 00:07:09,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:07:09,744 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:07:09,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:07:09,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:07:09,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:07:09,744 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:07:09,744 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:09,744 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:07:09,744 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:07:09,744 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:07:10,017 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:07:10,017 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:07:10,023 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13578 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:07:10,031 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:07:10,031 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:07:10,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:07:10,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:07:10,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:07:10,032 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:07:10,032 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:07:10,032 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:07:10,071 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:07:10,072 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:10,072 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:07:10,072 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:07:10,072 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:07:10,073 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:10,073 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:07:10,073 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:07:10,073 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:10,074 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:10,101 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:07:10,102 INFO L131 PetriNetUnfolder]: For 3348/3558 co-relation queries the response was YES. [2022-12-06 00:07:10,103 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3348/3558 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2987 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:07:10,105 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:10,105 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:07:10,255 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:07:10,256 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 184 [2022-12-06 00:07:10,256 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:07:10,256 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:10,256 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:07:10,256 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:07:10,256 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable584 [2022-12-06 00:07:10,256 INFO L420 AbstractCegarLoop]: === Iteration 586 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:07:10,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:07:10,256 INFO L85 PathProgramCache]: Analyzing trace with hash 1868207283, now seen corresponding path program 1 times [2022-12-06 00:07:10,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:07:10,256 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670677319] [2022-12-06 00:07:10,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:07:10,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:07:10,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:07:10,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-06 00:07:10,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:07:10,314 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670677319] [2022-12-06 00:07:10,314 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1670677319] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:07:10,314 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:07:10,314 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:07:10,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577652666] [2022-12-06 00:07:10,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:07:10,314 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:07:10,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:07:10,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:07:10,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:07:10,314 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:07:10,314 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:10,315 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:07:10,315 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:07:10,315 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:07:10,588 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:07:10,588 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 00:07:10,593 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26965/27010 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13517 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:07:10,600 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:07:10,600 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:07:10,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:07:10,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:07:10,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:07:10,601 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:07:10,601 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:07:10,601 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:07:10,635 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:07:10,636 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:10,636 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:07:10,636 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:07:10,636 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:07:10,636 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:10,637 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:07:10,637 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:07:10,637 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:10,637 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:10,661 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:07:10,661 INFO L131 PetriNetUnfolder]: For 3123/3264 co-relation queries the response was YES. [2022-12-06 00:07:10,662 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3123/3264 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2984 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:07:10,663 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:10,664 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:07:10,815 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:07:10,816 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 180 [2022-12-06 00:07:10,816 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:07:10,816 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:10,816 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:07:10,816 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:07:10,816 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable585 [2022-12-06 00:07:10,816 INFO L420 AbstractCegarLoop]: === Iteration 587 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:07:10,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:07:10,816 INFO L85 PathProgramCache]: Analyzing trace with hash -683949678, now seen corresponding path program 1 times [2022-12-06 00:07:10,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:07:10,816 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904428076] [2022-12-06 00:07:10,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:07:10,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:07:10,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:07:10,880 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-06 00:07:10,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:07:10,880 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904428076] [2022-12-06 00:07:10,880 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1904428076] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:07:10,880 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:07:10,880 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:07:10,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697879385] [2022-12-06 00:07:10,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:07:10,881 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:07:10,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:07:10,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:07:10,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:07:10,881 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:07:10,881 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:10,881 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:07:10,881 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:07:10,881 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:07:11,167 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:07:11,168 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 00:07:11,174 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26965/27010 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13517 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:07:11,181 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:07:11,181 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:07:11,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:07:11,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:07:11,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:07:11,182 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:07:11,182 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:07:11,182 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:07:11,217 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:07:11,219 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:11,219 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:07:11,219 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:07:11,219 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:07:11,219 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:11,219 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:07:11,219 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:07:11,219 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:11,220 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:11,243 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:07:11,244 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 00:07:11,244 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3133/3273 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2987 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:07:11,246 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:11,246 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:07:11,410 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:07:11,411 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 192 [2022-12-06 00:07:11,411 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:07:11,411 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:11,411 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:07:11,411 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:07:11,411 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable586 [2022-12-06 00:07:11,411 INFO L420 AbstractCegarLoop]: === Iteration 588 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:07:11,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:07:11,412 INFO L85 PathProgramCache]: Analyzing trace with hash 1058860657, now seen corresponding path program 1 times [2022-12-06 00:07:11,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:07:11,412 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691976110] [2022-12-06 00:07:11,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:07:11,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:07:11,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:07:11,480 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-06 00:07:11,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:07:11,481 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691976110] [2022-12-06 00:07:11,481 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1691976110] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:07:11,481 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:07:11,481 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:07:11,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776162409] [2022-12-06 00:07:11,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:07:11,481 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:07:11,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:07:11,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:07:11,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:07:11,481 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:07:11,481 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:11,482 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:07:11,482 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:07:11,482 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:07:11,762 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:07:11,763 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 00:07:11,768 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26969/27014 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13520 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:07:11,775 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:07:11,775 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:07:11,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:07:11,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:07:11,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:07:11,776 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:07:11,776 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:07:11,776 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:07:11,810 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:07:11,812 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:11,812 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:07:11,812 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:07:11,812 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:07:11,812 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:11,812 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:07:11,812 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:07:11,813 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:11,813 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:11,837 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:07:11,838 INFO L131 PetriNetUnfolder]: For 3122/3262 co-relation queries the response was YES. [2022-12-06 00:07:11,838 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3122/3262 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2971 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:07:11,840 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:11,840 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:07:11,989 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:07:11,989 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 177 [2022-12-06 00:07:11,989 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:07:11,989 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:11,989 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:07:11,989 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:07:11,989 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable587 [2022-12-06 00:07:11,989 INFO L420 AbstractCegarLoop]: === Iteration 589 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:07:11,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:07:11,990 INFO L85 PathProgramCache]: Analyzing trace with hash -1493296304, now seen corresponding path program 1 times [2022-12-06 00:07:11,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:07:11,990 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563121498] [2022-12-06 00:07:11,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:07:11,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:07:12,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:07:12,075 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-06 00:07:12,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:07:12,075 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563121498] [2022-12-06 00:07:12,075 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [563121498] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:07:12,075 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:07:12,075 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:07:12,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658926044] [2022-12-06 00:07:12,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:07:12,075 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:07:12,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:07:12,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:07:12,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:07:12,076 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:07:12,076 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:12,076 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:07:12,076 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:07:12,076 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:07:12,477 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:07:12,478 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 00:07:12,484 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13567 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:07:12,491 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:07:12,491 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:07:12,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:07:12,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:07:12,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:07:12,492 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:07:12,492 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:07:12,492 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:07:12,521 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:07:12,522 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:12,522 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:07:12,522 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:07:12,522 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:07:12,522 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:12,523 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:07:12,523 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:07:12,523 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:12,523 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:12,547 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:07:12,547 INFO L131 PetriNetUnfolder]: For 3327/3536 co-relation queries the response was YES. [2022-12-06 00:07:12,548 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3327/3536 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2974 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:07:12,549 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:12,550 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:07:12,694 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:07:12,694 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 172 [2022-12-06 00:07:12,695 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:07:12,695 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:12,695 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:07:12,695 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:07:12,695 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable588 [2022-12-06 00:07:12,695 INFO L420 AbstractCegarLoop]: === Iteration 590 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:07:12,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:07:12,695 INFO L85 PathProgramCache]: Analyzing trace with hash 249514031, now seen corresponding path program 1 times [2022-12-06 00:07:12,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:07:12,695 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357393457] [2022-12-06 00:07:12,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:07:12,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:07:12,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:07:12,753 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-06 00:07:12,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:07:12,753 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357393457] [2022-12-06 00:07:12,753 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1357393457] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:07:12,753 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:07:12,753 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:07:12,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591170265] [2022-12-06 00:07:12,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:07:12,754 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:07:12,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:07:12,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:07:12,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:07:12,754 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:07:12,754 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:12,754 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:07:12,754 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:07:12,754 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:07:13,021 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:07:13,022 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 00:07:13,028 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13560 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:07:13,035 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:07:13,035 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:07:13,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:07:13,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:07:13,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:07:13,036 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:07:13,036 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:07:13,036 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:07:13,073 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:07:13,074 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:13,074 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:07:13,074 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:07:13,074 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:07:13,074 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:13,075 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:07:13,075 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:07:13,075 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:13,075 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:13,101 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:07:13,102 INFO L131 PetriNetUnfolder]: For 3293/3500 co-relation queries the response was YES. [2022-12-06 00:07:13,103 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3293/3500 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2990 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:07:13,104 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:13,105 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:07:13,249 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:07:13,249 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 175 [2022-12-06 00:07:13,249 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:07:13,249 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:13,249 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:07:13,249 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:07:13,249 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable589 [2022-12-06 00:07:13,249 INFO L420 AbstractCegarLoop]: === Iteration 591 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:07:13,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:07:13,250 INFO L85 PathProgramCache]: Analyzing trace with hash 1992324366, now seen corresponding path program 1 times [2022-12-06 00:07:13,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:07:13,250 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450989388] [2022-12-06 00:07:13,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:07:13,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:07:13,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:07:13,319 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-06 00:07:13,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:07:13,320 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1450989388] [2022-12-06 00:07:13,320 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1450989388] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:07:13,320 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:07:13,320 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:07:13,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183679494] [2022-12-06 00:07:13,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:07:13,320 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:07:13,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:07:13,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:07:13,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:07:13,320 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:07:13,321 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:13,321 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:07:13,321 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:07:13,321 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:07:13,602 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:07:13,602 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 00:07:13,608 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13575 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:07:13,616 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:07:13,616 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:07:13,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:07:13,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:07:13,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:07:13,616 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:07:13,617 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:07:13,617 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:07:13,654 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:07:13,655 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:13,655 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:07:13,655 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:07:13,655 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:07:13,655 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:13,656 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:07:13,656 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:07:13,656 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:13,656 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:13,681 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:07:13,681 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 00:07:13,682 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3321/3530 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2986 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:07:13,684 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:13,684 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:07:13,838 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:07:13,838 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 183 [2022-12-06 00:07:13,838 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:07:13,838 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:13,838 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:07:13,838 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:07:13,839 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable590 [2022-12-06 00:07:13,839 INFO L420 AbstractCegarLoop]: === Iteration 592 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:07:13,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:07:13,839 INFO L85 PathProgramCache]: Analyzing trace with hash -559832595, now seen corresponding path program 1 times [2022-12-06 00:07:13,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:07:13,839 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193898235] [2022-12-06 00:07:13,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:07:13,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:07:13,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:07:13,897 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-06 00:07:13,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:07:13,898 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193898235] [2022-12-06 00:07:13,898 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [193898235] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:07:13,898 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:07:13,898 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:07:13,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931961742] [2022-12-06 00:07:13,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:07:13,898 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:07:13,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:07:13,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:07:13,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:07:13,899 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:07:13,899 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:13,899 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:07:13,899 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:07:13,899 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:07:14,175 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:07:14,175 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:07:14,181 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13555 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:07:14,188 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:07:14,189 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:07:14,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:07:14,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:07:14,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:07:14,189 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:07:14,189 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:07:14,189 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:07:14,222 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:07:14,223 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:14,223 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:07:14,224 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:07:14,224 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:07:14,224 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:14,224 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:07:14,224 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:07:14,224 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:14,225 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:14,250 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:07:14,250 INFO L131 PetriNetUnfolder]: For 3318/3528 co-relation queries the response was YES. [2022-12-06 00:07:14,252 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3318/3528 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 3001 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:07:14,255 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:14,255 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:07:14,403 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:07:14,403 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 179 [2022-12-06 00:07:14,403 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:07:14,403 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:14,403 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:07:14,403 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:07:14,403 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable591 [2022-12-06 00:07:14,403 INFO L420 AbstractCegarLoop]: === Iteration 593 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:07:14,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:07:14,404 INFO L85 PathProgramCache]: Analyzing trace with hash 1182977740, now seen corresponding path program 1 times [2022-12-06 00:07:14,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:07:14,404 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073147652] [2022-12-06 00:07:14,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:07:14,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:07:14,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:07:14,462 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-06 00:07:14,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:07:14,462 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073147652] [2022-12-06 00:07:14,462 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1073147652] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:07:14,462 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:07:14,462 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:07:14,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687498389] [2022-12-06 00:07:14,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:07:14,463 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:07:14,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:07:14,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:07:14,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:07:14,463 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:07:14,463 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:14,463 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:07:14,463 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:07:14,463 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:07:14,748 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:07:14,748 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:07:14,754 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13573 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:07:14,761 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:07:14,762 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:07:14,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:07:14,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:07:14,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:07:14,762 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:07:14,762 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:07:14,762 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:07:14,798 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:07:14,799 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:14,799 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:07:14,800 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:07:14,800 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:07:14,800 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:14,800 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:07:14,800 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:07:14,800 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:14,801 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:14,825 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:07:14,825 INFO L131 PetriNetUnfolder]: For 3338/3550 co-relation queries the response was YES. [2022-12-06 00:07:14,826 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3338/3550 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2968 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:07:14,828 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:14,828 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:07:14,972 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:07:14,973 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 173 [2022-12-06 00:07:14,973 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:07:14,973 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:14,973 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:07:14,973 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:07:14,973 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable592 [2022-12-06 00:07:14,973 INFO L420 AbstractCegarLoop]: === Iteration 594 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:07:14,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:07:14,973 INFO L85 PathProgramCache]: Analyzing trace with hash -1369179221, now seen corresponding path program 1 times [2022-12-06 00:07:14,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:07:14,973 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104154925] [2022-12-06 00:07:14,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:07:14,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:07:14,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:07:15,032 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-06 00:07:15,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:07:15,032 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104154925] [2022-12-06 00:07:15,032 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2104154925] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:07:15,032 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:07:15,032 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:07:15,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062910547] [2022-12-06 00:07:15,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:07:15,033 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:07:15,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:07:15,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:07:15,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:07:15,033 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:07:15,033 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:15,033 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:07:15,033 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:07:15,033 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:07:15,310 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:07:15,310 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:07:15,315 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13565 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:07:15,323 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:07:15,323 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:07:15,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:07:15,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:07:15,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:07:15,324 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:07:15,324 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:07:15,324 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:07:15,387 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:07:15,388 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:15,388 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:07:15,388 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:07:15,388 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:07:15,388 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:15,389 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:07:15,389 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:07:15,389 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:15,390 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:15,413 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:07:15,413 INFO L131 PetriNetUnfolder]: For 3304/3511 co-relation queries the response was YES. [2022-12-06 00:07:15,414 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3304/3511 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2986 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:07:15,416 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:15,416 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:07:15,566 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:07:15,567 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 179 [2022-12-06 00:07:15,567 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:07:15,567 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:15,567 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:07:15,567 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:07:15,567 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable593 [2022-12-06 00:07:15,567 INFO L420 AbstractCegarLoop]: === Iteration 595 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:07:15,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:07:15,567 INFO L85 PathProgramCache]: Analyzing trace with hash 373631114, now seen corresponding path program 1 times [2022-12-06 00:07:15,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:07:15,568 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826979805] [2022-12-06 00:07:15,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:07:15,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:07:15,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:07:15,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-06 00:07:15,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:07:15,632 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826979805] [2022-12-06 00:07:15,632 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [826979805] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:07:15,632 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:07:15,632 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:07:15,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252175483] [2022-12-06 00:07:15,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:07:15,633 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:07:15,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:07:15,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:07:15,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:07:15,633 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:07:15,633 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:15,633 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:07:15,633 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:07:15,633 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:07:15,920 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:07:15,920 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 00:07:15,926 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26969/27014 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13510 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:07:15,935 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:07:15,935 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:07:15,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:07:15,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:07:15,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:07:15,936 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:07:15,936 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:07:15,936 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:07:15,972 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:07:15,973 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:15,973 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:07:15,974 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:07:15,974 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:07:15,974 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:15,974 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:07:15,974 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:07:15,974 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:15,975 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:15,999 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:07:15,999 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 00:07:16,000 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3133/3273 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2973 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:07:16,002 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:16,002 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:07:16,144 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:07:16,144 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 170 [2022-12-06 00:07:16,144 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:07:16,145 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:16,145 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:07:16,145 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:07:16,145 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable594 [2022-12-06 00:07:16,145 INFO L420 AbstractCegarLoop]: === Iteration 596 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:07:16,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:07:16,145 INFO L85 PathProgramCache]: Analyzing trace with hash 2116441449, now seen corresponding path program 1 times [2022-12-06 00:07:16,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:07:16,145 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735904992] [2022-12-06 00:07:16,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:07:16,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:07:16,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:07:16,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-06 00:07:16,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:07:16,211 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735904992] [2022-12-06 00:07:16,211 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [735904992] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:07:16,211 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:07:16,211 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:07:16,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195222584] [2022-12-06 00:07:16,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:07:16,211 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:07:16,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:07:16,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:07:16,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:07:16,211 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:07:16,212 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:16,212 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:07:16,212 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:07:16,212 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:07:16,498 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:07:16,498 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 00:07:16,504 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26965/27010 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13532 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:07:16,511 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:07:16,511 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:07:16,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:07:16,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:07:16,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:07:16,512 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:07:16,512 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:07:16,512 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:07:16,548 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:07:16,549 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:16,549 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:07:16,550 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:07:16,550 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:07:16,550 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:16,550 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:07:16,550 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:07:16,550 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:16,551 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:16,575 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:07:16,575 INFO L131 PetriNetUnfolder]: For 3122/3262 co-relation queries the response was YES. [2022-12-06 00:07:16,576 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3122/3262 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2983 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:07:16,578 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:16,578 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:07:16,738 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:07:16,738 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 188 [2022-12-06 00:07:16,738 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:07:16,738 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:16,738 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:07:16,738 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:07:16,738 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable595 [2022-12-06 00:07:16,738 INFO L420 AbstractCegarLoop]: === Iteration 597 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:07:16,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:07:16,739 INFO L85 PathProgramCache]: Analyzing trace with hash -435715512, now seen corresponding path program 1 times [2022-12-06 00:07:16,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:07:16,739 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8743053] [2022-12-06 00:07:16,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:07:16,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:07:16,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:07:16,806 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-06 00:07:16,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:07:16,806 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8743053] [2022-12-06 00:07:16,806 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [8743053] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:07:16,806 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:07:16,806 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:07:16,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498754020] [2022-12-06 00:07:16,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:07:16,807 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:07:16,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:07:16,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:07:16,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:07:16,807 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:07:16,807 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:16,807 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:07:16,807 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:07:16,807 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:07:17,094 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:07:17,094 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 00:07:17,100 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13564 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:07:17,107 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:07:17,107 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:07:17,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:07:17,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:07:17,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:07:17,108 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:07:17,108 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:07:17,108 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:07:17,142 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:07:17,143 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:17,143 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:07:17,143 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:07:17,143 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:07:17,143 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:17,144 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:07:17,144 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:07:17,144 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:17,145 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:17,176 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:07:17,176 INFO L131 PetriNetUnfolder]: For 3338/3547 co-relation queries the response was YES. [2022-12-06 00:07:17,177 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3338/3547 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2977 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:07:17,179 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:17,179 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:07:17,340 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:07:17,340 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 197 [2022-12-06 00:07:17,340 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:07:17,340 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:17,341 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:07:17,341 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:07:17,341 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable596 [2022-12-06 00:07:17,341 INFO L420 AbstractCegarLoop]: === Iteration 598 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:07:17,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:07:17,341 INFO L85 PathProgramCache]: Analyzing trace with hash 1307094823, now seen corresponding path program 1 times [2022-12-06 00:07:17,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:07:17,341 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032301430] [2022-12-06 00:07:17,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:07:17,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:07:17,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:07:17,410 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-06 00:07:17,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:07:17,411 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032301430] [2022-12-06 00:07:17,411 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2032301430] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:07:17,411 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:07:17,411 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:07:17,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263141057] [2022-12-06 00:07:17,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:07:17,411 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:07:17,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:07:17,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:07:17,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:07:17,411 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:07:17,411 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:17,411 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:07:17,412 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:07:17,412 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:07:17,691 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:07:17,692 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:07:17,697 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13558 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:07:17,705 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:07:17,705 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:07:17,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:07:17,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:07:17,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:07:17,706 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:07:17,706 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:07:17,706 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:07:17,741 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:07:17,742 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:17,742 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:07:17,742 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:07:17,743 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:07:17,743 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:17,743 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:07:17,743 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:07:17,743 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:17,744 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:17,768 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:07:17,768 INFO L131 PetriNetUnfolder]: For 3293/3500 co-relation queries the response was YES. [2022-12-06 00:07:17,769 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3293/3500 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2986 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:07:17,771 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:17,771 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:07:17,923 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:07:17,924 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 181 [2022-12-06 00:07:17,924 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:07:17,924 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:17,924 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:07:17,924 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:07:17,924 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable597 [2022-12-06 00:07:17,924 INFO L420 AbstractCegarLoop]: === Iteration 599 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:07:17,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:07:17,924 INFO L85 PathProgramCache]: Analyzing trace with hash -1245062138, now seen corresponding path program 1 times [2022-12-06 00:07:17,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:07:17,924 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379777868] [2022-12-06 00:07:17,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:07:17,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:07:17,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:07:17,982 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-06 00:07:17,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:07:17,983 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379777868] [2022-12-06 00:07:17,983 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1379777868] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:07:17,983 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:07:17,983 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:07:17,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268654763] [2022-12-06 00:07:17,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:07:17,983 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:07:17,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:07:17,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:07:17,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:07:17,984 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:07:17,984 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:17,984 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:07:17,984 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:07:17,984 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:07:18,262 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:07:18,263 INFO L131 PetriNetUnfolder]: For 27136/27181 co-relation queries the response was YES. [2022-12-06 00:07:18,268 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27136/27181 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13535 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:07:18,276 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:07:18,276 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:07:18,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:07:18,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:07:18,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:07:18,277 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:07:18,277 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:07:18,277 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:07:18,312 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:07:18,313 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:18,313 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:07:18,313 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:07:18,313 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:07:18,313 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:18,314 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:07:18,314 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:07:18,314 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:18,315 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:18,349 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:07:18,350 INFO L131 PetriNetUnfolder]: For 3167/3307 co-relation queries the response was YES. [2022-12-06 00:07:18,350 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3167/3307 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2999 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:07:18,352 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:18,352 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:07:18,496 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:07:18,497 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 184 [2022-12-06 00:07:18,497 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:07:18,497 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:18,497 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:07:18,497 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:07:18,497 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable598 [2022-12-06 00:07:18,497 INFO L420 AbstractCegarLoop]: === Iteration 600 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:07:18,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:07:18,497 INFO L85 PathProgramCache]: Analyzing trace with hash 497748197, now seen corresponding path program 1 times [2022-12-06 00:07:18,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:07:18,498 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353156821] [2022-12-06 00:07:18,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:07:18,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:07:18,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:07:18,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-06 00:07:18,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:07:18,569 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353156821] [2022-12-06 00:07:18,569 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1353156821] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:07:18,569 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:07:18,569 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:07:18,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524758400] [2022-12-06 00:07:18,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:07:18,569 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:07:18,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:07:18,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:07:18,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:07:18,569 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:07:18,569 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:18,570 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:07:18,570 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:07:18,570 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:07:18,864 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:07:18,864 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 00:07:18,870 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26969/27014 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13520 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:07:18,877 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:07:18,877 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:07:18,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:07:18,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:07:18,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:07:18,878 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:07:18,878 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:07:18,878 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:07:18,915 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:07:18,916 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:18,916 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:07:18,917 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:07:18,917 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:07:18,917 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:18,917 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:07:18,917 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:07:18,917 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:18,918 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:18,942 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:07:18,942 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 00:07:18,943 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3133/3273 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2975 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:07:18,945 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:18,945 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:07:19,099 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:07:19,099 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 182 [2022-12-06 00:07:19,099 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:07:19,099 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:19,099 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:07:19,099 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:07:19,099 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable599 [2022-12-06 00:07:19,099 INFO L420 AbstractCegarLoop]: === Iteration 601 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:07:19,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:07:19,100 INFO L85 PathProgramCache]: Analyzing trace with hash -2054408764, now seen corresponding path program 1 times [2022-12-06 00:07:19,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:07:19,100 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130048504] [2022-12-06 00:07:19,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:07:19,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:07:19,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:07:19,169 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-06 00:07:19,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:07:19,169 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130048504] [2022-12-06 00:07:19,169 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [130048504] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:07:19,169 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:07:19,170 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:07:19,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436554459] [2022-12-06 00:07:19,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:07:19,170 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:07:19,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:07:19,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:07:19,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:07:19,170 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:07:19,170 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:19,170 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:07:19,170 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:07:19,170 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:07:19,448 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:07:19,448 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:07:19,454 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13554 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:07:19,461 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:07:19,461 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:07:19,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:07:19,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:07:19,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:07:19,462 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:07:19,462 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:07:19,462 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:07:19,498 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:07:19,499 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:19,499 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:07:19,499 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:07:19,499 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:07:19,499 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:19,500 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:07:19,500 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:07:19,500 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:19,500 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:19,524 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:07:19,524 INFO L131 PetriNetUnfolder]: For 3348/3558 co-relation queries the response was YES. [2022-12-06 00:07:19,525 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3348/3558 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2967 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:07:19,527 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:19,527 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:07:19,672 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:07:19,673 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 174 [2022-12-06 00:07:19,673 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:07:19,673 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:19,673 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:07:19,673 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:07:19,673 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable600 [2022-12-06 00:07:19,673 INFO L420 AbstractCegarLoop]: === Iteration 602 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:07:19,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:07:19,673 INFO L85 PathProgramCache]: Analyzing trace with hash -311598429, now seen corresponding path program 1 times [2022-12-06 00:07:19,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:07:19,673 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054563370] [2022-12-06 00:07:19,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:07:19,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:07:19,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:07:19,733 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-06 00:07:19,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:07:19,733 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054563370] [2022-12-06 00:07:19,733 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1054563370] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:07:19,733 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:07:19,733 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:07:19,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934963250] [2022-12-06 00:07:19,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:07:19,733 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:07:19,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:07:19,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:07:19,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:07:19,734 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:07:19,734 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:19,734 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:07:19,734 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:07:19,734 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:07:20,018 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:07:20,018 INFO L131 PetriNetUnfolder]: For 27229/27274 co-relation queries the response was YES. [2022-12-06 00:07:20,023 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27229/27274 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13554 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:07:20,031 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:07:20,031 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:07:20,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:07:20,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:07:20,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:07:20,031 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:07:20,032 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:07:20,032 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:07:20,065 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:07:20,066 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:20,066 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:07:20,066 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:07:20,066 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:07:20,066 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:20,066 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:07:20,066 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:07:20,067 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:20,067 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:20,091 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:07:20,091 INFO L131 PetriNetUnfolder]: For 3304/3511 co-relation queries the response was YES. [2022-12-06 00:07:20,092 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3304/3511 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 3006 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:07:20,094 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:20,094 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:07:20,239 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:07:20,240 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 174 [2022-12-06 00:07:20,240 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:07:20,240 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:20,240 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:07:20,240 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:07:20,240 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable601 [2022-12-06 00:07:20,240 INFO L420 AbstractCegarLoop]: === Iteration 603 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:07:20,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:07:20,240 INFO L85 PathProgramCache]: Analyzing trace with hash 1431211906, now seen corresponding path program 1 times [2022-12-06 00:07:20,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:07:20,240 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097006408] [2022-12-06 00:07:20,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:07:20,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:07:20,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:07:20,307 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-06 00:07:20,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:07:20,308 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097006408] [2022-12-06 00:07:20,308 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1097006408] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:07:20,308 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:07:20,308 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:07:20,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117559210] [2022-12-06 00:07:20,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:07:20,308 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:07:20,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:07:20,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:07:20,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:07:20,308 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:07:20,309 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:20,309 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:07:20,309 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:07:20,309 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:07:20,591 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:07:20,592 INFO L131 PetriNetUnfolder]: For 27150/27195 co-relation queries the response was YES. [2022-12-06 00:07:20,597 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27150/27195 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13525 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:07:20,605 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:07:20,605 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:07:20,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:07:20,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:07:20,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:07:20,606 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:07:20,606 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:07:20,606 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:07:20,640 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:07:20,641 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:20,641 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:07:20,642 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:07:20,642 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:07:20,642 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:20,642 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:07:20,642 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:07:20,642 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:20,643 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:20,667 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:07:20,667 INFO L131 PetriNetUnfolder]: For 3167/3307 co-relation queries the response was YES. [2022-12-06 00:07:20,668 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3167/3307 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2999 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:07:20,670 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:20,670 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:07:20,824 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:07:20,824 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 182 [2022-12-06 00:07:20,824 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:07:20,824 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:20,824 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:07:20,825 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:07:20,825 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable602 [2022-12-06 00:07:20,825 INFO L420 AbstractCegarLoop]: === Iteration 604 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:07:20,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:07:20,825 INFO L85 PathProgramCache]: Analyzing trace with hash -1120945055, now seen corresponding path program 1 times [2022-12-06 00:07:20,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:07:20,825 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094353530] [2022-12-06 00:07:20,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:07:20,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:07:20,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:07:20,884 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-06 00:07:20,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:07:20,884 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094353530] [2022-12-06 00:07:20,884 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2094353530] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:07:20,884 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:07:20,884 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:07:20,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929289561] [2022-12-06 00:07:20,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:07:20,885 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:07:20,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:07:20,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:07:20,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:07:20,885 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:07:20,885 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:20,885 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:07:20,885 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:07:20,885 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:07:21,201 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:07:21,201 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 00:07:21,207 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26969/27014 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13540 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:07:21,214 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:07:21,214 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:07:21,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:07:21,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:07:21,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:07:21,215 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:07:21,215 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:07:21,215 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:07:21,252 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:07:21,253 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:21,253 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:07:21,254 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:07:21,254 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:07:21,254 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:21,254 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:07:21,254 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:07:21,254 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:21,255 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:21,286 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:07:21,286 INFO L131 PetriNetUnfolder]: For 3122/3262 co-relation queries the response was YES. [2022-12-06 00:07:21,287 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3122/3262 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2977 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:07:21,290 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:21,290 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:07:21,451 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:07:21,451 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 197 [2022-12-06 00:07:21,451 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:07:21,451 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:21,451 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:07:21,451 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:07:21,452 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable603 [2022-12-06 00:07:21,452 INFO L420 AbstractCegarLoop]: === Iteration 605 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:07:21,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:07:21,452 INFO L85 PathProgramCache]: Analyzing trace with hash 621865280, now seen corresponding path program 1 times [2022-12-06 00:07:21,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:07:21,452 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131829916] [2022-12-06 00:07:21,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:07:21,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:07:21,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:07:21,525 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-06 00:07:21,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:07:21,526 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131829916] [2022-12-06 00:07:21,526 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [131829916] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:07:21,526 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:07:21,526 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:07:21,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313035078] [2022-12-06 00:07:21,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:07:21,526 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:07:21,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:07:21,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:07:21,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:07:21,527 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:07:21,527 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:21,527 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:07:21,527 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:07:21,527 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:07:21,809 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:07:21,809 INFO L131 PetriNetUnfolder]: For 27136/27181 co-relation queries the response was YES. [2022-12-06 00:07:21,815 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27136/27181 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13561 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:07:21,823 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:07:21,823 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:07:21,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:07:21,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:07:21,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:07:21,824 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:07:21,824 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:07:21,824 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:07:21,858 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:07:21,859 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:21,859 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:07:21,859 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:07:21,859 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:07:21,859 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:21,860 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:07:21,860 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:07:21,860 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:21,860 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:21,884 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:07:21,884 INFO L131 PetriNetUnfolder]: For 3180/3321 co-relation queries the response was YES. [2022-12-06 00:07:21,885 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3180/3321 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2996 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:07:21,887 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:21,887 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:07:22,037 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:07:22,037 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 178 [2022-12-06 00:07:22,037 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:07:22,037 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:22,038 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:07:22,038 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:07:22,038 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable604 [2022-12-06 00:07:22,038 INFO L420 AbstractCegarLoop]: === Iteration 606 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:07:22,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:07:22,038 INFO L85 PathProgramCache]: Analyzing trace with hash -1930291681, now seen corresponding path program 1 times [2022-12-06 00:07:22,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:07:22,038 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581474501] [2022-12-06 00:07:22,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:07:22,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:07:22,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:07:22,098 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-06 00:07:22,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:07:22,098 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581474501] [2022-12-06 00:07:22,098 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [581474501] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:07:22,098 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:07:22,098 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:07:22,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397920837] [2022-12-06 00:07:22,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:07:22,099 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:07:22,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:07:22,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:07:22,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:07:22,099 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:07:22,099 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:22,099 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:07:22,099 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:07:22,099 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:07:22,377 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:07:22,377 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:07:22,383 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13553 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:07:22,391 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:07:22,391 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:07:22,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:07:22,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:07:22,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:07:22,392 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:07:22,392 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:07:22,392 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:07:22,426 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:07:22,427 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:22,427 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:07:22,428 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:07:22,428 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:07:22,428 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:22,428 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:07:22,428 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:07:22,428 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:22,429 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:22,453 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:07:22,453 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 00:07:22,454 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3312/3520 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2992 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:07:22,456 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:22,456 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:07:22,598 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:07:22,598 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 170 [2022-12-06 00:07:22,598 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:07:22,599 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:22,599 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:07:22,599 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:07:22,599 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable605 [2022-12-06 00:07:22,599 INFO L420 AbstractCegarLoop]: === Iteration 607 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:07:22,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:07:22,599 INFO L85 PathProgramCache]: Analyzing trace with hash -187481346, now seen corresponding path program 1 times [2022-12-06 00:07:22,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:07:22,599 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085032869] [2022-12-06 00:07:22,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:07:22,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:07:22,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:07:22,661 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-06 00:07:22,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:07:22,661 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085032869] [2022-12-06 00:07:22,661 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1085032869] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:07:22,661 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:07:22,661 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:07:22,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456923004] [2022-12-06 00:07:22,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:07:22,661 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:07:22,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:07:22,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:07:22,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:07:22,662 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:07:22,662 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:22,662 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:07:22,662 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:07:22,662 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:07:22,972 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:07:22,972 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:07:22,977 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13560 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:07:22,983 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:07:22,984 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:07:22,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:07:22,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:07:22,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:07:22,984 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:07:22,984 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:07:22,984 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:07:23,017 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:07:23,018 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:23,018 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:07:23,019 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:07:23,019 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:07:23,019 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:23,019 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:07:23,020 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:07:23,020 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:23,020 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:23,047 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:07:23,047 INFO L131 PetriNetUnfolder]: For 3301/3509 co-relation queries the response was YES. [2022-12-06 00:07:23,048 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3301/3509 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2971 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:07:23,050 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:23,051 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:07:23,205 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:07:23,206 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 187 [2022-12-06 00:07:23,206 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:07:23,206 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:23,206 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:07:23,206 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:07:23,206 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable606 [2022-12-06 00:07:23,206 INFO L420 AbstractCegarLoop]: === Iteration 608 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:07:23,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:07:23,207 INFO L85 PathProgramCache]: Analyzing trace with hash 1555328989, now seen corresponding path program 1 times [2022-12-06 00:07:23,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:07:23,207 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211903222] [2022-12-06 00:07:23,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:07:23,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:07:23,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:07:23,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-06 00:07:23,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:07:23,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211903222] [2022-12-06 00:07:23,270 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [211903222] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:07:23,270 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:07:23,270 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:07:23,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384786142] [2022-12-06 00:07:23,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:07:23,270 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:07:23,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:07:23,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:07:23,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:07:23,270 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:07:23,270 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:23,270 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:07:23,271 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:07:23,271 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:07:23,547 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:07:23,548 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 00:07:23,554 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13562 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:07:23,562 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:07:23,562 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:07:23,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:07:23,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:07:23,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:07:23,563 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:07:23,563 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:07:23,563 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:07:23,600 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:07:23,601 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:23,601 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:07:23,601 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:07:23,601 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:07:23,601 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:23,602 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:07:23,602 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:07:23,602 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:23,602 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:23,628 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:07:23,628 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 00:07:23,629 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3321/3530 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2960 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:07:23,631 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:23,631 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:07:23,798 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:07:23,798 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 197 [2022-12-06 00:07:23,798 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:07:23,798 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:23,798 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:07:23,799 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:07:23,799 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable607 [2022-12-06 00:07:23,799 INFO L420 AbstractCegarLoop]: === Iteration 609 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:07:23,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:07:23,799 INFO L85 PathProgramCache]: Analyzing trace with hash -996827972, now seen corresponding path program 1 times [2022-12-06 00:07:23,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:07:23,799 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82582740] [2022-12-06 00:07:23,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:07:23,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:07:23,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:07:23,872 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-06 00:07:23,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:07:23,873 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82582740] [2022-12-06 00:07:23,873 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [82582740] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:07:23,873 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:07:23,873 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:07:23,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882722518] [2022-12-06 00:07:23,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:07:23,873 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:07:23,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:07:23,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:07:23,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:07:23,873 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:07:23,874 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:23,874 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:07:23,874 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:07:23,874 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:07:24,167 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:07:24,168 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:07:24,174 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13568 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:07:24,182 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:07:24,182 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:07:24,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:07:24,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:07:24,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:07:24,183 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:07:24,183 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:07:24,183 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:07:24,220 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:07:24,221 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:24,221 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:07:24,222 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:07:24,222 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:07:24,222 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:24,222 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:07:24,222 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:07:24,222 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:24,223 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:24,248 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:07:24,248 INFO L131 PetriNetUnfolder]: For 3338/3547 co-relation queries the response was YES. [2022-12-06 00:07:24,249 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3338/3547 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2970 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:07:24,252 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:24,252 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:07:24,403 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:07:24,403 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 181 [2022-12-06 00:07:24,403 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:07:24,403 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:24,403 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:07:24,403 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:07:24,404 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable608 [2022-12-06 00:07:24,404 INFO L420 AbstractCegarLoop]: === Iteration 610 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:07:24,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:07:24,404 INFO L85 PathProgramCache]: Analyzing trace with hash 745982363, now seen corresponding path program 1 times [2022-12-06 00:07:24,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:07:24,404 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108170335] [2022-12-06 00:07:24,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:07:24,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:07:24,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:07:24,465 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-06 00:07:24,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:07:24,465 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108170335] [2022-12-06 00:07:24,465 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1108170335] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:07:24,465 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:07:24,465 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:07:24,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369290190] [2022-12-06 00:07:24,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:07:24,466 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:07:24,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:07:24,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:07:24,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:07:24,466 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:07:24,466 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:24,466 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:07:24,466 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:07:24,466 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:07:24,761 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:07:24,761 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 00:07:24,767 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26965/27010 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13515 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:07:24,775 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:07:24,775 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:07:24,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:07:24,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:07:24,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:07:24,776 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:07:24,776 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:07:24,776 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:07:24,813 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:07:24,814 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:24,814 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:07:24,814 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:07:24,814 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:07:24,814 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:24,815 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:07:24,815 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:07:24,815 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:24,815 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:24,840 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:07:24,840 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 00:07:24,841 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3133/3273 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2984 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:07:24,843 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:24,843 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:07:24,990 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:07:24,990 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 176 [2022-12-06 00:07:24,990 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:07:24,990 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:24,990 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:07:24,990 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:07:24,991 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable609 [2022-12-06 00:07:24,991 INFO L420 AbstractCegarLoop]: === Iteration 611 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:07:24,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:07:24,991 INFO L85 PathProgramCache]: Analyzing trace with hash -1806174598, now seen corresponding path program 1 times [2022-12-06 00:07:24,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:07:24,991 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892581037] [2022-12-06 00:07:24,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:07:24,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:07:25,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:07:25,053 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-06 00:07:25,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:07:25,053 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892581037] [2022-12-06 00:07:25,053 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1892581037] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:07:25,053 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:07:25,053 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:07:25,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545902007] [2022-12-06 00:07:25,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:07:25,053 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:07:25,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:07:25,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:07:25,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:07:25,054 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:07:25,054 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:25,054 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:07:25,054 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:07:25,054 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:07:25,343 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:07:25,344 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 00:07:25,349 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26969/27014 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13516 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:07:25,357 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:07:25,358 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:07:25,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:07:25,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:07:25,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:07:25,358 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:07:25,358 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:07:25,358 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:07:25,398 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:07:25,399 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:25,399 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:07:25,400 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:07:25,400 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:07:25,400 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:25,400 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:07:25,400 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:07:25,400 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:25,401 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:25,425 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:07:25,425 INFO L131 PetriNetUnfolder]: For 3134/3275 co-relation queries the response was YES. [2022-12-06 00:07:25,426 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3134/3275 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2989 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:07:25,428 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:25,429 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:07:25,570 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:07:25,570 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 170 [2022-12-06 00:07:25,570 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:07:25,570 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:25,571 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:07:25,571 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:07:25,571 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable610 [2022-12-06 00:07:25,571 INFO L420 AbstractCegarLoop]: === Iteration 612 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:07:25,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:07:25,571 INFO L85 PathProgramCache]: Analyzing trace with hash -63364263, now seen corresponding path program 1 times [2022-12-06 00:07:25,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:07:25,571 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263137249] [2022-12-06 00:07:25,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:07:25,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:07:25,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:07:25,665 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-06 00:07:25,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:07:25,665 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263137249] [2022-12-06 00:07:25,665 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1263137249] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:07:25,665 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:07:25,665 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:07:25,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69587099] [2022-12-06 00:07:25,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:07:25,665 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:07:25,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:07:25,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:07:25,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:07:25,666 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:07:25,666 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:25,666 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:07:25,666 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:07:25,666 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:07:26,051 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:07:26,052 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 00:07:26,058 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26965/27010 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13545 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:07:26,094 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:07:26,094 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:07:26,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:07:26,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:07:26,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:07:26,095 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:07:26,095 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:07:26,095 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:07:26,129 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:07:26,130 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:26,131 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:07:26,131 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:07:26,131 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:07:26,131 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:26,131 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:07:26,131 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:07:26,131 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:26,132 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:26,158 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:07:26,158 INFO L131 PetriNetUnfolder]: For 3122/3262 co-relation queries the response was YES. [2022-12-06 00:07:26,159 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3122/3262 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2994 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:07:26,161 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:26,161 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:07:26,319 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:07:26,319 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 188 [2022-12-06 00:07:26,320 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:07:26,320 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:26,320 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:07:26,320 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:07:26,320 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable611 [2022-12-06 00:07:26,320 INFO L420 AbstractCegarLoop]: === Iteration 613 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:07:26,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:07:26,320 INFO L85 PathProgramCache]: Analyzing trace with hash 1679446072, now seen corresponding path program 1 times [2022-12-06 00:07:26,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:07:26,320 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100115058] [2022-12-06 00:07:26,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:07:26,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:07:26,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:07:26,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-06 00:07:26,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:07:26,386 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100115058] [2022-12-06 00:07:26,386 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [100115058] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:07:26,386 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:07:26,386 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:07:26,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792052676] [2022-12-06 00:07:26,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:07:26,386 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:07:26,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:07:26,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:07:26,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:07:26,386 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:07:26,387 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:26,387 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:07:26,387 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:07:26,387 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:07:26,674 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:07:26,674 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:07:26,680 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13536 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:07:26,688 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:07:26,688 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:07:26,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:07:26,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:07:26,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:07:26,688 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:07:26,689 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:07:26,689 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:07:26,726 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:07:26,727 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:26,727 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:07:26,727 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:07:26,727 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:07:26,727 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:26,728 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:07:26,728 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:07:26,728 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:26,728 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:26,753 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:07:26,753 INFO L131 PetriNetUnfolder]: For 3348/3558 co-relation queries the response was YES. [2022-12-06 00:07:26,754 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3348/3558 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2980 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:07:26,756 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:26,756 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:07:26,906 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:07:26,907 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 180 [2022-12-06 00:07:26,907 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:07:26,907 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:26,907 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:07:26,907 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:07:26,907 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable612 [2022-12-06 00:07:26,907 INFO L420 AbstractCegarLoop]: === Iteration 614 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:07:26,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:07:26,907 INFO L85 PathProgramCache]: Analyzing trace with hash -872710889, now seen corresponding path program 1 times [2022-12-06 00:07:26,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:07:26,908 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899750727] [2022-12-06 00:07:26,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:07:26,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:07:26,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:07:26,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:07:26,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:07:26,975 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899750727] [2022-12-06 00:07:26,975 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1899750727] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:07:26,975 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:07:26,975 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:07:26,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64925699] [2022-12-06 00:07:26,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:07:26,975 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:07:26,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:07:26,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:07:26,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:07:26,976 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:07:26,976 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:26,976 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:07:26,976 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:07:26,976 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:07:27,259 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:07:27,259 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:07:27,265 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13550 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:07:27,274 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:07:27,274 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:07:27,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:07:27,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:07:27,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:07:27,275 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:07:27,275 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:07:27,275 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:07:27,310 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:07:27,311 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:27,311 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:07:27,311 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:07:27,312 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:07:27,312 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:27,312 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:07:27,312 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:07:27,312 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:27,313 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:27,338 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:07:27,338 INFO L131 PetriNetUnfolder]: For 3293/3500 co-relation queries the response was YES. [2022-12-06 00:07:27,339 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3293/3500 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2980 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:07:27,341 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:27,341 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:07:27,481 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:07:27,481 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 169 [2022-12-06 00:07:27,481 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:07:27,481 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:27,481 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:07:27,481 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:07:27,481 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable613 [2022-12-06 00:07:27,481 INFO L420 AbstractCegarLoop]: === Iteration 615 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:07:27,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:07:27,482 INFO L85 PathProgramCache]: Analyzing trace with hash 870099446, now seen corresponding path program 1 times [2022-12-06 00:07:27,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:07:27,482 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109653179] [2022-12-06 00:07:27,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:07:27,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:07:27,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:07:27,540 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-06 00:07:27,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:07:27,540 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109653179] [2022-12-06 00:07:27,540 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2109653179] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:07:27,540 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:07:27,540 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:07:27,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689897417] [2022-12-06 00:07:27,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:07:27,540 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:07:27,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:07:27,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:07:27,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:07:27,541 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:07:27,541 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:27,541 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:07:27,541 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:07:27,541 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:07:27,823 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:07:27,823 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:07:27,829 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13550 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:07:27,838 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:07:27,838 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:07:27,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:07:27,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:07:27,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:07:27,839 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:07:27,839 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:07:27,839 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:07:27,875 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:07:27,876 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:27,876 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:07:27,877 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:07:27,877 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:07:27,877 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:27,877 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:07:27,877 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:07:27,878 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:27,878 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:27,915 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:07:27,915 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 00:07:27,916 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3321/3530 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2989 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:07:27,919 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:27,919 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:07:28,097 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:07:28,097 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 220 [2022-12-06 00:07:28,097 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:07:28,097 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:28,097 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:07:28,097 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:07:28,098 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable614 [2022-12-06 00:07:28,098 INFO L420 AbstractCegarLoop]: === Iteration 616 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:07:28,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:07:28,098 INFO L85 PathProgramCache]: Analyzing trace with hash -1682057515, now seen corresponding path program 1 times [2022-12-06 00:07:28,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:07:28,098 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622165802] [2022-12-06 00:07:28,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:07:28,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:07:28,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:07:28,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-06 00:07:28,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:07:28,190 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622165802] [2022-12-06 00:07:28,190 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [622165802] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:07:28,190 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:07:28,190 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:07:28,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739703346] [2022-12-06 00:07:28,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:07:28,190 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:07:28,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:07:28,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:07:28,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:07:28,191 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:07:28,191 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:28,191 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:07:28,191 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:07:28,191 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:07:28,486 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:07:28,487 INFO L131 PetriNetUnfolder]: For 27146/27191 co-relation queries the response was YES. [2022-12-06 00:07:28,493 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27146/27191 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13536 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:07:28,500 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:07:28,501 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:07:28,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:07:28,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:07:28,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:07:28,501 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:07:28,501 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:07:28,502 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:07:28,538 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:07:28,539 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:28,539 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:07:28,539 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:07:28,540 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:07:28,540 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:28,540 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:07:28,540 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:07:28,540 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:28,541 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:28,565 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:07:28,565 INFO L131 PetriNetUnfolder]: For 3156/3296 co-relation queries the response was YES. [2022-12-06 00:07:28,566 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3156/3296 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 3005 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:07:28,568 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:28,568 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:07:28,721 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:07:28,721 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 181 [2022-12-06 00:07:28,721 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:07:28,722 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:28,722 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:07:28,722 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:07:28,722 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable615 [2022-12-06 00:07:28,722 INFO L420 AbstractCegarLoop]: === Iteration 617 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:07:28,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:07:28,722 INFO L85 PathProgramCache]: Analyzing trace with hash 60752820, now seen corresponding path program 1 times [2022-12-06 00:07:28,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:07:28,722 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21768067] [2022-12-06 00:07:28,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:07:28,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:07:28,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:07:28,789 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-06 00:07:28,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:07:28,789 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21768067] [2022-12-06 00:07:28,790 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [21768067] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:07:28,790 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:07:28,790 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:07:28,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768411606] [2022-12-06 00:07:28,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:07:28,790 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:07:28,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:07:28,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:07:28,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:07:28,790 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:07:28,790 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:28,790 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:07:28,790 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:07:28,790 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:07:29,077 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:07:29,077 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 00:07:29,083 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13558 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:07:29,090 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:07:29,091 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:07:29,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:07:29,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:07:29,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:07:29,091 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:07:29,091 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:07:29,091 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:07:29,156 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:07:29,157 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:29,157 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:07:29,157 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:07:29,157 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:07:29,157 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:29,158 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:07:29,158 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:07:29,158 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:29,158 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:29,183 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:07:29,183 INFO L131 PetriNetUnfolder]: For 3338/3547 co-relation queries the response was YES. [2022-12-06 00:07:29,184 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3338/3547 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2980 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:07:29,186 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:29,186 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:07:29,346 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:07:29,346 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 189 [2022-12-06 00:07:29,346 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:07:29,346 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:29,346 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:07:29,346 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:07:29,346 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable616 [2022-12-06 00:07:29,347 INFO L420 AbstractCegarLoop]: === Iteration 618 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:07:29,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:07:29,347 INFO L85 PathProgramCache]: Analyzing trace with hash 1803563155, now seen corresponding path program 1 times [2022-12-06 00:07:29,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:07:29,347 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880030750] [2022-12-06 00:07:29,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:07:29,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:07:29,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:07:29,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-06 00:07:29,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:07:29,406 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880030750] [2022-12-06 00:07:29,406 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [880030750] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:07:29,406 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:07:29,406 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:07:29,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811629840] [2022-12-06 00:07:29,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:07:29,406 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:07:29,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:07:29,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:07:29,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:07:29,407 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:07:29,407 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:29,407 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:07:29,407 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:07:29,407 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:07:29,677 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:07:29,677 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:07:29,683 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13557 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:07:29,690 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:07:29,691 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:07:29,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:07:29,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:07:29,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:07:29,691 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:07:29,691 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:07:29,691 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:07:29,727 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:07:29,728 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:29,728 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:07:29,728 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:07:29,728 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:07:29,728 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:29,729 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:07:29,729 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:07:29,729 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:29,729 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:29,753 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:07:29,753 INFO L131 PetriNetUnfolder]: For 3298/3507 co-relation queries the response was YES. [2022-12-06 00:07:29,754 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3298/3507 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2984 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:07:29,756 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:29,756 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:07:29,901 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:07:29,901 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 173 [2022-12-06 00:07:29,901 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:07:29,901 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:29,901 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:07:29,901 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:07:29,901 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable617 [2022-12-06 00:07:29,901 INFO L420 AbstractCegarLoop]: === Iteration 619 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:07:29,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:07:29,902 INFO L85 PathProgramCache]: Analyzing trace with hash -748593806, now seen corresponding path program 1 times [2022-12-06 00:07:29,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:07:29,902 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702162025] [2022-12-06 00:07:29,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:07:29,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:07:29,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:07:29,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-06 00:07:29,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:07:29,975 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702162025] [2022-12-06 00:07:29,975 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [702162025] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:07:29,975 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:07:29,975 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:07:29,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061987172] [2022-12-06 00:07:29,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:07:29,975 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:07:29,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:07:29,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:07:29,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:07:29,976 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:07:29,976 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:29,976 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:07:29,976 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:07:29,976 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:07:30,249 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:07:30,249 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 00:07:30,254 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13585 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:07:30,261 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:07:30,262 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:07:30,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:07:30,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:07:30,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:07:30,262 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:07:30,262 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:07:30,262 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:07:30,295 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:07:30,296 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:30,297 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:07:30,297 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:07:30,297 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:07:30,297 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:30,297 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:07:30,297 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:07:30,297 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:30,298 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:30,322 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:07:30,322 INFO L131 PetriNetUnfolder]: For 3301/3509 co-relation queries the response was YES. [2022-12-06 00:07:30,323 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3301/3509 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2990 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:07:30,325 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:30,325 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:07:30,488 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:07:30,489 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 192 [2022-12-06 00:07:30,489 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:07:30,489 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:30,489 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:07:30,489 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:07:30,489 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable618 [2022-12-06 00:07:30,489 INFO L420 AbstractCegarLoop]: === Iteration 620 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:07:30,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:07:30,489 INFO L85 PathProgramCache]: Analyzing trace with hash 994216529, now seen corresponding path program 1 times [2022-12-06 00:07:30,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:07:30,490 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507755808] [2022-12-06 00:07:30,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:07:30,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:07:30,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:07:30,550 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-06 00:07:30,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:07:30,550 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507755808] [2022-12-06 00:07:30,550 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1507755808] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:07:30,550 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:07:30,550 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:07:30,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751441367] [2022-12-06 00:07:30,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:07:30,550 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:07:30,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:07:30,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:07:30,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:07:30,551 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:07:30,551 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:30,551 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:07:30,551 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:07:30,551 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:07:30,840 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:07:30,840 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 00:07:30,845 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13565 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:07:30,853 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:07:30,853 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:07:30,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:07:30,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:07:30,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:07:30,854 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:07:30,854 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:07:30,854 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:07:30,887 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:07:30,888 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:30,888 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:07:30,889 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:07:30,889 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:07:30,889 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:30,889 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:07:30,889 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:07:30,889 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:30,890 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:30,913 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:07:30,913 INFO L131 PetriNetUnfolder]: For 3297/3507 co-relation queries the response was YES. [2022-12-06 00:07:30,914 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3297/3507 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2990 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:07:30,916 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:30,916 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:07:31,064 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:07:31,064 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 175 [2022-12-06 00:07:31,064 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:07:31,064 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:31,064 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:07:31,064 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:07:31,064 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable619 [2022-12-06 00:07:31,064 INFO L420 AbstractCegarLoop]: === Iteration 621 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:07:31,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:07:31,065 INFO L85 PathProgramCache]: Analyzing trace with hash -1557940432, now seen corresponding path program 1 times [2022-12-06 00:07:31,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:07:31,065 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549118393] [2022-12-06 00:07:31,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:07:31,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:07:31,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:07:31,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-06 00:07:31,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:07:31,132 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549118393] [2022-12-06 00:07:31,132 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [549118393] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:07:31,132 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:07:31,132 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:07:31,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852318646] [2022-12-06 00:07:31,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:07:31,132 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:07:31,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:07:31,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:07:31,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:07:31,132 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:07:31,132 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:31,133 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:07:31,133 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:07:31,133 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:07:31,409 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:07:31,409 INFO L131 PetriNetUnfolder]: For 26955/27000 co-relation queries the response was YES. [2022-12-06 00:07:31,414 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26955/27000 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13531 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:07:31,420 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:07:31,420 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:07:31,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:07:31,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:07:31,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:07:31,421 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:07:31,421 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:07:31,421 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:07:31,455 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:07:31,456 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:31,456 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:07:31,456 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:07:31,456 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:07:31,456 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:31,457 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:07:31,457 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:07:31,457 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:31,457 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:31,481 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:07:31,481 INFO L131 PetriNetUnfolder]: For 3146/3287 co-relation queries the response was YES. [2022-12-06 00:07:31,482 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3146/3287 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2974 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:07:31,484 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:31,484 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:07:31,629 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:07:31,629 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 173 [2022-12-06 00:07:31,629 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:07:31,629 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:31,629 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:07:31,630 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:07:31,630 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable620 [2022-12-06 00:07:31,630 INFO L420 AbstractCegarLoop]: === Iteration 622 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:07:31,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:07:31,630 INFO L85 PathProgramCache]: Analyzing trace with hash 184869903, now seen corresponding path program 1 times [2022-12-06 00:07:31,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:07:31,630 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003963285] [2022-12-06 00:07:31,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:07:31,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:07:31,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:07:31,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-06 00:07:31,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:07:31,696 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003963285] [2022-12-06 00:07:31,696 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1003963285] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:07:31,696 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:07:31,696 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:07:31,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492109606] [2022-12-06 00:07:31,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:07:31,696 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:07:31,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:07:31,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:07:31,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:07:31,697 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:07:31,697 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:31,697 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:07:31,697 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:07:31,697 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:07:31,962 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:07:31,963 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 00:07:31,967 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26965/27010 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13511 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:07:31,974 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:07:31,974 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:07:31,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:07:31,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:07:31,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:07:31,975 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:07:31,975 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:07:31,975 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:07:32,007 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:07:32,008 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:32,008 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:07:32,008 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:07:32,008 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:07:32,009 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:32,009 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:07:32,009 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:07:32,009 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:32,010 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:32,042 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:07:32,042 INFO L131 PetriNetUnfolder]: For 3122/3262 co-relation queries the response was YES. [2022-12-06 00:07:32,043 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3122/3262 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2983 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:07:32,045 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:32,045 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:07:32,200 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:07:32,200 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 192 [2022-12-06 00:07:32,200 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:07:32,200 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:32,200 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:07:32,200 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:07:32,200 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable621 [2022-12-06 00:07:32,200 INFO L420 AbstractCegarLoop]: === Iteration 623 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:07:32,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:07:32,201 INFO L85 PathProgramCache]: Analyzing trace with hash 1927680238, now seen corresponding path program 1 times [2022-12-06 00:07:32,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:07:32,201 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11251219] [2022-12-06 00:07:32,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:07:32,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:07:32,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:07:32,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-06 00:07:32,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:07:32,265 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11251219] [2022-12-06 00:07:32,265 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [11251219] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:07:32,265 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:07:32,265 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:07:32,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393279844] [2022-12-06 00:07:32,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:07:32,266 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:07:32,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:07:32,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:07:32,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:07:32,266 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:07:32,266 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:32,266 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:07:32,266 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:07:32,266 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:07:32,527 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:07:32,527 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 00:07:32,532 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13565 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:07:32,539 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:07:32,539 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:07:32,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:07:32,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:07:32,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:07:32,540 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:07:32,540 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:07:32,540 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:07:32,576 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:07:32,577 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:32,577 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:07:32,577 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:07:32,577 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:07:32,577 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:32,578 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:07:32,578 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:07:32,578 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:32,578 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:32,602 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:07:32,602 INFO L131 PetriNetUnfolder]: For 3301/3509 co-relation queries the response was YES. [2022-12-06 00:07:32,603 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3301/3509 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2964 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:07:32,604 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:32,605 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:07:32,753 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:07:32,753 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 176 [2022-12-06 00:07:32,753 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:07:32,753 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:32,753 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:07:32,754 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:07:32,754 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable622 [2022-12-06 00:07:32,754 INFO L420 AbstractCegarLoop]: === Iteration 624 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:07:32,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:07:32,754 INFO L85 PathProgramCache]: Analyzing trace with hash -624476723, now seen corresponding path program 1 times [2022-12-06 00:07:32,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:07:32,754 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29318097] [2022-12-06 00:07:32,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:07:32,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:07:32,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:07:32,811 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-06 00:07:32,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:07:32,811 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29318097] [2022-12-06 00:07:32,811 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [29318097] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:07:32,811 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:07:32,811 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:07:32,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204453052] [2022-12-06 00:07:32,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:07:32,812 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:07:32,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:07:32,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:07:32,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:07:32,812 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:07:32,812 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:32,812 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:07:32,812 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:07:32,812 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:07:33,076 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:07:33,077 INFO L131 PetriNetUnfolder]: For 27136/27181 co-relation queries the response was YES. [2022-12-06 00:07:33,081 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27136/27181 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13543 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:07:33,088 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:07:33,088 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:07:33,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:07:33,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:07:33,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:07:33,088 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:07:33,088 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:07:33,088 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:07:33,121 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:07:33,122 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:33,122 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:07:33,122 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:07:33,122 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:07:33,123 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:33,123 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:07:33,123 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:07:33,123 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:33,124 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:33,147 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:07:33,148 INFO L131 PetriNetUnfolder]: For 3167/3307 co-relation queries the response was YES. [2022-12-06 00:07:33,148 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3167/3307 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2998 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:07:33,150 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:33,150 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:07:33,297 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:07:33,297 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 175 [2022-12-06 00:07:33,297 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:07:33,297 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:33,297 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:07:33,298 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:07:33,298 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable623 [2022-12-06 00:07:33,298 INFO L420 AbstractCegarLoop]: === Iteration 625 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:07:33,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:07:33,298 INFO L85 PathProgramCache]: Analyzing trace with hash 1118333612, now seen corresponding path program 1 times [2022-12-06 00:07:33,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:07:33,298 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615828356] [2022-12-06 00:07:33,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:07:33,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:07:33,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:07:33,363 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-06 00:07:33,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:07:33,364 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615828356] [2022-12-06 00:07:33,364 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [615828356] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:07:33,364 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:07:33,364 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:07:33,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829423387] [2022-12-06 00:07:33,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:07:33,364 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:07:33,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:07:33,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:07:33,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:07:33,364 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:07:33,364 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:33,365 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:07:33,365 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:07:33,365 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:07:33,654 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:07:33,654 INFO L131 PetriNetUnfolder]: For 27229/27274 co-relation queries the response was YES. [2022-12-06 00:07:33,659 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27229/27274 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13558 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:07:33,665 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:07:33,665 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:07:33,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:07:33,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:07:33,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:07:33,666 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:07:33,666 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:07:33,666 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:07:33,698 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:07:33,699 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:33,699 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:07:33,699 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:07:33,699 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:07:33,699 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:33,700 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:07:33,700 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:07:33,700 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:33,700 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:33,724 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:07:33,724 INFO L131 PetriNetUnfolder]: For 3337/3547 co-relation queries the response was YES. [2022-12-06 00:07:33,724 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3337/3547 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2984 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:07:33,726 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:33,726 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:07:33,881 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:07:33,881 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 182 [2022-12-06 00:07:33,881 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:07:33,881 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:33,881 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:07:33,881 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:07:33,882 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable624 [2022-12-06 00:07:33,882 INFO L420 AbstractCegarLoop]: === Iteration 626 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:07:33,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:07:33,882 INFO L85 PathProgramCache]: Analyzing trace with hash -1433823349, now seen corresponding path program 1 times [2022-12-06 00:07:33,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:07:33,882 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063021582] [2022-12-06 00:07:33,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:07:33,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:07:33,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:07:33,940 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-06 00:07:33,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:07:33,940 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063021582] [2022-12-06 00:07:33,940 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1063021582] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:07:33,940 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:07:33,940 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:07:33,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691207806] [2022-12-06 00:07:33,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:07:33,941 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:07:33,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:07:33,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:07:33,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:07:33,941 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:07:33,941 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:33,941 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:07:33,941 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:07:33,941 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:07:34,205 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:07:34,205 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 00:07:34,211 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13565 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:07:34,218 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:07:34,218 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:07:34,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:07:34,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:07:34,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:07:34,219 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:07:34,219 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:07:34,219 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:07:34,251 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:07:34,252 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:34,252 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:07:34,253 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:07:34,253 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:07:34,253 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:34,253 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:07:34,253 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:07:34,253 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:34,254 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:34,278 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:07:34,278 INFO L131 PetriNetUnfolder]: For 3304/3511 co-relation queries the response was YES. [2022-12-06 00:07:34,279 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3304/3511 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2985 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:07:34,280 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:34,280 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:07:34,419 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:07:34,420 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 167 [2022-12-06 00:07:34,420 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:07:34,420 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:34,420 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:07:34,420 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:07:34,420 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable625 [2022-12-06 00:07:34,420 INFO L420 AbstractCegarLoop]: === Iteration 627 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:07:34,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:07:34,420 INFO L85 PathProgramCache]: Analyzing trace with hash 308986986, now seen corresponding path program 1 times [2022-12-06 00:07:34,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:07:34,420 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203538897] [2022-12-06 00:07:34,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:07:34,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:07:34,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:07:34,488 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-06 00:07:34,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:07:34,488 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203538897] [2022-12-06 00:07:34,488 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [203538897] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:07:34,488 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:07:34,488 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:07:34,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319917009] [2022-12-06 00:07:34,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:07:34,488 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:07:34,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:07:34,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:07:34,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:07:34,489 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:07:34,489 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:34,489 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:07:34,489 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:07:34,489 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:07:34,768 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:07:34,768 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 00:07:34,773 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26969/27014 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13535 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:07:34,781 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:07:34,781 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:07:34,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:07:34,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:07:34,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:07:34,781 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:07:34,781 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:07:34,782 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:07:34,816 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:07:34,817 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:34,817 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:07:34,818 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:07:34,818 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:07:34,818 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:34,818 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:07:34,818 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:07:34,818 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:34,819 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:34,843 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:07:34,843 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 00:07:34,843 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3133/3273 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2968 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:07:34,845 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:34,845 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:07:34,993 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:07:34,994 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 176 [2022-12-06 00:07:34,994 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:07:34,994 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:34,994 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:07:34,994 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:07:34,994 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable626 [2022-12-06 00:07:34,994 INFO L420 AbstractCegarLoop]: === Iteration 628 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:07:34,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:07:34,994 INFO L85 PathProgramCache]: Analyzing trace with hash 2051797321, now seen corresponding path program 1 times [2022-12-06 00:07:34,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:07:34,995 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149716648] [2022-12-06 00:07:34,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:07:34,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:07:35,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:07:35,061 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-06 00:07:35,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:07:35,061 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149716648] [2022-12-06 00:07:35,061 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1149716648] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:07:35,061 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:07:35,061 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:07:35,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615887326] [2022-12-06 00:07:35,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:07:35,062 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:07:35,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:07:35,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:07:35,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:07:35,062 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:07:35,062 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:35,062 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:07:35,062 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:07:35,062 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:07:35,331 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:07:35,331 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:07:35,336 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13570 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:07:35,343 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:07:35,343 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:07:35,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:07:35,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:07:35,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:07:35,344 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:07:35,344 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:07:35,344 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:07:35,378 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:07:35,380 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:35,380 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:07:35,380 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:07:35,380 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:07:35,380 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:35,380 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:07:35,381 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:07:35,381 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:35,381 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:35,408 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:07:35,408 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 00:07:35,409 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3321/3530 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2995 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:07:35,411 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:35,411 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:07:35,555 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:07:35,555 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 175 [2022-12-06 00:07:35,556 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:07:35,556 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:35,556 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:07:35,556 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:07:35,556 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable627 [2022-12-06 00:07:35,556 INFO L420 AbstractCegarLoop]: === Iteration 629 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:07:35,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:07:35,556 INFO L85 PathProgramCache]: Analyzing trace with hash -500359640, now seen corresponding path program 1 times [2022-12-06 00:07:35,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:07:35,556 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067264255] [2022-12-06 00:07:35,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:07:35,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:07:35,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:07:35,623 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-06 00:07:35,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:07:35,624 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067264255] [2022-12-06 00:07:35,624 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1067264255] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:07:35,624 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:07:35,624 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:07:35,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89198315] [2022-12-06 00:07:35,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:07:35,624 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:07:35,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:07:35,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:07:35,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:07:35,624 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:07:35,625 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:35,625 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:07:35,625 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:07:35,625 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:07:35,903 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:07:35,903 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 00:07:35,909 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26969/27014 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13519 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:07:35,918 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:07:35,919 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:07:35,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:07:35,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:07:35,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:07:35,919 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:07:35,919 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:07:35,919 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:07:35,954 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:07:35,955 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:35,955 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:07:35,955 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:07:35,956 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:07:35,956 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:35,956 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:07:35,956 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:07:35,956 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:35,957 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:35,983 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:07:35,983 INFO L131 PetriNetUnfolder]: For 3146/3287 co-relation queries the response was YES. [2022-12-06 00:07:35,984 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3146/3287 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2974 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:07:35,987 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:35,987 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:07:36,156 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:07:36,157 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 202 [2022-12-06 00:07:36,157 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:07:36,157 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:36,157 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:07:36,157 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:07:36,157 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable628 [2022-12-06 00:07:36,157 INFO L420 AbstractCegarLoop]: === Iteration 630 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:07:36,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:07:36,157 INFO L85 PathProgramCache]: Analyzing trace with hash 1242450695, now seen corresponding path program 1 times [2022-12-06 00:07:36,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:07:36,157 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675021903] [2022-12-06 00:07:36,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:07:36,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:07:36,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:07:36,237 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-06 00:07:36,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:07:36,237 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675021903] [2022-12-06 00:07:36,237 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [675021903] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:07:36,237 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:07:36,237 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:07:36,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766782695] [2022-12-06 00:07:36,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:07:36,238 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:07:36,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:07:36,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:07:36,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:07:36,238 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:07:36,238 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:36,238 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:07:36,239 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:07:36,239 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:07:36,539 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:07:36,539 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 00:07:36,544 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26965/27010 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13520 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:07:36,550 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:07:36,550 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:07:36,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:07:36,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:07:36,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:07:36,551 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:07:36,551 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:07:36,551 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:07:36,583 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:07:36,584 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:36,584 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:07:36,584 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:07:36,584 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:07:36,584 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:36,585 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:07:36,585 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:07:36,585 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:36,585 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:36,610 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:07:36,610 INFO L131 PetriNetUnfolder]: For 3122/3262 co-relation queries the response was YES. [2022-12-06 00:07:36,611 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3122/3262 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2988 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:07:36,613 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:36,613 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:07:36,756 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:07:36,757 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 173 [2022-12-06 00:07:36,757 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:07:36,757 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:36,757 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:07:36,757 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:07:36,757 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable629 [2022-12-06 00:07:36,757 INFO L420 AbstractCegarLoop]: === Iteration 631 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:07:36,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:07:36,757 INFO L85 PathProgramCache]: Analyzing trace with hash -1309706266, now seen corresponding path program 1 times [2022-12-06 00:07:36,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:07:36,758 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243215088] [2022-12-06 00:07:36,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:07:36,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:07:36,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:07:36,828 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-06 00:07:36,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:07:36,828 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243215088] [2022-12-06 00:07:36,828 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [243215088] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:07:36,828 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:07:36,829 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:07:36,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361876793] [2022-12-06 00:07:36,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:07:36,829 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:07:36,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:07:36,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:07:36,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:07:36,829 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:07:36,829 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:36,829 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:07:36,829 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:07:36,829 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:07:37,106 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:07:37,107 INFO L131 PetriNetUnfolder]: For 26955/27000 co-relation queries the response was YES. [2022-12-06 00:07:37,112 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26955/27000 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13540 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:07:37,119 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:07:37,119 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:07:37,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:07:37,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:07:37,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:07:37,120 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:07:37,120 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:07:37,120 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:07:37,157 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:07:37,158 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:37,158 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:07:37,158 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:07:37,158 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:07:37,158 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:37,159 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:07:37,159 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:07:37,159 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:37,159 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:37,187 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:07:37,188 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 00:07:37,188 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3133/3273 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2975 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:07:37,190 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:37,191 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:07:37,336 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:07:37,336 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 178 [2022-12-06 00:07:37,337 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:07:37,337 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:37,337 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:07:37,337 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:07:37,337 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable630 [2022-12-06 00:07:37,337 INFO L420 AbstractCegarLoop]: === Iteration 632 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:07:37,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:07:37,337 INFO L85 PathProgramCache]: Analyzing trace with hash 433104069, now seen corresponding path program 1 times [2022-12-06 00:07:37,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:07:37,337 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660444817] [2022-12-06 00:07:37,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:07:37,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:07:37,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:07:37,397 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-06 00:07:37,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:07:37,397 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660444817] [2022-12-06 00:07:37,397 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1660444817] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:07:37,397 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:07:37,397 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:07:37,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497526729] [2022-12-06 00:07:37,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:07:37,398 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:07:37,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:07:37,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:07:37,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:07:37,398 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:07:37,398 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:37,398 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:07:37,398 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:07:37,398 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:07:37,661 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:07:37,661 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:07:37,667 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13546 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:07:37,673 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:07:37,674 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:07:37,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:07:37,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:07:37,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:07:37,674 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:07:37,674 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:07:37,674 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:07:37,706 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:07:37,707 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:37,707 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:07:37,707 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:07:37,707 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:07:37,708 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:37,708 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:07:37,708 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:07:37,708 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:37,709 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:37,733 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:07:37,733 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 00:07:37,734 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3312/3520 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2987 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:07:37,735 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:37,735 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:07:37,880 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:07:37,880 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 173 [2022-12-06 00:07:37,880 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:07:37,881 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:37,881 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:07:37,881 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:07:37,881 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable631 [2022-12-06 00:07:37,881 INFO L420 AbstractCegarLoop]: === Iteration 633 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:07:37,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:07:37,881 INFO L85 PathProgramCache]: Analyzing trace with hash -2119052892, now seen corresponding path program 1 times [2022-12-06 00:07:37,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:07:37,881 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955289686] [2022-12-06 00:07:37,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:07:37,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:07:37,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:07:37,941 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-06 00:07:37,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:07:37,942 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955289686] [2022-12-06 00:07:37,942 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [955289686] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:07:37,942 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:07:37,942 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:07:37,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463135842] [2022-12-06 00:07:37,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:07:37,942 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:07:37,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:07:37,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:07:37,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:07:37,943 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:07:37,943 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:37,943 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:07:37,943 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:07:37,943 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:07:38,229 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:07:38,229 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:07:38,235 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13572 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:07:38,242 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:07:38,243 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:07:38,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:07:38,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:07:38,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:07:38,243 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:07:38,243 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:07:38,243 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:07:38,276 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:07:38,277 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:38,277 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:07:38,277 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:07:38,277 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:07:38,277 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:38,278 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:07:38,278 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:07:38,278 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:38,279 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:38,303 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:07:38,304 INFO L131 PetriNetUnfolder]: For 3327/3536 co-relation queries the response was YES. [2022-12-06 00:07:38,304 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3327/3536 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 3000 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:07:38,306 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:38,306 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:07:38,456 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:07:38,457 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 180 [2022-12-06 00:07:38,457 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:07:38,457 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:38,457 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:07:38,457 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:07:38,457 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable632 [2022-12-06 00:07:38,457 INFO L420 AbstractCegarLoop]: === Iteration 634 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:07:38,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:07:38,458 INFO L85 PathProgramCache]: Analyzing trace with hash -376242557, now seen corresponding path program 1 times [2022-12-06 00:07:38,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:07:38,458 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439972103] [2022-12-06 00:07:38,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:07:38,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:07:38,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:07:38,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-06 00:07:38,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:07:38,525 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439972103] [2022-12-06 00:07:38,525 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [439972103] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:07:38,525 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:07:38,525 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:07:38,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44680722] [2022-12-06 00:07:38,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:07:38,525 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:07:38,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:07:38,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:07:38,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:07:38,526 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:07:38,526 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:38,526 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:07:38,526 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:07:38,526 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:07:38,807 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:07:38,808 INFO L131 PetriNetUnfolder]: For 26955/27000 co-relation queries the response was YES. [2022-12-06 00:07:38,813 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26955/27000 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13534 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:07:38,821 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:07:38,821 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:07:38,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:07:38,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:07:38,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:07:38,822 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:07:38,822 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:07:38,822 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:07:38,858 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:07:38,859 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:38,860 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:07:38,860 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:07:38,860 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:07:38,860 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:38,860 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:07:38,860 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:07:38,860 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:38,861 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:38,885 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:07:38,885 INFO L131 PetriNetUnfolder]: For 3122/3262 co-relation queries the response was YES. [2022-12-06 00:07:38,885 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3122/3262 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2983 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:07:38,887 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:38,887 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:07:39,038 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:07:39,038 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 178 [2022-12-06 00:07:39,038 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:07:39,038 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:39,038 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:07:39,038 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:07:39,038 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable633 [2022-12-06 00:07:39,039 INFO L420 AbstractCegarLoop]: === Iteration 635 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:07:39,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:07:39,039 INFO L85 PathProgramCache]: Analyzing trace with hash 1366567778, now seen corresponding path program 1 times [2022-12-06 00:07:39,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:07:39,039 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097446111] [2022-12-06 00:07:39,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:07:39,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:07:39,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:07:39,092 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-06 00:07:39,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:07:39,092 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097446111] [2022-12-06 00:07:39,093 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2097446111] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:07:39,093 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:07:39,093 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:07:39,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800242582] [2022-12-06 00:07:39,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:07:39,093 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:07:39,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:07:39,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:07:39,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:07:39,093 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:07:39,093 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:39,093 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:07:39,093 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:07:39,093 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:07:39,365 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:07:39,365 INFO L131 PetriNetUnfolder]: For 26955/27000 co-relation queries the response was YES. [2022-12-06 00:07:39,371 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26955/27000 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13544 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:07:39,406 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:07:39,406 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:07:39,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:07:39,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:07:39,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:07:39,407 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:07:39,407 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:07:39,407 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:07:39,437 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:07:39,438 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:39,438 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:07:39,439 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:07:39,439 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:07:39,439 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:39,439 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:07:39,439 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:07:39,439 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:39,440 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:39,464 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:07:39,464 INFO L131 PetriNetUnfolder]: For 3122/3262 co-relation queries the response was YES. [2022-12-06 00:07:39,465 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3122/3262 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2971 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:07:39,467 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:39,467 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:07:39,612 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:07:39,613 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 174 [2022-12-06 00:07:39,613 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:07:39,613 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:39,613 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:07:39,613 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:07:39,613 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable634 [2022-12-06 00:07:39,613 INFO L420 AbstractCegarLoop]: === Iteration 636 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:07:39,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:07:39,613 INFO L85 PathProgramCache]: Analyzing trace with hash -1185589183, now seen corresponding path program 1 times [2022-12-06 00:07:39,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:07:39,613 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229987196] [2022-12-06 00:07:39,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:07:39,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:07:39,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:07:39,684 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-06 00:07:39,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:07:39,684 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229987196] [2022-12-06 00:07:39,684 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1229987196] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:07:39,684 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:07:39,684 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:07:39,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089159350] [2022-12-06 00:07:39,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:07:39,685 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:07:39,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:07:39,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:07:39,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:07:39,685 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:07:39,685 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:39,685 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:07:39,685 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:07:39,685 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:07:39,955 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:07:39,955 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:07:39,961 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13547 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:07:39,968 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:07:39,968 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:07:39,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:07:39,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:07:39,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:07:39,969 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:07:39,969 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:07:39,969 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:07:40,005 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:07:40,006 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:40,006 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:07:40,006 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:07:40,006 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:07:40,006 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:40,007 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:07:40,007 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:07:40,007 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:40,008 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:40,031 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:07:40,031 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 00:07:40,032 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3321/3530 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2973 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:07:40,034 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:40,034 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:07:40,195 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:07:40,196 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 190 [2022-12-06 00:07:40,196 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:07:40,196 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:40,196 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:07:40,196 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:07:40,196 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable635 [2022-12-06 00:07:40,196 INFO L420 AbstractCegarLoop]: === Iteration 637 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:07:40,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:07:40,196 INFO L85 PathProgramCache]: Analyzing trace with hash 557221152, now seen corresponding path program 1 times [2022-12-06 00:07:40,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:07:40,196 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314019062] [2022-12-06 00:07:40,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:07:40,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:07:40,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:07:40,258 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-06 00:07:40,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:07:40,258 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314019062] [2022-12-06 00:07:40,258 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [314019062] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:07:40,258 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:07:40,258 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:07:40,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680949148] [2022-12-06 00:07:40,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:07:40,259 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:07:40,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:07:40,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:07:40,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:07:40,259 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:07:40,259 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:40,259 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:07:40,259 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:07:40,259 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:07:40,524 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:07:40,524 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:07:40,530 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13552 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:07:40,537 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:07:40,538 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:07:40,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:07:40,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:07:40,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:07:40,538 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:07:40,538 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:07:40,538 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:07:40,572 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:07:40,573 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:40,573 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:07:40,573 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:07:40,573 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:07:40,573 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:40,574 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:07:40,574 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:07:40,574 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:40,574 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:40,598 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:07:40,599 INFO L131 PetriNetUnfolder]: For 3338/3547 co-relation queries the response was YES. [2022-12-06 00:07:40,599 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3338/3547 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2970 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:07:40,601 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:40,601 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:07:40,745 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:07:40,746 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 173 [2022-12-06 00:07:40,746 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:07:40,746 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:40,746 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:07:40,746 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:07:40,746 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable636 [2022-12-06 00:07:40,746 INFO L420 AbstractCegarLoop]: === Iteration 638 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:07:40,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:07:40,746 INFO L85 PathProgramCache]: Analyzing trace with hash -1994935809, now seen corresponding path program 1 times [2022-12-06 00:07:40,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:07:40,747 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91292895] [2022-12-06 00:07:40,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:07:40,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:07:40,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:07:40,820 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-06 00:07:40,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:07:40,820 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91292895] [2022-12-06 00:07:40,820 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [91292895] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:07:40,820 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:07:40,821 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:07:40,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84418849] [2022-12-06 00:07:40,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:07:40,821 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:07:40,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:07:40,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:07:40,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:07:40,821 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:07:40,821 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:40,821 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:07:40,821 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:07:40,821 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:07:41,116 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:07:41,116 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 00:07:41,121 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26969/27014 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13518 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:07:41,128 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:07:41,128 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:07:41,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:07:41,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:07:41,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:07:41,129 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:07:41,129 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:07:41,129 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:07:41,162 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:07:41,163 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:41,163 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:07:41,164 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:07:41,164 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:07:41,164 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:41,164 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:07:41,164 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:07:41,164 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:41,165 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:41,191 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:07:41,191 INFO L131 PetriNetUnfolder]: For 3122/3262 co-relation queries the response was YES. [2022-12-06 00:07:41,192 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3122/3262 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2990 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:07:41,193 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:41,194 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:07:41,340 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:07:41,340 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 176 [2022-12-06 00:07:41,340 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:07:41,340 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:41,340 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:07:41,340 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:07:41,340 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable637 [2022-12-06 00:07:41,340 INFO L420 AbstractCegarLoop]: === Iteration 639 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:07:41,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:07:41,341 INFO L85 PathProgramCache]: Analyzing trace with hash -252125474, now seen corresponding path program 1 times [2022-12-06 00:07:41,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:07:41,341 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934098677] [2022-12-06 00:07:41,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:07:41,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:07:41,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:07:41,397 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-06 00:07:41,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:07:41,398 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934098677] [2022-12-06 00:07:41,398 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [934098677] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:07:41,398 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:07:41,398 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:07:41,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956338003] [2022-12-06 00:07:41,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:07:41,398 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:07:41,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:07:41,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:07:41,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:07:41,399 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:07:41,399 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:41,399 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:07:41,399 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:07:41,399 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:07:41,657 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:07:41,657 INFO L131 PetriNetUnfolder]: For 26955/27000 co-relation queries the response was YES. [2022-12-06 00:07:41,662 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26955/27000 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13524 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:07:41,668 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:07:41,668 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:07:41,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:07:41,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:07:41,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:07:41,669 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:07:41,669 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:07:41,669 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:07:41,701 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:07:41,702 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:41,702 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:07:41,703 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:07:41,703 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:07:41,703 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:41,703 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:07:41,703 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:07:41,704 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:41,704 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:41,728 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:07:41,728 INFO L131 PetriNetUnfolder]: For 3122/3262 co-relation queries the response was YES. [2022-12-06 00:07:41,729 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3122/3262 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2981 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:07:41,732 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:41,732 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:07:41,888 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:07:41,889 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 186 [2022-12-06 00:07:41,889 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:07:41,889 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:41,889 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:07:41,889 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:07:41,889 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable638 [2022-12-06 00:07:41,889 INFO L420 AbstractCegarLoop]: === Iteration 640 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:07:41,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:07:41,890 INFO L85 PathProgramCache]: Analyzing trace with hash 1490684861, now seen corresponding path program 1 times [2022-12-06 00:07:41,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:07:41,890 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195908562] [2022-12-06 00:07:41,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:07:41,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:07:41,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:07:41,948 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-06 00:07:41,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:07:41,949 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195908562] [2022-12-06 00:07:41,949 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1195908562] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:07:41,949 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:07:41,949 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:07:41,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535482734] [2022-12-06 00:07:41,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:07:41,949 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:07:41,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:07:41,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:07:41,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:07:41,950 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:07:41,950 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:41,950 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:07:41,950 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:07:41,950 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:07:42,225 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:07:42,226 INFO L131 PetriNetUnfolder]: For 27136/27181 co-relation queries the response was YES. [2022-12-06 00:07:42,231 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27136/27181 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13514 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:07:42,238 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:07:42,238 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:07:42,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:07:42,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:07:42,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:07:42,239 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:07:42,239 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:07:42,239 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:07:42,271 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:07:42,272 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:42,272 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:07:42,272 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:07:42,272 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:07:42,273 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:42,273 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:07:42,273 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:07:42,273 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:42,274 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:42,306 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:07:42,306 INFO L131 PetriNetUnfolder]: For 3167/3307 co-relation queries the response was YES. [2022-12-06 00:07:42,307 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3167/3307 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2989 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:07:42,309 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:42,309 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:07:42,464 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:07:42,465 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 193 [2022-12-06 00:07:42,465 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:07:42,465 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:42,465 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:07:42,465 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:07:42,465 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable639 [2022-12-06 00:07:42,465 INFO L420 AbstractCegarLoop]: === Iteration 641 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:07:42,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:07:42,465 INFO L85 PathProgramCache]: Analyzing trace with hash -1061472100, now seen corresponding path program 1 times [2022-12-06 00:07:42,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:07:42,466 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158863825] [2022-12-06 00:07:42,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:07:42,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:07:42,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:07:42,526 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-06 00:07:42,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:07:42,526 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158863825] [2022-12-06 00:07:42,526 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [158863825] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:07:42,526 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:07:42,526 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:07:42,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982834814] [2022-12-06 00:07:42,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:07:42,526 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:07:42,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:07:42,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:07:42,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:07:42,527 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:07:42,527 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:42,527 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:07:42,527 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:07:42,527 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:07:42,804 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:07:42,804 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:07:42,810 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13557 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:07:42,818 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:07:42,818 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:07:42,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:07:42,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:07:42,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:07:42,819 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:07:42,819 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:07:42,819 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:07:42,856 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:07:42,858 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:42,858 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:07:42,858 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:07:42,858 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:07:42,859 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:42,859 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:07:42,859 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:07:42,859 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:42,860 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:42,895 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:07:42,895 INFO L131 PetriNetUnfolder]: For 3349/3561 co-relation queries the response was YES. [2022-12-06 00:07:42,896 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3349/3561 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2994 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:07:42,899 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:42,899 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:07:43,099 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:07:43,100 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 242 [2022-12-06 00:07:43,100 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:07:43,100 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:43,100 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:07:43,100 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:07:43,100 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable640 [2022-12-06 00:07:43,100 INFO L420 AbstractCegarLoop]: === Iteration 642 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:07:43,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:07:43,101 INFO L85 PathProgramCache]: Analyzing trace with hash 681338235, now seen corresponding path program 1 times [2022-12-06 00:07:43,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:07:43,101 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482490957] [2022-12-06 00:07:43,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:07:43,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:07:43,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:07:43,160 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-06 00:07:43,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:07:43,160 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482490957] [2022-12-06 00:07:43,161 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [482490957] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:07:43,161 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:07:43,161 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:07:43,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452263202] [2022-12-06 00:07:43,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:07:43,161 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:07:43,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:07:43,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:07:43,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:07:43,161 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:07:43,161 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:43,161 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:07:43,161 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:07:43,162 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:07:43,442 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:07:43,442 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:07:43,448 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13564 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:07:43,456 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:07:43,456 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:07:43,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:07:43,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:07:43,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:07:43,457 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:07:43,457 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:07:43,457 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:07:43,489 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:07:43,491 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:43,491 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:07:43,491 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:07:43,491 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:07:43,491 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:43,491 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:07:43,491 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:07:43,492 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:43,492 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:43,527 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:07:43,527 INFO L131 PetriNetUnfolder]: For 3304/3511 co-relation queries the response was YES. [2022-12-06 00:07:43,528 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3304/3511 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2988 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:07:43,531 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:43,531 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:07:43,677 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:07:43,677 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 186 [2022-12-06 00:07:43,677 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:07:43,677 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:43,677 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:07:43,677 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:07:43,677 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable641 [2022-12-06 00:07:43,677 INFO L420 AbstractCegarLoop]: === Iteration 643 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:07:43,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:07:43,678 INFO L85 PathProgramCache]: Analyzing trace with hash -1870818726, now seen corresponding path program 1 times [2022-12-06 00:07:43,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:07:43,678 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481372240] [2022-12-06 00:07:43,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:07:43,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:07:43,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:07:43,742 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-06 00:07:43,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:07:43,742 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481372240] [2022-12-06 00:07:43,742 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481372240] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:07:43,742 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:07:43,743 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:07:43,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950768720] [2022-12-06 00:07:43,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:07:43,743 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:07:43,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:07:43,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:07:43,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:07:43,743 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:07:43,743 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:43,743 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:07:43,743 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:07:43,743 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:07:44,022 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:07:44,022 INFO L131 PetriNetUnfolder]: For 27229/27274 co-relation queries the response was YES. [2022-12-06 00:07:44,026 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27229/27274 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13560 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:07:44,032 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:07:44,032 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:07:44,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:07:44,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:07:44,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:07:44,033 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:07:44,033 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:07:44,033 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:07:44,063 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:07:44,064 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:44,064 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:07:44,065 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:07:44,065 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:07:44,065 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:44,065 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:07:44,065 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:07:44,065 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:44,066 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:44,090 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:07:44,090 INFO L131 PetriNetUnfolder]: For 3301/3509 co-relation queries the response was YES. [2022-12-06 00:07:44,091 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3301/3509 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2991 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:07:44,093 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:44,093 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:07:44,232 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:07:44,232 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 167 [2022-12-06 00:07:44,232 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:07:44,232 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:44,232 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:07:44,232 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:07:44,233 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable642 [2022-12-06 00:07:44,233 INFO L420 AbstractCegarLoop]: === Iteration 644 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:07:44,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:07:44,233 INFO L85 PathProgramCache]: Analyzing trace with hash -128008391, now seen corresponding path program 1 times [2022-12-06 00:07:44,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:07:44,233 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266141065] [2022-12-06 00:07:44,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:07:44,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:07:44,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:07:44,291 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-06 00:07:44,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:07:44,291 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266141065] [2022-12-06 00:07:44,292 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [266141065] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:07:44,292 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:07:44,292 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:07:44,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687029075] [2022-12-06 00:07:44,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:07:44,292 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:07:44,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:07:44,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:07:44,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:07:44,292 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:07:44,292 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:44,292 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:07:44,292 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:07:44,292 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:07:44,553 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:07:44,553 INFO L131 PetriNetUnfolder]: For 27136/27181 co-relation queries the response was YES. [2022-12-06 00:07:44,559 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27136/27181 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13515 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:07:44,566 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:07:44,566 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:07:44,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:07:44,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:07:44,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:07:44,567 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:07:44,567 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:07:44,567 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:07:44,599 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:07:44,600 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:44,600 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:07:44,600 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:07:44,600 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:07:44,600 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:44,601 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:07:44,601 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:07:44,601 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:44,601 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:44,625 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:07:44,625 INFO L131 PetriNetUnfolder]: For 3167/3307 co-relation queries the response was YES. [2022-12-06 00:07:44,626 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3167/3307 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 3003 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:07:44,627 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:44,627 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:07:44,770 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:07:44,770 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 170 [2022-12-06 00:07:44,770 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:07:44,770 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:44,770 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:07:44,770 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:07:44,770 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable643 [2022-12-06 00:07:44,770 INFO L420 AbstractCegarLoop]: === Iteration 645 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:07:44,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:07:44,770 INFO L85 PathProgramCache]: Analyzing trace with hash 1614801944, now seen corresponding path program 1 times [2022-12-06 00:07:44,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:07:44,771 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242283579] [2022-12-06 00:07:44,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:07:44,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:07:44,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:07:44,842 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-06 00:07:44,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:07:44,842 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242283579] [2022-12-06 00:07:44,842 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [242283579] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:07:44,842 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:07:44,842 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:07:44,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426815035] [2022-12-06 00:07:44,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:07:44,843 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:07:44,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:07:44,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:07:44,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:07:44,843 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:07:44,843 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:44,843 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:07:44,843 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:07:44,843 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:07:45,127 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:07:45,127 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:07:45,133 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13573 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:07:45,140 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:07:45,140 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:07:45,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:07:45,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:07:45,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:07:45,140 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:07:45,141 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:07:45,141 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:07:45,174 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:07:45,175 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:45,175 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:07:45,175 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:07:45,175 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:07:45,175 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:45,176 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:07:45,176 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:07:45,176 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:45,176 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:45,200 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:07:45,200 INFO L131 PetriNetUnfolder]: For 3327/3536 co-relation queries the response was YES. [2022-12-06 00:07:45,201 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3327/3536 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2987 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:07:45,203 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:45,203 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:07:45,341 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:07:45,342 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 167 [2022-12-06 00:07:45,342 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:07:45,342 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:45,342 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:07:45,342 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:07:45,342 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable644 [2022-12-06 00:07:45,342 INFO L420 AbstractCegarLoop]: === Iteration 646 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:07:45,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:07:45,343 INFO L85 PathProgramCache]: Analyzing trace with hash -937355017, now seen corresponding path program 1 times [2022-12-06 00:07:45,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:07:45,343 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974151998] [2022-12-06 00:07:45,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:07:45,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:07:45,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:07:45,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-06 00:07:45,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:07:45,406 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974151998] [2022-12-06 00:07:45,406 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1974151998] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:07:45,406 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:07:45,406 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:07:45,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153906978] [2022-12-06 00:07:45,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:07:45,407 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:07:45,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:07:45,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:07:45,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:07:45,407 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:07:45,407 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:45,407 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:07:45,407 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:07:45,407 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:07:45,670 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:07:45,671 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 00:07:45,676 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13560 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:07:45,683 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:07:45,684 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:07:45,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:07:45,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:07:45,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:07:45,684 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:07:45,684 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:07:45,684 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:07:45,720 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:07:45,722 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:45,722 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:07:45,722 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:07:45,722 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:07:45,722 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:45,722 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:07:45,722 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:07:45,723 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:45,723 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:45,747 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:07:45,747 INFO L131 PetriNetUnfolder]: For 3293/3500 co-relation queries the response was YES. [2022-12-06 00:07:45,748 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3293/3500 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2987 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:07:45,750 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:45,750 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:07:45,909 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:07:45,910 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 188 [2022-12-06 00:07:45,910 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:07:45,910 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:45,910 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:07:45,910 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:07:45,910 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable645 [2022-12-06 00:07:45,910 INFO L420 AbstractCegarLoop]: === Iteration 647 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:07:45,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:07:45,910 INFO L85 PathProgramCache]: Analyzing trace with hash 805455318, now seen corresponding path program 1 times [2022-12-06 00:07:45,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:07:45,910 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237545093] [2022-12-06 00:07:45,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:07:45,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:07:45,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:07:45,979 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-06 00:07:45,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:07:45,980 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237545093] [2022-12-06 00:07:45,980 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1237545093] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:07:45,980 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:07:45,980 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:07:45,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30335774] [2022-12-06 00:07:45,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:07:45,980 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:07:45,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:07:45,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:07:45,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:07:45,980 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:07:45,980 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:45,981 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:07:45,981 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:07:45,981 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:07:46,253 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:07:46,253 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 00:07:46,259 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13557 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:07:46,266 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:07:46,266 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:07:46,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:07:46,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:07:46,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:07:46,267 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:07:46,267 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:07:46,267 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:07:46,300 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:07:46,301 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:46,301 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:07:46,301 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:07:46,301 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:07:46,301 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:46,302 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:07:46,302 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:07:46,302 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:46,302 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:46,326 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:07:46,326 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 00:07:46,327 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3312/3520 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2985 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:07:46,328 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:46,328 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:07:46,467 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:07:46,468 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 167 [2022-12-06 00:07:46,468 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:07:46,468 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:46,468 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:07:46,468 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:07:46,468 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable646 [2022-12-06 00:07:46,468 INFO L420 AbstractCegarLoop]: === Iteration 648 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:07:46,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:07:46,468 INFO L85 PathProgramCache]: Analyzing trace with hash -1746701643, now seen corresponding path program 1 times [2022-12-06 00:07:46,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:07:46,468 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914866323] [2022-12-06 00:07:46,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:07:46,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:07:46,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:07:46,527 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-06 00:07:46,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:07:46,527 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914866323] [2022-12-06 00:07:46,527 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1914866323] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:07:46,527 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:07:46,527 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:07:46,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313431141] [2022-12-06 00:07:46,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:07:46,528 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:07:46,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:07:46,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:07:46,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:07:46,528 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:07:46,528 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:46,528 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:07:46,528 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:07:46,528 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:07:46,823 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:07:46,823 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:07:46,828 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13583 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:07:46,834 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:07:46,834 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:07:46,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:07:46,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:07:46,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:07:46,835 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:07:46,835 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:07:46,835 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:07:46,866 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:07:46,867 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:46,867 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:07:46,867 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:07:46,868 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:07:46,868 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:46,868 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:07:46,868 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:07:46,868 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:46,869 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:46,893 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:07:46,893 INFO L131 PetriNetUnfolder]: For 3310/3519 co-relation queries the response was YES. [2022-12-06 00:07:46,894 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3310/3519 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2981 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:07:46,896 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:46,896 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:07:47,040 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:07:47,040 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 172 [2022-12-06 00:07:47,041 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:07:47,041 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:47,041 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:07:47,041 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:07:47,041 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable647 [2022-12-06 00:07:47,041 INFO L420 AbstractCegarLoop]: === Iteration 649 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:07:47,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:07:47,041 INFO L85 PathProgramCache]: Analyzing trace with hash -3891308, now seen corresponding path program 1 times [2022-12-06 00:07:47,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:07:47,041 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845709052] [2022-12-06 00:07:47,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:07:47,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:07:47,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:07:47,107 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-06 00:07:47,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:07:47,107 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845709052] [2022-12-06 00:07:47,107 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [845709052] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:07:47,107 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:07:47,107 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:07:47,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347224499] [2022-12-06 00:07:47,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:07:47,107 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:07:47,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:07:47,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:07:47,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:07:47,108 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:07:47,108 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:47,108 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:07:47,108 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:07:47,108 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:07:47,391 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:07:47,391 INFO L131 PetriNetUnfolder]: For 26955/27000 co-relation queries the response was YES. [2022-12-06 00:07:47,397 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26955/27000 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13512 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:07:47,405 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:07:47,405 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:07:47,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:07:47,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:07:47,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:07:47,406 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:07:47,406 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:07:47,406 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:07:47,440 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:07:47,441 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:47,441 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:07:47,441 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:07:47,441 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:07:47,441 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:47,442 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:07:47,442 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:07:47,442 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:47,442 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:47,466 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:07:47,466 INFO L131 PetriNetUnfolder]: For 3135/3276 co-relation queries the response was YES. [2022-12-06 00:07:47,467 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3135/3276 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2988 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:07:47,469 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:47,469 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:07:47,633 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:07:47,634 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 193 [2022-12-06 00:07:47,634 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:07:47,634 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:47,634 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:07:47,634 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:07:47,634 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable648 [2022-12-06 00:07:47,634 INFO L420 AbstractCegarLoop]: === Iteration 650 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:07:47,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:07:47,634 INFO L85 PathProgramCache]: Analyzing trace with hash 1738919027, now seen corresponding path program 1 times [2022-12-06 00:07:47,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:07:47,635 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46203438] [2022-12-06 00:07:47,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:07:47,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:07:47,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:07:47,700 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-06 00:07:47,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:07:47,701 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46203438] [2022-12-06 00:07:47,701 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [46203438] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:07:47,701 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:07:47,701 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:07:47,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121943928] [2022-12-06 00:07:47,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:07:47,701 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:07:47,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:07:47,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:07:47,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:07:47,701 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:07:47,701 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:47,701 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:07:47,701 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:07:47,701 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:07:47,980 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:07:47,981 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:07:47,986 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13567 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:07:47,994 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:07:47,994 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:07:47,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:07:47,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:07:47,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:07:47,995 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:07:47,995 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:07:47,995 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:07:48,031 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:07:48,032 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:48,032 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:07:48,032 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:07:48,032 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:07:48,032 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:48,033 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:07:48,033 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:07:48,033 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:48,033 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:48,057 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:07:48,058 INFO L131 PetriNetUnfolder]: For 3293/3500 co-relation queries the response was YES. [2022-12-06 00:07:48,058 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3293/3500 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2991 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:07:48,060 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:48,060 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:07:48,203 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:07:48,203 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 171 [2022-12-06 00:07:48,203 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:07:48,203 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:48,203 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:07:48,203 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:07:48,203 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable649 [2022-12-06 00:07:48,204 INFO L420 AbstractCegarLoop]: === Iteration 651 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:07:48,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:07:48,204 INFO L85 PathProgramCache]: Analyzing trace with hash -813237934, now seen corresponding path program 1 times [2022-12-06 00:07:48,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:07:48,204 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070918457] [2022-12-06 00:07:48,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:07:48,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:07:48,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:07:48,273 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-06 00:07:48,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:07:48,273 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070918457] [2022-12-06 00:07:48,273 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2070918457] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:07:48,273 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:07:48,273 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:07:48,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343940133] [2022-12-06 00:07:48,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:07:48,274 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:07:48,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:07:48,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:07:48,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:07:48,274 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:07:48,274 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:48,274 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:07:48,274 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:07:48,274 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:07:48,540 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:07:48,540 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:07:48,546 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13565 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:07:48,554 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:07:48,554 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:07:48,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:07:48,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:07:48,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:07:48,555 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:07:48,555 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:07:48,555 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:07:48,592 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:07:48,593 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:48,594 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:07:48,594 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:07:48,594 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:07:48,594 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:48,594 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:07:48,595 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:07:48,595 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:48,595 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:48,622 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:07:48,622 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 00:07:48,623 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3312/3520 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2979 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:07:48,625 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:48,625 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:07:48,778 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:07:48,778 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 184 [2022-12-06 00:07:48,778 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:07:48,778 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:48,778 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:07:48,778 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:07:48,778 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable650 [2022-12-06 00:07:48,778 INFO L420 AbstractCegarLoop]: === Iteration 652 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:07:48,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:07:48,779 INFO L85 PathProgramCache]: Analyzing trace with hash 929572401, now seen corresponding path program 1 times [2022-12-06 00:07:48,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:07:48,779 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29327152] [2022-12-06 00:07:48,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:07:48,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:07:48,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:07:48,843 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-06 00:07:48,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:07:48,843 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29327152] [2022-12-06 00:07:48,843 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [29327152] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:07:48,843 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:07:48,843 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:07:48,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829773906] [2022-12-06 00:07:48,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:07:48,843 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:07:48,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:07:48,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:07:48,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:07:48,844 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:07:48,844 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:48,844 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:07:48,844 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:07:48,844 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:07:49,108 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:07:49,108 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:07:49,114 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13572 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:07:49,121 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:07:49,121 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:07:49,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:07:49,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:07:49,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:07:49,121 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:07:49,121 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:07:49,121 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:07:49,155 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:07:49,156 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:49,156 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:07:49,156 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:07:49,156 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:07:49,156 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:49,157 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:07:49,157 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:07:49,157 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:49,158 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:49,181 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:07:49,181 INFO L131 PetriNetUnfolder]: For 3301/3509 co-relation queries the response was YES. [2022-12-06 00:07:49,182 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3301/3509 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2981 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:07:49,184 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:49,184 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:07:49,328 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:07:49,328 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 172 [2022-12-06 00:07:49,328 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:07:49,328 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:49,328 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:07:49,328 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:07:49,328 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable651 [2022-12-06 00:07:49,328 INFO L420 AbstractCegarLoop]: === Iteration 653 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:07:49,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:07:49,329 INFO L85 PathProgramCache]: Analyzing trace with hash -1622584560, now seen corresponding path program 1 times [2022-12-06 00:07:49,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:07:49,329 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917611270] [2022-12-06 00:07:49,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:07:49,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:07:49,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:07:49,394 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-06 00:07:49,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:07:49,394 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917611270] [2022-12-06 00:07:49,394 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [917611270] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:07:49,394 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:07:49,394 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:07:49,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652991595] [2022-12-06 00:07:49,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:07:49,395 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:07:49,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:07:49,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:07:49,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:07:49,395 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:07:49,395 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:49,395 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:07:49,395 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:07:49,395 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:07:49,695 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:07:49,695 INFO L131 PetriNetUnfolder]: For 27136/27181 co-relation queries the response was YES. [2022-12-06 00:07:49,700 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27136/27181 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13514 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:07:49,705 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:07:49,705 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:07:49,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:07:49,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:07:49,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:07:49,706 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:07:49,706 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:07:49,706 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:07:49,734 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:07:49,735 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:49,735 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:07:49,736 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:07:49,736 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:07:49,736 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:49,736 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:07:49,736 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:07:49,736 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:49,737 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:49,760 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:07:49,761 INFO L131 PetriNetUnfolder]: For 3164/3307 co-relation queries the response was YES. [2022-12-06 00:07:49,761 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3164/3307 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 3002 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:07:49,763 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:49,763 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:07:49,913 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:07:49,914 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 178 [2022-12-06 00:07:49,914 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:07:49,914 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:49,914 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:07:49,914 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:07:49,914 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable652 [2022-12-06 00:07:49,914 INFO L420 AbstractCegarLoop]: === Iteration 654 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:07:49,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:07:49,914 INFO L85 PathProgramCache]: Analyzing trace with hash 120225775, now seen corresponding path program 1 times [2022-12-06 00:07:49,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:07:49,914 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213951304] [2022-12-06 00:07:49,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:07:49,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:07:49,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:07:49,983 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-06 00:07:49,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:07:49,983 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213951304] [2022-12-06 00:07:49,983 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1213951304] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:07:49,983 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:07:49,983 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:07:49,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998387345] [2022-12-06 00:07:49,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:07:49,984 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:07:49,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:07:49,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:07:49,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:07:49,984 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:07:49,984 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:49,984 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:07:49,984 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:07:49,984 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:07:50,261 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:07:50,261 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 00:07:50,267 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13540 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:07:50,274 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:07:50,274 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:07:50,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:07:50,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:07:50,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:07:50,275 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:07:50,275 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:07:50,275 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:07:50,308 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:07:50,309 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:50,309 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:07:50,310 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:07:50,310 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:07:50,310 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:50,310 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:07:50,310 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:07:50,310 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:50,311 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:50,335 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:07:50,335 INFO L131 PetriNetUnfolder]: For 3304/3511 co-relation queries the response was YES. [2022-12-06 00:07:50,336 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3304/3511 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2998 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:07:50,338 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:50,338 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:07:50,496 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:07:50,496 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 186 [2022-12-06 00:07:50,496 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:07:50,496 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:50,496 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:07:50,496 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:07:50,497 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable653 [2022-12-06 00:07:50,497 INFO L420 AbstractCegarLoop]: === Iteration 655 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:07:50,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:07:50,497 INFO L85 PathProgramCache]: Analyzing trace with hash 1863036110, now seen corresponding path program 1 times [2022-12-06 00:07:50,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:07:50,497 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081427694] [2022-12-06 00:07:50,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:07:50,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:07:50,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:07:50,558 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-06 00:07:50,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:07:50,559 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081427694] [2022-12-06 00:07:50,559 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1081427694] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:07:50,559 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:07:50,559 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:07:50,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020480533] [2022-12-06 00:07:50,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:07:50,559 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:07:50,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:07:50,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:07:50,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:07:50,559 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:07:50,560 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:50,560 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:07:50,560 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:07:50,560 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:07:50,833 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:07:50,833 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:07:50,839 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13572 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:07:50,846 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:07:50,846 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:07:50,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:07:50,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:07:50,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:07:50,847 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:07:50,847 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:07:50,847 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:07:50,880 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:07:50,881 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:50,881 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:07:50,881 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:07:50,882 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:07:50,882 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:50,882 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:07:50,882 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:07:50,882 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:50,883 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:50,907 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:07:50,907 INFO L131 PetriNetUnfolder]: For 3318/3528 co-relation queries the response was YES. [2022-12-06 00:07:50,908 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3318/3528 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2974 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:07:50,909 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:50,910 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:07:51,071 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:07:51,071 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 189 [2022-12-06 00:07:51,071 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:07:51,072 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:51,072 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:07:51,072 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:07:51,072 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable654 [2022-12-06 00:07:51,072 INFO L420 AbstractCegarLoop]: === Iteration 656 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:07:51,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:07:51,072 INFO L85 PathProgramCache]: Analyzing trace with hash -689120851, now seen corresponding path program 1 times [2022-12-06 00:07:51,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:07:51,072 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747740980] [2022-12-06 00:07:51,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:07:51,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:07:51,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:07:51,146 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-06 00:07:51,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:07:51,146 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747740980] [2022-12-06 00:07:51,146 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [747740980] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:07:51,146 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:07:51,146 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:07:51,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114467907] [2022-12-06 00:07:51,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:07:51,146 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:07:51,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:07:51,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:07:51,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:07:51,147 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:07:51,147 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:51,147 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:07:51,147 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:07:51,147 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:07:51,472 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:07:51,472 INFO L131 PetriNetUnfolder]: For 27229/27274 co-relation queries the response was YES. [2022-12-06 00:07:51,478 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27229/27274 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13560 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:07:51,487 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:07:51,487 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:07:51,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:07:51,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:07:51,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:07:51,488 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:07:51,488 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:07:51,488 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:07:51,524 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:07:51,526 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:51,526 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:07:51,526 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:07:51,526 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:07:51,526 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:51,526 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:07:51,526 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:07:51,526 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:51,527 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:51,551 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:07:51,551 INFO L131 PetriNetUnfolder]: For 3310/3519 co-relation queries the response was YES. [2022-12-06 00:07:51,552 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3310/3519 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2988 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:07:51,554 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:51,554 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:07:51,726 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:07:51,726 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 200 [2022-12-06 00:07:51,727 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:07:51,727 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:51,727 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:07:51,727 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:07:51,727 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable655 [2022-12-06 00:07:51,727 INFO L420 AbstractCegarLoop]: === Iteration 657 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:07:51,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:07:51,727 INFO L85 PathProgramCache]: Analyzing trace with hash 1053689484, now seen corresponding path program 1 times [2022-12-06 00:07:51,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:07:51,727 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233464450] [2022-12-06 00:07:51,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:07:51,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:07:51,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:07:51,785 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-06 00:07:51,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:07:51,786 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233464450] [2022-12-06 00:07:51,786 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [233464450] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:07:51,786 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:07:51,786 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:07:51,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004480560] [2022-12-06 00:07:51,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:07:51,786 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:07:51,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:07:51,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:07:51,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:07:51,786 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:07:51,786 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:51,786 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:07:51,786 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:07:51,787 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:07:52,070 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:07:52,070 INFO L131 PetriNetUnfolder]: For 26955/27000 co-relation queries the response was YES. [2022-12-06 00:07:52,076 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26955/27000 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13504 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:07:52,084 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:07:52,084 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:07:52,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:07:52,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:07:52,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:07:52,085 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:07:52,085 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:07:52,085 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:07:52,123 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:07:52,125 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:52,125 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:07:52,125 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:07:52,125 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:07:52,125 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:52,125 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:07:52,125 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:07:52,125 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:52,126 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:52,151 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:07:52,151 INFO L131 PetriNetUnfolder]: For 3146/3287 co-relation queries the response was YES. [2022-12-06 00:07:52,152 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3146/3287 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2980 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:07:52,154 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:52,155 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:07:52,307 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:07:52,308 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 183 [2022-12-06 00:07:52,308 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:07:52,308 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:52,308 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:07:52,308 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:07:52,308 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable656 [2022-12-06 00:07:52,308 INFO L420 AbstractCegarLoop]: === Iteration 658 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:07:52,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:07:52,308 INFO L85 PathProgramCache]: Analyzing trace with hash -1498467477, now seen corresponding path program 1 times [2022-12-06 00:07:52,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:07:52,309 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696034360] [2022-12-06 00:07:52,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:07:52,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:07:52,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:07:52,375 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-06 00:07:52,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:07:52,375 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696034360] [2022-12-06 00:07:52,375 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1696034360] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:07:52,375 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:07:52,375 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:07:52,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130827425] [2022-12-06 00:07:52,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:07:52,376 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:07:52,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:07:52,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:07:52,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:07:52,376 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:07:52,376 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:52,376 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:07:52,376 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:07:52,376 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:07:52,659 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:07:52,659 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 00:07:52,665 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26969/27014 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13525 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:07:52,672 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:07:52,672 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:07:52,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:07:52,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:07:52,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:07:52,673 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:07:52,673 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:07:52,673 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:07:52,733 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:07:52,734 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:52,735 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:07:52,735 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:07:52,735 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:07:52,735 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:52,735 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:07:52,735 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:07:52,735 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:52,736 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:52,760 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:07:52,760 INFO L131 PetriNetUnfolder]: For 3122/3262 co-relation queries the response was YES. [2022-12-06 00:07:52,761 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3122/3262 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2975 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:07:52,763 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:52,763 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:07:52,915 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:07:52,916 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 181 [2022-12-06 00:07:52,916 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:07:52,916 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:52,916 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:07:52,916 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:07:52,916 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable657 [2022-12-06 00:07:52,916 INFO L420 AbstractCegarLoop]: === Iteration 659 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:07:52,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:07:52,916 INFO L85 PathProgramCache]: Analyzing trace with hash 244342858, now seen corresponding path program 1 times [2022-12-06 00:07:52,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:07:52,916 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558718183] [2022-12-06 00:07:52,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:07:52,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:07:52,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:07:52,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-06 00:07:52,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:07:52,975 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558718183] [2022-12-06 00:07:52,975 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [558718183] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:07:52,975 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:07:52,976 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:07:52,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203776429] [2022-12-06 00:07:52,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:07:52,976 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:07:52,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:07:52,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:07:52,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:07:52,976 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:07:52,976 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:52,976 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:07:52,976 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:07:52,976 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:07:53,244 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:07:53,244 INFO L131 PetriNetUnfolder]: For 26955/27000 co-relation queries the response was YES. [2022-12-06 00:07:53,250 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26955/27000 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13532 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:07:53,256 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:07:53,257 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:07:53,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:07:53,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:07:53,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:07:53,257 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:07:53,257 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:07:53,257 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:07:53,290 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:07:53,291 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:53,291 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:07:53,291 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:07:53,291 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:07:53,291 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:53,291 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:07:53,291 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:07:53,292 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:53,292 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:53,316 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:07:53,316 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 00:07:53,317 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3133/3273 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2988 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:07:53,319 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:53,319 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:07:53,465 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:07:53,465 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 174 [2022-12-06 00:07:53,465 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:07:53,465 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:53,465 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:07:53,465 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:07:53,465 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable658 [2022-12-06 00:07:53,466 INFO L420 AbstractCegarLoop]: === Iteration 660 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:07:53,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:07:53,466 INFO L85 PathProgramCache]: Analyzing trace with hash 1987153193, now seen corresponding path program 1 times [2022-12-06 00:07:53,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:07:53,466 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107554628] [2022-12-06 00:07:53,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:07:53,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:07:53,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:07:53,541 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-06 00:07:53,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:07:53,542 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107554628] [2022-12-06 00:07:53,542 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1107554628] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:07:53,542 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:07:53,542 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:07:53,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271363968] [2022-12-06 00:07:53,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:07:53,542 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:07:53,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:07:53,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:07:53,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:07:53,543 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:07:53,543 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:53,543 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:07:53,543 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:07:53,543 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:07:53,842 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:07:53,843 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 00:07:53,848 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26969/27014 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13519 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:07:53,856 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:07:53,856 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:07:53,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:07:53,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:07:53,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:07:53,857 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:07:53,857 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:07:53,857 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:07:53,892 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:07:53,893 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:53,893 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:07:53,893 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:07:53,893 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:07:53,893 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:53,893 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:07:53,894 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:07:53,894 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:53,894 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:53,918 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:07:53,918 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 00:07:53,919 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3133/3273 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2967 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:07:53,921 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:53,921 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:07:54,067 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:07:54,067 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 174 [2022-12-06 00:07:54,067 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:07:54,067 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:54,067 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:07:54,067 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:07:54,067 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable659 [2022-12-06 00:07:54,067 INFO L420 AbstractCegarLoop]: === Iteration 661 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:07:54,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:07:54,068 INFO L85 PathProgramCache]: Analyzing trace with hash -565003768, now seen corresponding path program 1 times [2022-12-06 00:07:54,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:07:54,068 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695791476] [2022-12-06 00:07:54,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:07:54,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:07:54,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:07:54,128 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:07:54,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:07:54,128 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695791476] [2022-12-06 00:07:54,128 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [695791476] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:07:54,128 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:07:54,128 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:07:54,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793274910] [2022-12-06 00:07:54,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:07:54,129 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:07:54,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:07:54,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:07:54,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:07:54,129 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:07:54,129 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:54,129 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:07:54,129 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:07:54,129 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:07:54,414 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:07:54,414 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 00:07:54,419 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26969/27014 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13525 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:07:54,426 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:07:54,426 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:07:54,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:07:54,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:07:54,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:07:54,427 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:07:54,427 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:07:54,427 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:07:54,461 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:07:54,462 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:54,462 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:07:54,462 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:07:54,462 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:07:54,462 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:54,463 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:07:54,463 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:07:54,463 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:54,463 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:54,487 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:07:54,487 INFO L131 PetriNetUnfolder]: For 3135/3276 co-relation queries the response was YES. [2022-12-06 00:07:54,488 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3135/3276 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2981 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:07:54,490 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:54,490 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:07:54,639 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:07:54,640 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 178 [2022-12-06 00:07:54,640 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:07:54,640 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:54,640 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:07:54,640 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:07:54,640 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable660 [2022-12-06 00:07:54,640 INFO L420 AbstractCegarLoop]: === Iteration 662 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:07:54,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:07:54,640 INFO L85 PathProgramCache]: Analyzing trace with hash 1177806567, now seen corresponding path program 1 times [2022-12-06 00:07:54,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:07:54,641 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967450874] [2022-12-06 00:07:54,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:07:54,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:07:54,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:07:54,705 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-06 00:07:54,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:07:54,705 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967450874] [2022-12-06 00:07:54,706 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1967450874] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:07:54,706 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:07:54,706 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:07:54,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803105980] [2022-12-06 00:07:54,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:07:54,706 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:07:54,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:07:54,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:07:54,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:07:54,706 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:07:54,706 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:54,706 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:07:54,706 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:07:54,706 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:07:54,989 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:07:54,990 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 00:07:54,995 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13562 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:07:55,003 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:07:55,003 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:07:55,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:07:55,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:07:55,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:07:55,004 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:07:55,004 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:07:55,004 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:07:55,040 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:07:55,041 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:55,041 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:07:55,041 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:07:55,041 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:07:55,041 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:55,042 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:07:55,042 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:07:55,042 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:55,042 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:55,067 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:07:55,067 INFO L131 PetriNetUnfolder]: For 3309/3518 co-relation queries the response was YES. [2022-12-06 00:07:55,068 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3309/3518 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2985 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:07:55,070 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:55,070 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:07:55,215 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:07:55,215 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 174 [2022-12-06 00:07:55,215 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:07:55,215 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:55,215 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:07:55,216 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:07:55,216 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable661 [2022-12-06 00:07:55,216 INFO L420 AbstractCegarLoop]: === Iteration 663 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:07:55,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:07:55,216 INFO L85 PathProgramCache]: Analyzing trace with hash -1374350394, now seen corresponding path program 1 times [2022-12-06 00:07:55,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:07:55,216 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393936391] [2022-12-06 00:07:55,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:07:55,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:07:55,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:07:55,283 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-06 00:07:55,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:07:55,283 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393936391] [2022-12-06 00:07:55,283 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [393936391] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:07:55,283 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:07:55,284 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:07:55,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721673981] [2022-12-06 00:07:55,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:07:55,284 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:07:55,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:07:55,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:07:55,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:07:55,284 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:07:55,284 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:55,284 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:07:55,284 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:07:55,284 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:07:55,568 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:07:55,568 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 00:07:55,574 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26969/27014 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13530 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:07:55,581 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:07:55,581 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:07:55,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:07:55,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:07:55,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:07:55,582 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:07:55,582 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:07:55,582 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:07:55,619 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:07:55,620 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:55,620 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:07:55,620 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:07:55,620 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:07:55,620 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:55,621 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:07:55,621 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:07:55,621 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:55,621 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:55,653 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:07:55,654 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 00:07:55,654 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3133/3273 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2979 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:07:55,656 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:55,656 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:07:55,803 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:07:55,804 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 184 [2022-12-06 00:07:55,804 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:07:55,804 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:55,804 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:07:55,804 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:07:55,804 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable662 [2022-12-06 00:07:55,804 INFO L420 AbstractCegarLoop]: === Iteration 664 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:07:55,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:07:55,804 INFO L85 PathProgramCache]: Analyzing trace with hash 368459941, now seen corresponding path program 1 times [2022-12-06 00:07:55,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:07:55,804 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619713772] [2022-12-06 00:07:55,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:07:55,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:07:55,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:07:55,862 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-06 00:07:55,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:07:55,862 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619713772] [2022-12-06 00:07:55,862 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [619713772] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:07:55,862 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:07:55,862 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:07:55,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684278489] [2022-12-06 00:07:55,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:07:55,863 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:07:55,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:07:55,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:07:55,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:07:55,863 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:07:55,863 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:55,863 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:07:55,863 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:07:55,863 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:07:56,135 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:07:56,136 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 00:07:56,141 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26969/27014 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13543 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:07:56,149 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:07:56,149 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:07:56,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:07:56,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:07:56,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:07:56,150 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:07:56,150 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:07:56,150 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:07:56,184 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:07:56,185 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:56,185 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:07:56,185 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:07:56,185 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:07:56,186 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:56,186 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:07:56,186 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:07:56,186 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:56,187 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:56,210 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:07:56,210 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 00:07:56,211 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3133/3273 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2979 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:07:56,213 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:56,213 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:07:56,363 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:07:56,364 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 179 [2022-12-06 00:07:56,364 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:07:56,364 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:56,364 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:07:56,364 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:07:56,364 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable663 [2022-12-06 00:07:56,364 INFO L420 AbstractCegarLoop]: === Iteration 665 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:07:56,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:07:56,364 INFO L85 PathProgramCache]: Analyzing trace with hash 2111270276, now seen corresponding path program 1 times [2022-12-06 00:07:56,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:07:56,364 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699976926] [2022-12-06 00:07:56,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:07:56,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:07:56,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:07:56,430 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-06 00:07:56,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:07:56,430 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699976926] [2022-12-06 00:07:56,430 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [699976926] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:07:56,430 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:07:56,430 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:07:56,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058814422] [2022-12-06 00:07:56,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:07:56,431 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:07:56,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:07:56,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:07:56,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:07:56,431 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:07:56,431 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:56,431 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:07:56,431 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:07:56,431 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:07:56,707 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:07:56,708 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:07:56,713 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13569 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:07:56,721 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:07:56,721 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:07:56,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:07:56,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:07:56,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:07:56,722 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:07:56,722 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:07:56,722 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:07:56,754 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:07:56,755 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:56,755 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:07:56,755 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:07:56,755 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:07:56,755 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:56,756 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:07:56,756 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:07:56,756 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:56,756 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:56,780 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:07:56,780 INFO L131 PetriNetUnfolder]: For 3348/3558 co-relation queries the response was YES. [2022-12-06 00:07:56,781 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3348/3558 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2961 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:07:56,783 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:56,783 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:07:56,924 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:07:56,925 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 170 [2022-12-06 00:07:56,925 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:07:56,925 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:56,925 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:07:56,925 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:07:56,925 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable664 [2022-12-06 00:07:56,925 INFO L420 AbstractCegarLoop]: === Iteration 666 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:07:56,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:07:56,925 INFO L85 PathProgramCache]: Analyzing trace with hash -440886685, now seen corresponding path program 1 times [2022-12-06 00:07:56,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:07:56,926 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975145558] [2022-12-06 00:07:56,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:07:56,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:07:56,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:07:56,984 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-06 00:07:56,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:07:56,985 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975145558] [2022-12-06 00:07:56,985 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1975145558] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:07:56,985 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:07:56,985 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:07:56,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519495386] [2022-12-06 00:07:56,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:07:56,985 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:07:56,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:07:56,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:07:56,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:07:56,985 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:07:56,985 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:56,985 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:07:56,985 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:07:56,985 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:07:57,269 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:07:57,269 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 00:07:57,275 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26965/27010 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13514 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:07:57,281 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:07:57,281 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:07:57,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:07:57,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:07:57,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:07:57,282 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:07:57,282 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:07:57,282 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:07:57,314 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:07:57,315 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:57,316 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:07:57,316 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:07:57,316 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:07:57,316 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:57,316 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:07:57,316 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:07:57,316 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:57,317 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:57,340 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:07:57,340 INFO L131 PetriNetUnfolder]: For 3122/3262 co-relation queries the response was YES. [2022-12-06 00:07:57,341 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3122/3262 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2992 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:07:57,343 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:57,343 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:07:57,488 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:07:57,488 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 172 [2022-12-06 00:07:57,488 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:07:57,488 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:57,488 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:07:57,488 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:07:57,488 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable665 [2022-12-06 00:07:57,489 INFO L420 AbstractCegarLoop]: === Iteration 667 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:07:57,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:07:57,489 INFO L85 PathProgramCache]: Analyzing trace with hash 1301923650, now seen corresponding path program 1 times [2022-12-06 00:07:57,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:07:57,489 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204284260] [2022-12-06 00:07:57,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:07:57,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:07:57,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:07:57,573 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-06 00:07:57,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:07:57,574 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204284260] [2022-12-06 00:07:57,574 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1204284260] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:07:57,574 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:07:57,574 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:07:57,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485014520] [2022-12-06 00:07:57,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:07:57,574 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:07:57,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:07:57,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:07:57,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:07:57,574 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:07:57,575 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:57,575 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:07:57,575 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:07:57,575 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:07:57,847 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:07:57,847 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 00:07:57,853 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13552 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:07:57,860 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:07:57,861 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:07:57,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:07:57,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:07:57,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:07:57,861 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:07:57,861 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:07:57,861 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:07:57,895 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:07:57,897 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:57,897 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:07:57,897 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:07:57,897 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:07:57,897 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:57,897 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:07:57,897 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:07:57,897 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:57,898 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:57,922 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:07:57,922 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 00:07:57,923 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3312/3520 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2971 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:07:57,925 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:57,925 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:07:58,073 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:07:58,073 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 176 [2022-12-06 00:07:58,073 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:07:58,073 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:58,073 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:07:58,073 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:07:58,073 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable666 [2022-12-06 00:07:58,073 INFO L420 AbstractCegarLoop]: === Iteration 668 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:07:58,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:07:58,074 INFO L85 PathProgramCache]: Analyzing trace with hash -1250233311, now seen corresponding path program 1 times [2022-12-06 00:07:58,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:07:58,074 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729794622] [2022-12-06 00:07:58,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:07:58,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:07:58,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:07:58,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-06 00:07:58,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:07:58,132 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729794622] [2022-12-06 00:07:58,132 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1729794622] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:07:58,132 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:07:58,132 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:07:58,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374320117] [2022-12-06 00:07:58,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:07:58,132 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:07:58,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:07:58,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:07:58,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:07:58,133 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:07:58,133 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:58,133 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:07:58,133 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:07:58,133 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:07:58,390 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:07:58,390 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:07:58,395 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13559 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:07:58,402 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:07:58,402 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:07:58,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:07:58,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:07:58,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:07:58,403 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:07:58,403 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:07:58,403 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:07:58,434 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:07:58,435 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:58,435 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:07:58,435 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:07:58,435 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:07:58,435 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:58,436 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:07:58,436 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:07:58,436 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:58,436 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:58,461 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:07:58,461 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 00:07:58,462 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3321/3530 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2979 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:07:58,464 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:58,464 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:07:58,614 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:07:58,615 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 179 [2022-12-06 00:07:58,615 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:07:58,615 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:58,615 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:07:58,615 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:07:58,615 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable667 [2022-12-06 00:07:58,615 INFO L420 AbstractCegarLoop]: === Iteration 669 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:07:58,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:07:58,615 INFO L85 PathProgramCache]: Analyzing trace with hash 492577024, now seen corresponding path program 1 times [2022-12-06 00:07:58,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:07:58,615 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863450192] [2022-12-06 00:07:58,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:07:58,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:07:58,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:07:58,690 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-06 00:07:58,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:07:58,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863450192] [2022-12-06 00:07:58,690 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1863450192] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:07:58,690 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:07:58,690 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:07:58,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735311037] [2022-12-06 00:07:58,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:07:58,691 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:07:58,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:07:58,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:07:58,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:07:58,691 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:07:58,691 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:58,691 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:07:58,691 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:07:58,691 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:07:58,962 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:07:58,962 INFO L131 PetriNetUnfolder]: For 27229/27274 co-relation queries the response was YES. [2022-12-06 00:07:58,968 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27229/27274 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13562 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:07:58,975 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:07:58,975 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:07:58,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:07:58,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:07:58,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:07:58,976 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:07:58,976 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:07:58,976 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:07:59,009 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:07:59,010 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:59,010 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:07:59,010 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:07:59,010 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:07:59,010 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:59,011 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:07:59,011 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:07:59,011 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:59,011 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:59,035 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:07:59,035 INFO L131 PetriNetUnfolder]: For 3349/3561 co-relation queries the response was YES. [2022-12-06 00:07:59,036 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3349/3561 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2981 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:07:59,038 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:59,038 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:07:59,179 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:07:59,180 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 170 [2022-12-06 00:07:59,180 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:07:59,180 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:59,180 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:07:59,180 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:07:59,180 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable668 [2022-12-06 00:07:59,180 INFO L420 AbstractCegarLoop]: === Iteration 670 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:07:59,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:07:59,180 INFO L85 PathProgramCache]: Analyzing trace with hash -2059579937, now seen corresponding path program 1 times [2022-12-06 00:07:59,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:07:59,180 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126906105] [2022-12-06 00:07:59,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:07:59,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:07:59,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:07:59,246 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-06 00:07:59,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:07:59,246 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126906105] [2022-12-06 00:07:59,246 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [126906105] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:07:59,246 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:07:59,247 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:07:59,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704289305] [2022-12-06 00:07:59,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:07:59,247 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:07:59,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:07:59,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:07:59,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:07:59,247 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:07:59,247 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:59,247 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:07:59,247 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:07:59,247 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:07:59,529 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:07:59,530 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 00:07:59,535 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26965/27010 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13502 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:07:59,542 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:07:59,542 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:07:59,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:07:59,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:07:59,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:07:59,543 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:07:59,543 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:07:59,543 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:07:59,577 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:07:59,578 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:59,578 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:07:59,578 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:07:59,578 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:07:59,578 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:59,578 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:07:59,579 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:07:59,579 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:59,579 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:59,603 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:07:59,603 INFO L131 PetriNetUnfolder]: For 3122/3262 co-relation queries the response was YES. [2022-12-06 00:07:59,604 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3122/3262 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2978 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:07:59,606 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:07:59,606 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:07:59,754 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:07:59,754 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 176 [2022-12-06 00:07:59,754 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:07:59,754 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:59,755 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:07:59,755 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:07:59,755 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable669 [2022-12-06 00:07:59,755 INFO L420 AbstractCegarLoop]: === Iteration 671 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:07:59,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:07:59,755 INFO L85 PathProgramCache]: Analyzing trace with hash -316769602, now seen corresponding path program 1 times [2022-12-06 00:07:59,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:07:59,755 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450493888] [2022-12-06 00:07:59,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:07:59,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:07:59,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:07:59,821 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-06 00:07:59,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:07:59,822 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1450493888] [2022-12-06 00:07:59,822 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1450493888] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:07:59,822 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:07:59,822 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:07:59,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452678227] [2022-12-06 00:07:59,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:07:59,822 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:07:59,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:07:59,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:07:59,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:07:59,822 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:07:59,822 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:07:59,822 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:07:59,822 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:07:59,823 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:08:00,121 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:08:00,121 INFO L131 PetriNetUnfolder]: For 27136/27181 co-relation queries the response was YES. [2022-12-06 00:08:00,126 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27136/27181 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13518 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:08:00,133 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:08:00,133 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:08:00,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:08:00,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:08:00,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:08:00,134 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:08:00,134 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:08:00,134 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:08:00,179 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:08:00,180 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:00,180 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:08:00,180 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:08:00,181 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:08:00,181 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:00,181 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:08:00,181 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:08:00,181 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:00,182 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:00,212 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:08:00,213 INFO L131 PetriNetUnfolder]: For 3168/3309 co-relation queries the response was YES. [2022-12-06 00:08:00,214 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3168/3309 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2994 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:08:00,216 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:00,216 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:08:00,354 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:08:00,355 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 174 [2022-12-06 00:08:00,355 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:08:00,355 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:08:00,355 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:08:00,355 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:08:00,355 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable670 [2022-12-06 00:08:00,355 INFO L420 AbstractCegarLoop]: === Iteration 672 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:08:00,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:08:00,356 INFO L85 PathProgramCache]: Analyzing trace with hash 1426040733, now seen corresponding path program 1 times [2022-12-06 00:08:00,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:08:00,356 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921172191] [2022-12-06 00:08:00,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:08:00,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:08:00,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:08:00,413 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-06 00:08:00,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:08:00,414 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921172191] [2022-12-06 00:08:00,414 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [921172191] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:08:00,414 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:08:00,414 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:08:00,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324421759] [2022-12-06 00:08:00,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:08:00,414 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:08:00,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:08:00,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:08:00,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:08:00,414 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:08:00,414 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:08:00,414 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:08:00,414 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:08:00,415 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:08:00,685 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:08:00,685 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 00:08:00,690 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26969/27014 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13557 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:08:00,697 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:08:00,697 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:08:00,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:08:00,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:08:00,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:08:00,698 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:08:00,698 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:08:00,698 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:08:00,731 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:08:00,732 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:00,732 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:08:00,732 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:08:00,732 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:08:00,733 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:00,733 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:08:00,733 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:08:00,733 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:00,734 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:00,757 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:08:00,757 INFO L131 PetriNetUnfolder]: For 3122/3262 co-relation queries the response was YES. [2022-12-06 00:08:00,758 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3122/3262 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2980 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:08:00,760 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:00,760 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:08:00,920 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:08:00,920 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 188 [2022-12-06 00:08:00,920 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:08:00,920 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:08:00,920 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:08:00,920 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:08:00,920 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable671 [2022-12-06 00:08:00,921 INFO L420 AbstractCegarLoop]: === Iteration 673 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:08:00,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:08:00,921 INFO L85 PathProgramCache]: Analyzing trace with hash -1126116228, now seen corresponding path program 1 times [2022-12-06 00:08:00,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:08:00,921 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462829800] [2022-12-06 00:08:00,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:08:00,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:08:00,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:08:00,985 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-06 00:08:00,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:08:00,985 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462829800] [2022-12-06 00:08:00,985 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [462829800] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:08:00,985 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:08:00,985 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:08:00,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810373156] [2022-12-06 00:08:00,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:08:00,986 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:08:00,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:08:00,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:08:00,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:08:00,986 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:08:00,986 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:08:00,986 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:08:00,986 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:08:00,986 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:08:01,252 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:08:01,253 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:08:01,258 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13562 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:08:01,265 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:08:01,265 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:08:01,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:08:01,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:08:01,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:08:01,266 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:08:01,266 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:08:01,266 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:08:01,301 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:08:01,302 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:01,302 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:08:01,302 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:08:01,302 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:08:01,302 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:01,302 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:08:01,302 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:08:01,302 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:01,303 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:01,326 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:08:01,326 INFO L131 PetriNetUnfolder]: For 3338/3547 co-relation queries the response was YES. [2022-12-06 00:08:01,327 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3338/3547 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2979 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:08:01,329 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:01,329 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:08:01,470 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:08:01,470 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 168 [2022-12-06 00:08:01,470 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:08:01,470 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:08:01,470 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:08:01,471 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:08:01,471 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable672 [2022-12-06 00:08:01,471 INFO L420 AbstractCegarLoop]: === Iteration 674 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:08:01,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:08:01,471 INFO L85 PathProgramCache]: Analyzing trace with hash 616694107, now seen corresponding path program 1 times [2022-12-06 00:08:01,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:08:01,471 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80892368] [2022-12-06 00:08:01,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:08:01,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:08:01,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:08:01,537 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-06 00:08:01,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:08:01,538 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80892368] [2022-12-06 00:08:01,538 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [80892368] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:08:01,538 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:08:01,538 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:08:01,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144565944] [2022-12-06 00:08:01,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:08:01,538 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:08:01,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:08:01,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:08:01,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:08:01,538 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:08:01,539 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:08:01,539 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:08:01,539 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:08:01,539 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:08:01,823 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:08:01,823 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:08:01,828 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13563 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:08:01,837 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:08:01,837 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:08:01,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:08:01,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:08:01,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:08:01,838 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:08:01,838 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:08:01,838 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:08:01,875 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:08:01,876 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:01,876 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:08:01,876 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:08:01,876 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:08:01,876 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:01,876 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:08:01,877 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:08:01,877 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:01,877 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:01,901 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:08:01,901 INFO L131 PetriNetUnfolder]: For 3304/3511 co-relation queries the response was YES. [2022-12-06 00:08:01,902 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3304/3511 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2996 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:08:01,904 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:01,904 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:08:02,050 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:08:02,050 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 174 [2022-12-06 00:08:02,050 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:08:02,050 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:08:02,050 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:08:02,050 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:08:02,050 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable673 [2022-12-06 00:08:02,050 INFO L420 AbstractCegarLoop]: === Iteration 675 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:08:02,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:08:02,051 INFO L85 PathProgramCache]: Analyzing trace with hash -1935462854, now seen corresponding path program 1 times [2022-12-06 00:08:02,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:08:02,051 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818790103] [2022-12-06 00:08:02,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:08:02,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:08:02,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:08:02,108 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-06 00:08:02,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:08:02,108 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818790103] [2022-12-06 00:08:02,108 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [818790103] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:08:02,108 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:08:02,108 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:08:02,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814581060] [2022-12-06 00:08:02,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:08:02,108 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:08:02,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:08:02,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:08:02,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:08:02,109 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:08:02,109 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:08:02,109 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:08:02,109 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:08:02,109 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:08:02,386 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:08:02,386 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:08:02,392 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13561 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:08:02,399 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:08:02,399 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:08:02,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:08:02,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:08:02,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:08:02,400 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:08:02,400 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:08:02,400 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:08:02,435 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:08:02,436 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:02,436 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:08:02,436 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:08:02,436 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:08:02,436 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:02,437 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:08:02,437 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:08:02,437 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:02,437 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:02,461 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:08:02,461 INFO L131 PetriNetUnfolder]: For 3310/3519 co-relation queries the response was YES. [2022-12-06 00:08:02,462 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3310/3519 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2991 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:08:02,464 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:02,464 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:08:02,622 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:08:02,622 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 186 [2022-12-06 00:08:02,622 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:08:02,622 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:08:02,622 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:08:02,622 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:08:02,622 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable674 [2022-12-06 00:08:02,622 INFO L420 AbstractCegarLoop]: === Iteration 676 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:08:02,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:08:02,623 INFO L85 PathProgramCache]: Analyzing trace with hash -192652519, now seen corresponding path program 1 times [2022-12-06 00:08:02,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:08:02,623 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189430403] [2022-12-06 00:08:02,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:08:02,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:08:02,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:08:02,680 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-06 00:08:02,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:08:02,680 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189430403] [2022-12-06 00:08:02,680 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [189430403] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:08:02,680 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:08:02,680 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:08:02,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757493105] [2022-12-06 00:08:02,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:08:02,680 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:08:02,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:08:02,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:08:02,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:08:02,681 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:08:02,681 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:08:02,681 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:08:02,681 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:08:02,681 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:08:02,947 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:08:02,947 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 00:08:02,953 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13556 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:08:02,989 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:08:02,989 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:08:02,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:08:02,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:08:02,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:08:02,989 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:08:02,990 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:08:02,990 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:08:03,019 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:08:03,020 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:03,020 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:08:03,020 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:08:03,020 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:08:03,020 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:03,021 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:08:03,021 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:08:03,021 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:03,021 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:03,046 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:08:03,046 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 00:08:03,047 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3312/3520 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2990 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:08:03,049 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:03,049 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:08:03,190 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:08:03,191 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 171 [2022-12-06 00:08:03,191 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:08:03,191 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:08:03,191 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:08:03,191 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:08:03,191 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable675 [2022-12-06 00:08:03,191 INFO L420 AbstractCegarLoop]: === Iteration 677 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:08:03,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:08:03,191 INFO L85 PathProgramCache]: Analyzing trace with hash 1550157816, now seen corresponding path program 1 times [2022-12-06 00:08:03,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:08:03,191 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146155898] [2022-12-06 00:08:03,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:08:03,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:08:03,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:08:03,258 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-06 00:08:03,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:08:03,258 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146155898] [2022-12-06 00:08:03,258 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1146155898] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:08:03,258 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:08:03,258 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:08:03,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701399490] [2022-12-06 00:08:03,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:08:03,259 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:08:03,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:08:03,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:08:03,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:08:03,259 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:08:03,259 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:08:03,259 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:08:03,259 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:08:03,260 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:08:03,527 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:08:03,527 INFO L131 PetriNetUnfolder]: For 27229/27274 co-relation queries the response was YES. [2022-12-06 00:08:03,533 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27229/27274 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13556 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:08:03,540 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:08:03,540 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:08:03,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:08:03,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:08:03,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:08:03,540 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:08:03,541 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:08:03,541 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:08:03,573 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:08:03,574 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:03,574 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:08:03,575 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:08:03,575 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:08:03,575 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:03,575 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:08:03,575 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:08:03,575 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:03,576 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:03,599 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:08:03,599 INFO L131 PetriNetUnfolder]: For 3348/3558 co-relation queries the response was YES. [2022-12-06 00:08:03,600 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3348/3558 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2976 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:08:03,602 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:03,602 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:08:03,759 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:08:03,759 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 184 [2022-12-06 00:08:03,760 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:08:03,760 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:08:03,760 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:08:03,760 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:08:03,760 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable676 [2022-12-06 00:08:03,760 INFO L420 AbstractCegarLoop]: === Iteration 678 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:08:03,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:08:03,760 INFO L85 PathProgramCache]: Analyzing trace with hash -1001999145, now seen corresponding path program 1 times [2022-12-06 00:08:03,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:08:03,760 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035102408] [2022-12-06 00:08:03,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:08:03,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:08:03,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:08:03,817 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-06 00:08:03,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:08:03,817 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035102408] [2022-12-06 00:08:03,817 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2035102408] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:08:03,817 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:08:03,817 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:08:03,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285314691] [2022-12-06 00:08:03,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:08:03,818 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:08:03,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:08:03,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:08:03,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:08:03,818 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:08:03,818 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:08:03,818 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:08:03,818 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:08:03,818 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:08:04,090 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:08:04,090 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:08:04,095 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13592 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:08:04,103 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:08:04,103 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:08:04,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:08:04,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:08:04,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:08:04,104 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:08:04,104 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:08:04,104 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:08:04,139 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:08:04,140 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:04,141 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:08:04,141 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:08:04,141 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:08:04,141 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:04,141 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:08:04,141 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:08:04,141 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:04,142 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:04,166 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:08:04,167 INFO L131 PetriNetUnfolder]: For 3301/3509 co-relation queries the response was YES. [2022-12-06 00:08:04,167 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3301/3509 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2978 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:08:04,169 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:04,169 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:08:04,325 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:08:04,326 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 185 [2022-12-06 00:08:04,326 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:08:04,326 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:08:04,326 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:08:04,326 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:08:04,326 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable677 [2022-12-06 00:08:04,326 INFO L420 AbstractCegarLoop]: === Iteration 679 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:08:04,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:08:04,326 INFO L85 PathProgramCache]: Analyzing trace with hash 740811190, now seen corresponding path program 1 times [2022-12-06 00:08:04,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:08:04,326 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089814957] [2022-12-06 00:08:04,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:08:04,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:08:04,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:08:04,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-06 00:08:04,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:08:04,383 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089814957] [2022-12-06 00:08:04,383 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2089814957] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:08:04,383 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:08:04,383 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:08:04,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442778073] [2022-12-06 00:08:04,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:08:04,383 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:08:04,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:08:04,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:08:04,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:08:04,384 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:08:04,384 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:08:04,384 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:08:04,384 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:08:04,384 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:08:04,671 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:08:04,671 INFO L131 PetriNetUnfolder]: For 26955/27000 co-relation queries the response was YES. [2022-12-06 00:08:04,677 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26955/27000 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13533 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:08:04,684 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:08:04,684 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:08:04,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:08:04,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:08:04,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:08:04,685 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:08:04,685 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:08:04,685 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:08:04,721 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:08:04,722 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:04,722 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:08:04,722 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:08:04,722 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:08:04,722 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:04,723 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:08:04,723 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:08:04,723 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:04,723 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:04,747 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:08:04,747 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 00:08:04,748 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3133/3273 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2975 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:08:04,750 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:04,750 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:08:04,889 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:08:04,889 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 167 [2022-12-06 00:08:04,889 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:08:04,890 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:08:04,890 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:08:04,890 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:08:04,890 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable678 [2022-12-06 00:08:04,890 INFO L420 AbstractCegarLoop]: === Iteration 680 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:08:04,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:08:04,890 INFO L85 PathProgramCache]: Analyzing trace with hash -1811345771, now seen corresponding path program 1 times [2022-12-06 00:08:04,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:08:04,890 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856469435] [2022-12-06 00:08:04,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:08:04,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:08:04,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:08:04,948 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-06 00:08:04,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:08:04,948 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856469435] [2022-12-06 00:08:04,948 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1856469435] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:08:04,948 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:08:04,948 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:08:04,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574701234] [2022-12-06 00:08:04,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:08:04,949 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:08:04,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:08:04,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:08:04,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:08:04,949 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:08:04,949 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:08:04,949 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:08:04,949 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:08:04,949 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:08:05,219 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:08:05,219 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 00:08:05,225 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26965/27010 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13516 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:08:05,232 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:08:05,232 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:08:05,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:08:05,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:08:05,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:08:05,233 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:08:05,233 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:08:05,233 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:08:05,268 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:08:05,269 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:05,269 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:08:05,269 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:08:05,269 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:08:05,269 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:05,270 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:08:05,270 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:08:05,270 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:05,270 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:05,294 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:08:05,294 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 00:08:05,295 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3133/3273 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2971 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:08:05,297 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:05,297 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:08:05,446 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:08:05,447 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 178 [2022-12-06 00:08:05,447 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:08:05,447 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:08:05,447 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:08:05,447 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:08:05,447 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable679 [2022-12-06 00:08:05,447 INFO L420 AbstractCegarLoop]: === Iteration 681 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:08:05,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:08:05,447 INFO L85 PathProgramCache]: Analyzing trace with hash -68535436, now seen corresponding path program 1 times [2022-12-06 00:08:05,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:08:05,447 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533693952] [2022-12-06 00:08:05,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:08:05,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:08:05,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:08:05,504 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-06 00:08:05,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:08:05,505 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533693952] [2022-12-06 00:08:05,505 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1533693952] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:08:05,505 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:08:05,505 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:08:05,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375590298] [2022-12-06 00:08:05,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:08:05,505 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:08:05,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:08:05,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:08:05,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:08:05,505 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:08:05,506 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:08:05,506 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:08:05,506 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:08:05,506 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:08:05,772 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:08:05,772 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 00:08:05,777 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26965/27010 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13520 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:08:05,785 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:08:05,785 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:08:05,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:08:05,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:08:05,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:08:05,786 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:08:05,786 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:08:05,786 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:08:05,820 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:08:05,821 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:05,821 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:08:05,821 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:08:05,821 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:08:05,821 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:05,822 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:08:05,822 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:08:05,822 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:05,822 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:05,856 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:08:05,857 INFO L131 PetriNetUnfolder]: For 3146/3287 co-relation queries the response was YES. [2022-12-06 00:08:05,857 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3146/3287 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2976 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:08:05,859 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:05,859 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:08:06,002 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:08:06,002 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 181 [2022-12-06 00:08:06,002 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:08:06,002 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:08:06,002 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:08:06,002 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:08:06,002 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable680 [2022-12-06 00:08:06,003 INFO L420 AbstractCegarLoop]: === Iteration 682 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:08:06,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:08:06,003 INFO L85 PathProgramCache]: Analyzing trace with hash 1674274899, now seen corresponding path program 1 times [2022-12-06 00:08:06,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:08:06,003 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995656845] [2022-12-06 00:08:06,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:08:06,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:08:06,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:08:06,072 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-06 00:08:06,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:08:06,073 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995656845] [2022-12-06 00:08:06,073 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1995656845] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:08:06,073 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:08:06,073 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:08:06,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071275274] [2022-12-06 00:08:06,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:08:06,073 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:08:06,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:08:06,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:08:06,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:08:06,073 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:08:06,073 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:08:06,074 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:08:06,074 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:08:06,074 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:08:06,374 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:08:06,374 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 00:08:06,379 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26965/27010 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13517 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:08:06,386 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:08:06,386 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:08:06,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:08:06,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:08:06,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:08:06,386 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:08:06,386 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:08:06,386 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:08:06,419 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:08:06,420 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:06,420 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:08:06,420 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:08:06,420 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:08:06,420 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:06,421 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:08:06,421 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:08:06,421 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:06,421 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:06,446 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:08:06,446 INFO L131 PetriNetUnfolder]: For 3123/3264 co-relation queries the response was YES. [2022-12-06 00:08:06,447 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3123/3264 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2983 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:08:06,449 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:06,449 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:08:06,597 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:08:06,597 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 177 [2022-12-06 00:08:06,597 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:08:06,597 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:08:06,597 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:08:06,597 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:08:06,597 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable681 [2022-12-06 00:08:06,598 INFO L420 AbstractCegarLoop]: === Iteration 683 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:08:06,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:08:06,598 INFO L85 PathProgramCache]: Analyzing trace with hash -877882062, now seen corresponding path program 1 times [2022-12-06 00:08:06,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:08:06,598 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372186211] [2022-12-06 00:08:06,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:08:06,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:08:06,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:08:06,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-06 00:08:06,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:08:06,652 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372186211] [2022-12-06 00:08:06,652 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1372186211] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:08:06,652 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:08:06,652 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:08:06,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508508116] [2022-12-06 00:08:06,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:08:06,652 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:08:06,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:08:06,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:08:06,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:08:06,653 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:08:06,653 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:08:06,653 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:08:06,653 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:08:06,653 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:08:06,928 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:08:06,928 INFO L131 PetriNetUnfolder]: For 27136/27181 co-relation queries the response was YES. [2022-12-06 00:08:06,934 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27136/27181 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13531 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:08:06,942 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:08:06,942 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:08:06,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:08:06,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:08:06,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:08:06,943 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:08:06,943 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:08:06,943 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:08:06,977 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:08:06,978 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:06,978 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:08:06,979 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:08:06,979 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:08:06,979 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:06,979 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:08:06,979 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:08:06,979 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:06,980 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:07,003 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:08:07,003 INFO L131 PetriNetUnfolder]: For 3156/3296 co-relation queries the response was YES. [2022-12-06 00:08:07,004 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3156/3296 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 3001 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:08:07,006 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:07,006 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:08:07,160 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:08:07,161 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 182 [2022-12-06 00:08:07,161 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:08:07,161 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:08:07,161 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:08:07,161 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:08:07,161 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable682 [2022-12-06 00:08:07,161 INFO L420 AbstractCegarLoop]: === Iteration 684 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:08:07,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:08:07,161 INFO L85 PathProgramCache]: Analyzing trace with hash 864928273, now seen corresponding path program 1 times [2022-12-06 00:08:07,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:08:07,161 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251474870] [2022-12-06 00:08:07,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:08:07,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:08:07,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:08:07,232 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-06 00:08:07,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:08:07,232 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251474870] [2022-12-06 00:08:07,232 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [251474870] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:08:07,232 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:08:07,232 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:08:07,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871775673] [2022-12-06 00:08:07,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:08:07,233 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:08:07,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:08:07,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:08:07,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:08:07,233 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:08:07,233 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:08:07,233 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:08:07,233 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:08:07,233 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:08:07,524 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:08:07,524 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 00:08:07,530 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26969/27014 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13522 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:08:07,537 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:08:07,537 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:08:07,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:08:07,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:08:07,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:08:07,538 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:08:07,538 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:08:07,538 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:08:07,570 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:08:07,571 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:07,571 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:08:07,571 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:08:07,571 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:08:07,572 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:07,572 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:08:07,572 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:08:07,572 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:07,573 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:07,596 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:08:07,597 INFO L131 PetriNetUnfolder]: For 3122/3262 co-relation queries the response was YES. [2022-12-06 00:08:07,597 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3122/3262 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2987 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:08:07,599 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:07,599 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:08:07,743 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:08:07,743 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 172 [2022-12-06 00:08:07,743 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:08:07,743 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:08:07,743 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:08:07,743 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:08:07,743 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable683 [2022-12-06 00:08:07,743 INFO L420 AbstractCegarLoop]: === Iteration 685 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:08:07,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:08:07,744 INFO L85 PathProgramCache]: Analyzing trace with hash -1687228688, now seen corresponding path program 1 times [2022-12-06 00:08:07,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:08:07,744 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956097822] [2022-12-06 00:08:07,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:08:07,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:08:07,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:08:07,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-06 00:08:07,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:08:07,803 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956097822] [2022-12-06 00:08:07,803 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1956097822] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:08:07,803 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:08:07,804 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:08:07,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630326519] [2022-12-06 00:08:07,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:08:07,804 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:08:07,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:08:07,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:08:07,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:08:07,804 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:08:07,804 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:08:07,804 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:08:07,804 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:08:07,804 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:08:08,086 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:08:08,086 INFO L131 PetriNetUnfolder]: For 26955/27000 co-relation queries the response was YES. [2022-12-06 00:08:08,092 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26955/27000 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13543 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:08:08,099 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:08:08,099 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:08:08,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:08:08,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:08:08,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:08:08,100 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:08:08,100 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:08:08,100 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:08:08,135 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:08:08,137 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:08,137 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:08:08,137 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:08:08,137 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:08:08,137 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:08,137 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:08:08,137 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:08:08,138 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:08,138 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:08,162 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:08:08,162 INFO L131 PetriNetUnfolder]: For 3146/3287 co-relation queries the response was YES. [2022-12-06 00:08:08,163 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3146/3287 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2966 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:08:08,165 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:08,165 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:08:08,310 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:08:08,311 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 174 [2022-12-06 00:08:08,311 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:08:08,311 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:08:08,311 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:08:08,311 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:08:08,311 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable684 [2022-12-06 00:08:08,311 INFO L420 AbstractCegarLoop]: === Iteration 686 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:08:08,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:08:08,311 INFO L85 PathProgramCache]: Analyzing trace with hash 55581647, now seen corresponding path program 1 times [2022-12-06 00:08:08,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:08:08,312 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929341592] [2022-12-06 00:08:08,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:08:08,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:08:08,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:08:08,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:08:08,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:08:08,368 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929341592] [2022-12-06 00:08:08,368 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1929341592] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:08:08,368 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:08:08,368 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:08:08,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972032667] [2022-12-06 00:08:08,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:08:08,368 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:08:08,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:08:08,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:08:08,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:08:08,369 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:08:08,369 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:08:08,369 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:08:08,369 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:08:08,369 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:08:08,654 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:08:08,654 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 00:08:08,660 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26965/27010 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13531 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:08:08,668 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:08:08,669 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:08:08,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:08:08,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:08:08,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:08:08,669 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:08:08,669 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:08:08,669 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:08:08,705 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:08:08,706 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:08,706 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:08:08,706 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:08:08,706 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:08:08,706 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:08,707 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:08:08,707 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:08:08,707 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:08,707 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:08,732 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:08:08,732 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 00:08:08,733 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3133/3273 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2973 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:08:08,735 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:08,735 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:08:08,880 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:08:08,880 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 174 [2022-12-06 00:08:08,880 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:08:08,880 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:08:08,880 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:08:08,880 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:08:08,881 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable685 [2022-12-06 00:08:08,881 INFO L420 AbstractCegarLoop]: === Iteration 687 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:08:08,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:08:08,881 INFO L85 PathProgramCache]: Analyzing trace with hash 1798391982, now seen corresponding path program 1 times [2022-12-06 00:08:08,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:08:08,881 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210127069] [2022-12-06 00:08:08,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:08:08,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:08:08,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:08:08,945 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-06 00:08:08,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:08:08,945 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210127069] [2022-12-06 00:08:08,946 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1210127069] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:08:08,946 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:08:08,946 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:08:08,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262735902] [2022-12-06 00:08:08,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:08:08,946 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:08:08,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:08:08,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:08:08,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:08:08,946 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:08:08,946 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:08:08,946 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:08:08,946 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:08:08,946 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:08:09,208 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:08:09,208 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 00:08:09,214 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26965/27010 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13515 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:08:09,221 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:08:09,221 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:08:09,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:08:09,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:08:09,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:08:09,222 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:08:09,222 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:08:09,222 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:08:09,256 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:08:09,257 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:09,257 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:08:09,257 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:08:09,257 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:08:09,257 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:09,258 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:08:09,258 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:08:09,258 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:09,258 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:09,282 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:08:09,282 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 00:08:09,283 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3133/3273 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2978 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:08:09,285 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:09,285 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:08:09,430 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:08:09,431 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 174 [2022-12-06 00:08:09,431 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:08:09,431 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:08:09,431 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:08:09,431 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:08:09,431 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable686 [2022-12-06 00:08:09,432 INFO L420 AbstractCegarLoop]: === Iteration 688 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:08:09,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:08:09,432 INFO L85 PathProgramCache]: Analyzing trace with hash -753764979, now seen corresponding path program 1 times [2022-12-06 00:08:09,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:08:09,432 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560471209] [2022-12-06 00:08:09,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:08:09,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:08:09,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:08:09,507 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-06 00:08:09,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:08:09,507 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560471209] [2022-12-06 00:08:09,507 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [560471209] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:08:09,507 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:08:09,507 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:08:09,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396625720] [2022-12-06 00:08:09,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:08:09,507 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:08:09,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:08:09,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:08:09,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:08:09,508 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:08:09,508 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:08:09,508 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:08:09,508 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:08:09,508 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:08:09,779 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:08:09,780 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:08:09,785 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13559 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:08:09,792 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:08:09,793 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:08:09,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:08:09,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:08:09,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:08:09,793 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:08:09,793 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:08:09,793 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:08:09,827 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:08:09,828 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:09,828 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:08:09,828 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:08:09,828 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:08:09,828 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:09,829 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:08:09,829 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:08:09,829 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:09,829 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:09,853 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:08:09,853 INFO L131 PetriNetUnfolder]: For 3318/3528 co-relation queries the response was YES. [2022-12-06 00:08:09,854 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3318/3528 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2987 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:08:09,856 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:09,856 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:08:09,999 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:08:09,999 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 171 [2022-12-06 00:08:09,999 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:08:09,999 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:08:09,999 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:08:09,999 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:08:09,999 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable687 [2022-12-06 00:08:09,999 INFO L420 AbstractCegarLoop]: === Iteration 689 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:08:10,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:08:10,000 INFO L85 PathProgramCache]: Analyzing trace with hash 989045356, now seen corresponding path program 1 times [2022-12-06 00:08:10,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:08:10,000 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614674408] [2022-12-06 00:08:10,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:08:10,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:08:10,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:08:10,059 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-06 00:08:10,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:08:10,060 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614674408] [2022-12-06 00:08:10,060 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1614674408] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:08:10,060 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:08:10,060 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:08:10,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392203473] [2022-12-06 00:08:10,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:08:10,060 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:08:10,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:08:10,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:08:10,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:08:10,061 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:08:10,061 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:08:10,061 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:08:10,061 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:08:10,061 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:08:10,366 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:08:10,366 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:08:10,370 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13553 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:08:10,376 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:08:10,376 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:08:10,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:08:10,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:08:10,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:08:10,377 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:08:10,377 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:08:10,377 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:08:10,405 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:08:10,406 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:10,406 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:08:10,406 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:08:10,406 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:08:10,406 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:10,407 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:08:10,407 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:08:10,407 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:10,408 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:10,431 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:08:10,432 INFO L131 PetriNetUnfolder]: For 3348/3558 co-relation queries the response was YES. [2022-12-06 00:08:10,433 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3348/3558 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2979 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:08:10,435 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:10,435 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:08:10,594 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:08:10,595 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 189 [2022-12-06 00:08:10,595 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:08:10,595 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:08:10,595 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:08:10,595 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:08:10,595 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable688 [2022-12-06 00:08:10,595 INFO L420 AbstractCegarLoop]: === Iteration 690 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:08:10,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:08:10,595 INFO L85 PathProgramCache]: Analyzing trace with hash -1563111605, now seen corresponding path program 1 times [2022-12-06 00:08:10,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:08:10,596 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816984903] [2022-12-06 00:08:10,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:08:10,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:08:10,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:08:10,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:08:10,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:08:10,663 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816984903] [2022-12-06 00:08:10,663 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [816984903] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:08:10,663 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:08:10,663 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:08:10,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187323047] [2022-12-06 00:08:10,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:08:10,663 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:08:10,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:08:10,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:08:10,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:08:10,664 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:08:10,664 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:08:10,664 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:08:10,664 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:08:10,664 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:08:10,949 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:08:10,949 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:08:10,956 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13573 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:08:10,964 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:08:10,964 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:08:10,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:08:10,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:08:10,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:08:10,965 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:08:10,965 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:08:10,965 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:08:11,000 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:08:11,001 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:11,001 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:08:11,001 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:08:11,001 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:08:11,001 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:11,002 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:08:11,002 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:08:11,002 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:11,003 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:11,026 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:08:11,026 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 00:08:11,027 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3312/3520 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2980 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:08:11,029 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:11,029 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:08:11,183 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:08:11,183 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 182 [2022-12-06 00:08:11,184 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:08:11,184 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:08:11,184 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:08:11,184 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:08:11,184 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable689 [2022-12-06 00:08:11,184 INFO L420 AbstractCegarLoop]: === Iteration 691 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:08:11,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:08:11,184 INFO L85 PathProgramCache]: Analyzing trace with hash 179698730, now seen corresponding path program 1 times [2022-12-06 00:08:11,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:08:11,184 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997033093] [2022-12-06 00:08:11,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:08:11,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:08:11,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:08:11,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-06 00:08:11,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:08:11,243 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997033093] [2022-12-06 00:08:11,243 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [997033093] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:08:11,243 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:08:11,243 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:08:11,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443846318] [2022-12-06 00:08:11,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:08:11,244 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:08:11,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:08:11,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:08:11,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:08:11,244 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:08:11,244 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:08:11,244 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:08:11,244 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:08:11,244 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:08:11,517 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:08:11,518 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:08:11,523 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13549 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:08:11,531 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:08:11,531 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:08:11,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:08:11,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:08:11,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:08:11,532 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:08:11,532 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:08:11,532 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:08:11,566 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:08:11,567 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:11,567 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:08:11,567 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:08:11,567 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:08:11,567 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:11,568 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:08:11,568 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:08:11,568 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:11,568 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:11,592 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:08:11,592 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 00:08:11,593 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3312/3520 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2979 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:08:11,595 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:11,595 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:08:11,731 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:08:11,732 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 165 [2022-12-06 00:08:11,732 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:08:11,732 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:08:11,732 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:08:11,732 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:08:11,732 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable690 [2022-12-06 00:08:11,732 INFO L420 AbstractCegarLoop]: === Iteration 692 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:08:11,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:08:11,732 INFO L85 PathProgramCache]: Analyzing trace with hash 1922509065, now seen corresponding path program 1 times [2022-12-06 00:08:11,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:08:11,732 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84148707] [2022-12-06 00:08:11,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:08:11,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:08:11,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:08:11,793 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-06 00:08:11,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:08:11,793 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84148707] [2022-12-06 00:08:11,793 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [84148707] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:08:11,793 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:08:11,793 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:08:11,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996343979] [2022-12-06 00:08:11,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:08:11,793 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:08:11,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:08:11,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:08:11,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:08:11,794 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:08:11,794 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:08:11,794 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:08:11,794 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:08:11,794 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:08:12,070 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:08:12,070 INFO L131 PetriNetUnfolder]: For 27229/27274 co-relation queries the response was YES. [2022-12-06 00:08:12,076 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27229/27274 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13555 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:08:12,083 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:08:12,083 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:08:12,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:08:12,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:08:12,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:08:12,084 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:08:12,084 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:08:12,084 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:08:12,118 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:08:12,119 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:12,119 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:08:12,120 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:08:12,120 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:08:12,120 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:12,120 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:08:12,120 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:08:12,120 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:12,121 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:12,146 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:08:12,146 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 00:08:12,147 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3312/3520 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 3010 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:08:12,149 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:12,150 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:08:12,307 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:08:12,308 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 188 [2022-12-06 00:08:12,308 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:08:12,308 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:08:12,308 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:08:12,308 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:08:12,308 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable691 [2022-12-06 00:08:12,308 INFO L420 AbstractCegarLoop]: === Iteration 693 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:08:12,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:08:12,308 INFO L85 PathProgramCache]: Analyzing trace with hash -629647896, now seen corresponding path program 1 times [2022-12-06 00:08:12,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:08:12,308 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078629818] [2022-12-06 00:08:12,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:08:12,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:08:12,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:08:12,366 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-06 00:08:12,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:08:12,366 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078629818] [2022-12-06 00:08:12,366 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1078629818] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:08:12,366 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:08:12,366 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:08:12,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061171712] [2022-12-06 00:08:12,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:08:12,367 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:08:12,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:08:12,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:08:12,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:08:12,367 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:08:12,367 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:08:12,367 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:08:12,367 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:08:12,367 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:08:12,643 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:08:12,643 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 00:08:12,649 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26965/27010 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13535 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:08:12,656 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:08:12,656 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:08:12,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:08:12,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:08:12,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:08:12,657 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:08:12,657 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:08:12,657 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:08:12,692 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:08:12,694 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:12,694 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:08:12,694 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:08:12,694 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:08:12,694 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:12,694 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:08:12,694 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:08:12,694 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:12,695 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:12,719 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:08:12,720 INFO L131 PetriNetUnfolder]: For 3140/3283 co-relation queries the response was YES. [2022-12-06 00:08:12,721 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3140/3283 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2975 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:08:12,723 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:12,723 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:08:12,868 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:08:12,869 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 175 [2022-12-06 00:08:12,869 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:08:12,869 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:08:12,869 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:08:12,869 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:08:12,869 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable692 [2022-12-06 00:08:12,869 INFO L420 AbstractCegarLoop]: === Iteration 694 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:08:12,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:08:12,869 INFO L85 PathProgramCache]: Analyzing trace with hash 1113162439, now seen corresponding path program 1 times [2022-12-06 00:08:12,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:08:12,870 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517227018] [2022-12-06 00:08:12,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:08:12,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:08:12,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:08:12,938 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-06 00:08:12,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:08:12,939 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517227018] [2022-12-06 00:08:12,939 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1517227018] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:08:12,939 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:08:12,939 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:08:12,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463382577] [2022-12-06 00:08:12,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:08:12,939 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:08:12,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:08:12,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:08:12,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:08:12,940 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:08:12,940 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:08:12,940 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:08:12,940 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:08:12,940 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:08:13,228 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:08:13,228 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 00:08:13,234 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13567 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:08:13,241 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:08:13,241 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:08:13,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:08:13,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:08:13,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:08:13,242 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:08:13,242 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:08:13,242 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:08:13,303 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:08:13,304 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:13,304 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:08:13,304 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:08:13,304 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:08:13,304 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:13,305 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:08:13,305 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:08:13,305 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:13,305 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:13,329 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:08:13,330 INFO L131 PetriNetUnfolder]: For 3304/3511 co-relation queries the response was YES. [2022-12-06 00:08:13,331 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3304/3511 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2992 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:08:13,332 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:13,332 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:08:13,505 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:08:13,505 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 201 [2022-12-06 00:08:13,505 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:08:13,505 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:08:13,505 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:08:13,505 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:08:13,506 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable693 [2022-12-06 00:08:13,506 INFO L420 AbstractCegarLoop]: === Iteration 695 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:08:13,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:08:13,506 INFO L85 PathProgramCache]: Analyzing trace with hash -1438994522, now seen corresponding path program 1 times [2022-12-06 00:08:13,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:08:13,506 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659649358] [2022-12-06 00:08:13,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:08:13,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:08:13,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:08:13,570 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-06 00:08:13,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:08:13,570 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659649358] [2022-12-06 00:08:13,571 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [659649358] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:08:13,571 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:08:13,571 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:08:13,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538894269] [2022-12-06 00:08:13,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:08:13,571 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:08:13,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:08:13,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:08:13,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:08:13,571 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:08:13,571 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:08:13,571 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:08:13,571 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:08:13,571 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:08:13,852 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:08:13,852 INFO L131 PetriNetUnfolder]: For 27150/27195 co-relation queries the response was YES. [2022-12-06 00:08:13,858 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27150/27195 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13510 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:08:13,866 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:08:13,866 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:08:13,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:08:13,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:08:13,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:08:13,866 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:08:13,867 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:08:13,867 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:08:13,901 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:08:13,902 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:13,902 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:08:13,902 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:08:13,902 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:08:13,902 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:13,903 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:08:13,903 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:08:13,903 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:13,903 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:13,927 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:08:13,927 INFO L131 PetriNetUnfolder]: For 3167/3307 co-relation queries the response was YES. [2022-12-06 00:08:13,928 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3167/3307 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2990 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:08:13,930 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:13,930 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:08:14,122 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:08:14,123 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 221 [2022-12-06 00:08:14,123 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:08:14,123 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:08:14,123 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:08:14,123 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:08:14,123 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable694 [2022-12-06 00:08:14,123 INFO L420 AbstractCegarLoop]: === Iteration 696 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:08:14,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:08:14,123 INFO L85 PathProgramCache]: Analyzing trace with hash 303815813, now seen corresponding path program 1 times [2022-12-06 00:08:14,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:08:14,123 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599873475] [2022-12-06 00:08:14,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:08:14,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:08:14,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:08:14,214 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-06 00:08:14,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:08:14,214 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599873475] [2022-12-06 00:08:14,214 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1599873475] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:08:14,215 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:08:14,215 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:08:14,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671281860] [2022-12-06 00:08:14,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:08:14,215 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:08:14,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:08:14,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:08:14,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:08:14,215 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:08:14,215 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:08:14,216 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:08:14,216 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:08:14,216 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:08:14,580 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:08:14,581 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 00:08:14,586 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26969/27014 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13527 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:08:14,595 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:08:14,595 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:08:14,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:08:14,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:08:14,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:08:14,596 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:08:14,596 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:08:14,596 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:08:14,632 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:08:14,633 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:14,633 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:08:14,633 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:08:14,634 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:08:14,634 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:14,634 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:08:14,634 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:08:14,634 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:14,635 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:14,659 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:08:14,659 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 00:08:14,660 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3133/3273 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2974 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:08:14,662 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:14,662 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:08:14,817 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:08:14,817 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 183 [2022-12-06 00:08:14,817 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:08:14,817 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:08:14,817 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:08:14,817 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:08:14,817 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable695 [2022-12-06 00:08:14,817 INFO L420 AbstractCegarLoop]: === Iteration 697 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:08:14,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:08:14,818 INFO L85 PathProgramCache]: Analyzing trace with hash 2046626148, now seen corresponding path program 1 times [2022-12-06 00:08:14,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:08:14,818 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120422782] [2022-12-06 00:08:14,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:08:14,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:08:14,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:08:14,883 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-06 00:08:14,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:08:14,884 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120422782] [2022-12-06 00:08:14,884 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2120422782] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:08:14,884 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:08:14,884 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:08:14,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059116867] [2022-12-06 00:08:14,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:08:14,884 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:08:14,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:08:14,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:08:14,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:08:14,884 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:08:14,884 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:08:14,885 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:08:14,885 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:08:14,885 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:08:15,167 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:08:15,167 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:08:15,173 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13566 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:08:15,180 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:08:15,180 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:08:15,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:08:15,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:08:15,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:08:15,180 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:08:15,181 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:08:15,181 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:08:15,215 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:08:15,216 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:15,216 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:08:15,216 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:08:15,216 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:08:15,216 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:15,217 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:08:15,217 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:08:15,217 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:15,217 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:15,241 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:08:15,241 INFO L131 PetriNetUnfolder]: For 3338/3547 co-relation queries the response was YES. [2022-12-06 00:08:15,242 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3338/3547 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2982 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:08:15,244 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:15,244 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:08:15,389 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:08:15,389 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 173 [2022-12-06 00:08:15,389 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:08:15,390 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:08:15,390 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:08:15,390 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:08:15,390 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable696 [2022-12-06 00:08:15,390 INFO L420 AbstractCegarLoop]: === Iteration 698 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:08:15,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:08:15,390 INFO L85 PathProgramCache]: Analyzing trace with hash -505530813, now seen corresponding path program 1 times [2022-12-06 00:08:15,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:08:15,390 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672785659] [2022-12-06 00:08:15,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:08:15,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:08:15,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:08:15,448 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:08:15,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:08:15,448 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672785659] [2022-12-06 00:08:15,448 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [672785659] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:08:15,448 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:08:15,448 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:08:15,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113173627] [2022-12-06 00:08:15,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:08:15,449 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:08:15,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:08:15,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:08:15,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:08:15,449 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:08:15,449 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:08:15,449 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:08:15,449 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:08:15,449 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:08:15,730 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:08:15,730 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:08:15,735 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13554 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:08:15,743 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:08:15,743 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:08:15,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:08:15,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:08:15,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:08:15,744 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:08:15,744 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:08:15,744 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:08:15,778 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:08:15,779 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:15,779 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:08:15,779 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:08:15,779 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:08:15,779 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:15,780 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:08:15,780 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:08:15,780 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:15,780 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:15,804 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:08:15,805 INFO L131 PetriNetUnfolder]: For 3293/3500 co-relation queries the response was YES. [2022-12-06 00:08:15,805 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3293/3500 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2990 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:08:15,807 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:15,807 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:08:15,962 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:08:15,963 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 184 [2022-12-06 00:08:15,963 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:08:15,963 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:08:15,963 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:08:15,963 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:08:15,963 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable697 [2022-12-06 00:08:15,963 INFO L420 AbstractCegarLoop]: === Iteration 699 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:08:15,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:08:15,963 INFO L85 PathProgramCache]: Analyzing trace with hash 1237279522, now seen corresponding path program 1 times [2022-12-06 00:08:15,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:08:15,963 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540460247] [2022-12-06 00:08:15,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:08:15,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:08:15,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:08:16,022 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-06 00:08:16,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:08:16,022 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540460247] [2022-12-06 00:08:16,023 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [540460247] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:08:16,023 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:08:16,023 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:08:16,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727952941] [2022-12-06 00:08:16,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:08:16,023 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:08:16,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:08:16,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:08:16,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:08:16,023 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:08:16,023 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:08:16,023 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:08:16,023 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:08:16,023 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:08:16,286 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:08:16,287 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 00:08:16,292 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13561 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:08:16,299 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:08:16,300 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:08:16,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:08:16,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:08:16,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:08:16,300 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:08:16,300 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:08:16,300 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:08:16,334 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:08:16,335 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:16,335 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:08:16,335 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:08:16,335 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:08:16,335 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:16,336 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:08:16,336 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:08:16,336 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:16,337 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:16,370 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:08:16,370 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 00:08:16,371 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3321/3530 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2978 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:08:16,373 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:16,373 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:08:16,522 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:08:16,523 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 188 [2022-12-06 00:08:16,523 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:08:16,523 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:08:16,523 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:08:16,523 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:08:16,523 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable698 [2022-12-06 00:08:16,523 INFO L420 AbstractCegarLoop]: === Iteration 700 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:08:16,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:08:16,523 INFO L85 PathProgramCache]: Analyzing trace with hash -1314877439, now seen corresponding path program 1 times [2022-12-06 00:08:16,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:08:16,523 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262083927] [2022-12-06 00:08:16,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:08:16,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:08:16,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:08:16,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-06 00:08:16,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:08:16,591 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262083927] [2022-12-06 00:08:16,591 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [262083927] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:08:16,591 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:08:16,591 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:08:16,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130080886] [2022-12-06 00:08:16,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:08:16,591 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:08:16,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:08:16,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:08:16,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:08:16,591 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:08:16,591 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:08:16,591 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:08:16,592 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:08:16,592 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:08:16,877 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:08:16,877 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 00:08:16,882 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26969/27014 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13522 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:08:16,890 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:08:16,890 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:08:16,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:08:16,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:08:16,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:08:16,891 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:08:16,891 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:08:16,891 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:08:16,927 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:08:16,928 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:16,928 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:08:16,929 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:08:16,929 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:08:16,929 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:16,929 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:08:16,929 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:08:16,929 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:16,930 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:16,954 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:08:16,954 INFO L131 PetriNetUnfolder]: For 3123/3264 co-relation queries the response was YES. [2022-12-06 00:08:16,955 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3123/3264 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2979 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:08:16,957 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:16,957 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:08:17,104 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:08:17,105 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 176 [2022-12-06 00:08:17,105 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:08:17,105 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:08:17,105 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:08:17,105 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:08:17,105 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable699 [2022-12-06 00:08:17,105 INFO L420 AbstractCegarLoop]: === Iteration 701 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:08:17,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:08:17,105 INFO L85 PathProgramCache]: Analyzing trace with hash 427932896, now seen corresponding path program 1 times [2022-12-06 00:08:17,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:08:17,105 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448972954] [2022-12-06 00:08:17,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:08:17,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:08:17,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:08:17,164 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-06 00:08:17,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:08:17,164 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448972954] [2022-12-06 00:08:17,164 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1448972954] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:08:17,164 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:08:17,164 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:08:17,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565348533] [2022-12-06 00:08:17,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:08:17,165 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:08:17,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:08:17,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:08:17,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:08:17,165 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:08:17,165 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:08:17,165 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:08:17,165 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:08:17,165 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:08:17,438 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:08:17,439 INFO L131 PetriNetUnfolder]: For 26955/27000 co-relation queries the response was YES. [2022-12-06 00:08:17,444 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26955/27000 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13528 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:08:17,452 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:08:17,452 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:08:17,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:08:17,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:08:17,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:08:17,453 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:08:17,453 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:08:17,453 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:08:17,487 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:08:17,488 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:17,488 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:08:17,488 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:08:17,488 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:08:17,488 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:17,489 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:08:17,489 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:08:17,489 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:17,490 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:17,514 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:08:17,514 INFO L131 PetriNetUnfolder]: For 3146/3287 co-relation queries the response was YES. [2022-12-06 00:08:17,515 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3146/3287 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2980 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:08:17,517 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:17,517 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:08:17,659 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:08:17,660 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 172 [2022-12-06 00:08:17,660 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:08:17,660 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:08:17,660 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:08:17,660 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:08:17,660 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable700 [2022-12-06 00:08:17,660 INFO L420 AbstractCegarLoop]: === Iteration 702 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:08:17,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:08:17,660 INFO L85 PathProgramCache]: Analyzing trace with hash -2124224065, now seen corresponding path program 1 times [2022-12-06 00:08:17,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:08:17,660 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370349300] [2022-12-06 00:08:17,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:08:17,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:08:17,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:08:17,731 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-06 00:08:17,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:08:17,731 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370349300] [2022-12-06 00:08:17,731 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1370349300] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:08:17,731 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:08:17,731 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:08:17,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388228349] [2022-12-06 00:08:17,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:08:17,731 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:08:17,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:08:17,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:08:17,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:08:17,732 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:08:17,732 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:08:17,732 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:08:17,732 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:08:17,732 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:08:18,026 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:08:18,026 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:08:18,031 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13561 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:08:18,038 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:08:18,038 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:08:18,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:08:18,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:08:18,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:08:18,039 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:08:18,039 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:08:18,039 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:08:18,070 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:08:18,072 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:18,072 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:08:18,072 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:08:18,072 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:08:18,072 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:18,072 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:08:18,072 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:08:18,073 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:18,073 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:18,097 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:08:18,097 INFO L131 PetriNetUnfolder]: For 3301/3509 co-relation queries the response was YES. [2022-12-06 00:08:18,098 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3301/3509 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2998 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:08:18,100 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:18,100 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:08:18,251 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:08:18,252 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 180 [2022-12-06 00:08:18,252 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:08:18,252 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:08:18,252 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:08:18,252 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:08:18,252 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable701 [2022-12-06 00:08:18,252 INFO L420 AbstractCegarLoop]: === Iteration 703 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:08:18,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:08:18,252 INFO L85 PathProgramCache]: Analyzing trace with hash -381413730, now seen corresponding path program 1 times [2022-12-06 00:08:18,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:08:18,252 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269899026] [2022-12-06 00:08:18,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:08:18,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:08:18,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:08:18,319 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-06 00:08:18,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:08:18,320 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269899026] [2022-12-06 00:08:18,320 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [269899026] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:08:18,320 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:08:18,320 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:08:18,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906833642] [2022-12-06 00:08:18,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:08:18,320 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:08:18,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:08:18,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:08:18,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:08:18,321 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:08:18,321 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:08:18,321 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:08:18,321 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:08:18,321 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:08:18,601 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:08:18,601 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 00:08:18,607 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13574 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:08:18,618 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:08:18,618 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:08:18,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:08:18,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:08:18,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:08:18,619 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:08:18,619 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:08:18,619 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:08:18,655 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:08:18,656 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:18,656 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:08:18,656 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:08:18,656 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:08:18,657 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:18,657 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:08:18,657 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:08:18,657 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:18,658 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:18,682 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:08:18,682 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 00:08:18,683 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3312/3520 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2976 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:08:18,685 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:18,686 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:08:18,840 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:08:18,841 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 185 [2022-12-06 00:08:18,841 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:08:18,841 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:08:18,841 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:08:18,841 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:08:18,841 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable702 [2022-12-06 00:08:18,841 INFO L420 AbstractCegarLoop]: === Iteration 704 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:08:18,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:08:18,841 INFO L85 PathProgramCache]: Analyzing trace with hash 1361396605, now seen corresponding path program 1 times [2022-12-06 00:08:18,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:08:18,842 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514124737] [2022-12-06 00:08:18,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:08:18,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:08:18,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:08:18,910 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-06 00:08:18,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:08:18,911 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514124737] [2022-12-06 00:08:18,911 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [514124737] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:08:18,911 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:08:18,911 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:08:18,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042339675] [2022-12-06 00:08:18,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:08:18,911 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:08:18,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:08:18,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:08:18,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:08:18,911 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:08:18,911 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:08:18,911 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:08:18,911 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:08:18,912 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:08:19,190 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:08:19,190 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:08:19,196 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13565 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:08:19,204 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:08:19,204 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:08:19,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:08:19,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:08:19,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:08:19,205 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:08:19,205 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:08:19,205 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:08:19,241 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:08:19,242 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:19,243 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:08:19,243 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:08:19,243 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:08:19,243 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:19,243 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:08:19,243 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:08:19,243 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:19,244 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:19,268 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:08:19,269 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 00:08:19,270 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3312/3520 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2994 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:08:19,271 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:19,271 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:08:19,440 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:08:19,440 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 197 [2022-12-06 00:08:19,440 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:08:19,440 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:08:19,440 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:08:19,440 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:08:19,441 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable703 [2022-12-06 00:08:19,441 INFO L420 AbstractCegarLoop]: === Iteration 705 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:08:19,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:08:19,441 INFO L85 PathProgramCache]: Analyzing trace with hash -1190760356, now seen corresponding path program 1 times [2022-12-06 00:08:19,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:08:19,441 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111406108] [2022-12-06 00:08:19,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:08:19,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:08:19,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:08:19,508 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-06 00:08:19,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:08:19,508 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111406108] [2022-12-06 00:08:19,508 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2111406108] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:08:19,508 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:08:19,508 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:08:19,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489936618] [2022-12-06 00:08:19,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:08:19,509 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:08:19,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:08:19,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:08:19,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:08:19,509 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:08:19,509 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:08:19,509 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:08:19,509 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:08:19,509 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:08:19,787 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:08:19,787 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 00:08:19,793 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26969/27014 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13525 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:08:19,800 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:08:19,800 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:08:19,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:08:19,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:08:19,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:08:19,801 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:08:19,801 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:08:19,801 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:08:19,836 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:08:19,837 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:19,838 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:08:19,838 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:08:19,838 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:08:19,838 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:19,838 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:08:19,838 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:08:19,838 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:19,839 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:19,863 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:08:19,863 INFO L131 PetriNetUnfolder]: For 3135/3276 co-relation queries the response was YES. [2022-12-06 00:08:19,864 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3135/3276 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2979 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:08:19,866 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:19,866 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:08:20,024 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:08:20,024 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 186 [2022-12-06 00:08:20,024 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:08:20,024 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:08:20,024 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:08:20,024 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:08:20,024 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable704 [2022-12-06 00:08:20,024 INFO L420 AbstractCegarLoop]: === Iteration 706 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:08:20,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:08:20,025 INFO L85 PathProgramCache]: Analyzing trace with hash 552049979, now seen corresponding path program 1 times [2022-12-06 00:08:20,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:08:20,025 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581446220] [2022-12-06 00:08:20,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:08:20,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:08:20,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:08:20,090 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-06 00:08:20,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:08:20,090 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581446220] [2022-12-06 00:08:20,090 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [581446220] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:08:20,090 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:08:20,090 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:08:20,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389430463] [2022-12-06 00:08:20,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:08:20,090 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:08:20,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:08:20,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:08:20,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:08:20,091 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:08:20,091 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:08:20,091 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:08:20,091 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:08:20,091 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:08:20,373 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:08:20,373 INFO L131 PetriNetUnfolder]: For 26955/27000 co-relation queries the response was YES. [2022-12-06 00:08:20,379 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26955/27000 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13511 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:08:20,387 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:08:20,387 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:08:20,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:08:20,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:08:20,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:08:20,388 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:08:20,388 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:08:20,388 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:08:20,424 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:08:20,425 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:20,425 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:08:20,425 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:08:20,425 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:08:20,425 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:20,426 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:08:20,426 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:08:20,426 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:20,426 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:20,450 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:08:20,451 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 00:08:20,452 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3133/3273 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2971 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:08:20,453 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:20,454 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:08:20,608 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:08:20,608 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 183 [2022-12-06 00:08:20,608 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:08:20,608 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:08:20,608 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:08:20,608 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:08:20,608 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable705 [2022-12-06 00:08:20,608 INFO L420 AbstractCegarLoop]: === Iteration 707 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:08:20,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:08:20,609 INFO L85 PathProgramCache]: Analyzing trace with hash -2000106982, now seen corresponding path program 1 times [2022-12-06 00:08:20,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:08:20,609 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821878473] [2022-12-06 00:08:20,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:08:20,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:08:20,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:08:20,667 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-06 00:08:20,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:08:20,668 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821878473] [2022-12-06 00:08:20,668 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1821878473] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:08:20,668 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:08:20,668 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:08:20,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357251079] [2022-12-06 00:08:20,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:08:20,668 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:08:20,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:08:20,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:08:20,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:08:20,668 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:08:20,668 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:08:20,668 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:08:20,668 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:08:20,669 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:08:20,990 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:08:20,990 INFO L131 PetriNetUnfolder]: For 27146/27191 co-relation queries the response was YES. [2022-12-06 00:08:20,995 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27146/27191 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13524 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:08:21,002 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:08:21,002 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:08:21,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:08:21,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:08:21,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:08:21,003 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:08:21,003 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:08:21,003 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:08:21,033 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:08:21,034 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:21,034 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:08:21,035 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:08:21,035 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:08:21,035 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:21,035 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:08:21,035 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:08:21,035 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:21,036 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:21,060 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:08:21,060 INFO L131 PetriNetUnfolder]: For 3167/3307 co-relation queries the response was YES. [2022-12-06 00:08:21,062 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3167/3307 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2978 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:08:21,064 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:21,064 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:08:21,220 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:08:21,221 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 186 [2022-12-06 00:08:21,221 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:08:21,221 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:08:21,221 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:08:21,221 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:08:21,221 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable706 [2022-12-06 00:08:21,221 INFO L420 AbstractCegarLoop]: === Iteration 708 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:08:21,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:08:21,221 INFO L85 PathProgramCache]: Analyzing trace with hash -257296647, now seen corresponding path program 1 times [2022-12-06 00:08:21,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:08:21,221 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887975] [2022-12-06 00:08:21,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:08:21,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:08:21,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:08:21,288 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-06 00:08:21,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:08:21,289 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887975] [2022-12-06 00:08:21,289 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1887975] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:08:21,289 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:08:21,289 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:08:21,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131097831] [2022-12-06 00:08:21,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:08:21,289 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:08:21,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:08:21,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:08:21,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:08:21,289 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:08:21,290 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:08:21,290 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:08:21,290 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:08:21,290 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:08:21,569 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:08:21,569 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:08:21,575 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13551 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:08:21,583 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:08:21,583 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:08:21,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:08:21,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:08:21,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:08:21,584 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:08:21,584 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:08:21,584 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:08:21,620 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:08:21,621 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:21,622 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:08:21,622 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:08:21,622 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:08:21,622 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:21,622 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:08:21,622 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:08:21,622 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:21,623 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:21,647 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:08:21,648 INFO L131 PetriNetUnfolder]: For 3310/3519 co-relation queries the response was YES. [2022-12-06 00:08:21,649 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3310/3519 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2996 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:08:21,651 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:21,651 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:08:21,795 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:08:21,796 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 174 [2022-12-06 00:08:21,796 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:08:21,796 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:08:21,796 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:08:21,796 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:08:21,796 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable707 [2022-12-06 00:08:21,796 INFO L420 AbstractCegarLoop]: === Iteration 709 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:08:21,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:08:21,796 INFO L85 PathProgramCache]: Analyzing trace with hash 1485513688, now seen corresponding path program 1 times [2022-12-06 00:08:21,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:08:21,797 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229050128] [2022-12-06 00:08:21,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:08:21,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:08:21,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:08:21,864 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-06 00:08:21,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:08:21,864 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229050128] [2022-12-06 00:08:21,864 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [229050128] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:08:21,864 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:08:21,864 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:08:21,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79649780] [2022-12-06 00:08:21,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:08:21,864 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:08:21,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:08:21,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:08:21,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:08:21,865 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:08:21,865 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:08:21,865 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:08:21,865 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:08:21,865 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:08:22,138 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:08:22,139 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:08:22,144 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13555 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:08:22,151 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:08:22,151 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:08:22,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:08:22,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:08:22,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:08:22,152 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:08:22,152 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:08:22,152 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:08:22,186 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:08:22,187 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:22,187 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:08:22,188 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:08:22,188 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:08:22,188 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:22,188 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:08:22,188 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:08:22,188 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:22,189 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:22,212 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:08:22,213 INFO L131 PetriNetUnfolder]: For 3338/3547 co-relation queries the response was YES. [2022-12-06 00:08:22,213 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3338/3547 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2978 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:08:22,215 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:22,215 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:08:22,352 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:08:22,353 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 165 [2022-12-06 00:08:22,353 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:08:22,353 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:08:22,353 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:08:22,353 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:08:22,353 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable708 [2022-12-06 00:08:22,353 INFO L420 AbstractCegarLoop]: === Iteration 710 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:08:22,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:08:22,354 INFO L85 PathProgramCache]: Analyzing trace with hash -1066643273, now seen corresponding path program 1 times [2022-12-06 00:08:22,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:08:22,354 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547269559] [2022-12-06 00:08:22,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:08:22,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:08:22,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:08:22,422 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-06 00:08:22,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:08:22,422 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547269559] [2022-12-06 00:08:22,422 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1547269559] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:08:22,422 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:08:22,422 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:08:22,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153271659] [2022-12-06 00:08:22,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:08:22,422 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:08:22,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:08:22,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:08:22,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:08:22,423 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:08:22,423 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:08:22,423 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:08:22,423 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:08:22,423 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:08:22,685 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:08:22,685 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:08:22,691 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13563 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:08:22,698 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:08:22,698 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:08:22,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:08:22,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:08:22,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:08:22,699 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:08:22,699 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:08:22,699 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:08:22,749 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:08:22,751 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:22,751 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:08:22,751 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:08:22,751 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:08:22,752 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:22,752 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:08:22,752 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:08:22,752 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:22,753 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:22,787 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:08:22,787 INFO L131 PetriNetUnfolder]: For 3304/3511 co-relation queries the response was YES. [2022-12-06 00:08:22,788 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3304/3511 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2983 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:08:22,791 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:22,791 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:08:22,983 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:08:22,984 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 233 [2022-12-06 00:08:22,984 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:08:22,984 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:08:22,984 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:08:22,984 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:08:22,984 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable709 [2022-12-06 00:08:22,984 INFO L420 AbstractCegarLoop]: === Iteration 711 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:08:22,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:08:22,985 INFO L85 PathProgramCache]: Analyzing trace with hash 676167062, now seen corresponding path program 1 times [2022-12-06 00:08:22,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:08:22,985 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764694616] [2022-12-06 00:08:22,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:08:22,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:08:23,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:08:23,060 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-06 00:08:23,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:08:23,060 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764694616] [2022-12-06 00:08:23,060 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1764694616] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:08:23,060 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:08:23,060 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:08:23,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974397138] [2022-12-06 00:08:23,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:08:23,061 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:08:23,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:08:23,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:08:23,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:08:23,061 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:08:23,061 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:08:23,061 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:08:23,061 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:08:23,061 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:08:23,355 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:08:23,355 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:08:23,361 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13536 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:08:23,369 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:08:23,369 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:08:23,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:08:23,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:08:23,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:08:23,370 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:08:23,370 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:08:23,370 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:08:23,406 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:08:23,407 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:23,407 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:08:23,407 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:08:23,407 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:08:23,407 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:23,408 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:08:23,408 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:08:23,408 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:23,408 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:23,432 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:08:23,433 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 00:08:23,434 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3312/3520 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2988 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:08:23,435 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:23,436 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:08:23,584 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:08:23,585 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 178 [2022-12-06 00:08:23,585 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:08:23,585 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:08:23,585 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:08:23,585 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:08:23,585 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable710 [2022-12-06 00:08:23,585 INFO L420 AbstractCegarLoop]: === Iteration 712 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:08:23,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:08:23,585 INFO L85 PathProgramCache]: Analyzing trace with hash -1875989899, now seen corresponding path program 1 times [2022-12-06 00:08:23,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:08:23,586 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962790] [2022-12-06 00:08:23,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:08:23,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:08:23,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:08:23,653 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-06 00:08:23,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:08:23,653 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962790] [2022-12-06 00:08:23,653 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1962790] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:08:23,653 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:08:23,653 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:08:23,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542421597] [2022-12-06 00:08:23,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:08:23,654 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:08:23,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:08:23,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:08:23,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:08:23,654 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:08:23,654 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:08:23,654 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:08:23,654 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:08:23,654 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:08:23,959 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:08:23,959 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:08:23,964 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13548 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:08:23,970 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:08:23,970 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:08:23,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:08:23,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:08:23,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:08:23,971 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:08:23,971 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:08:23,971 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:08:24,001 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:08:24,003 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:24,003 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:08:24,003 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:08:24,003 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:08:24,003 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:24,004 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:08:24,004 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:08:24,004 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:24,005 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:24,037 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:08:24,037 INFO L131 PetriNetUnfolder]: For 3301/3509 co-relation queries the response was YES. [2022-12-06 00:08:24,038 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3301/3509 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2999 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:08:24,040 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:24,040 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:08:24,197 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:08:24,197 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 194 [2022-12-06 00:08:24,197 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:08:24,198 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:08:24,198 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:08:24,198 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:08:24,198 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable711 [2022-12-06 00:08:24,198 INFO L420 AbstractCegarLoop]: === Iteration 713 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:08:24,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:08:24,198 INFO L85 PathProgramCache]: Analyzing trace with hash -133179564, now seen corresponding path program 1 times [2022-12-06 00:08:24,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:08:24,198 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636638274] [2022-12-06 00:08:24,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:08:24,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:08:24,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:08:24,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-06 00:08:24,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:08:24,269 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636638274] [2022-12-06 00:08:24,269 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1636638274] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:08:24,269 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:08:24,269 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:08:24,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761174746] [2022-12-06 00:08:24,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:08:24,269 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:08:24,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:08:24,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:08:24,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:08:24,270 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:08:24,270 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:08:24,270 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:08:24,270 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:08:24,270 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:08:24,551 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:08:24,551 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 00:08:24,557 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13575 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:08:24,565 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:08:24,566 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:08:24,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:08:24,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:08:24,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:08:24,566 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:08:24,566 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:08:24,566 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:08:24,601 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:08:24,602 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:24,602 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:08:24,602 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:08:24,602 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:08:24,602 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:24,603 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:08:24,603 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:08:24,603 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:24,603 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:24,627 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:08:24,627 INFO L131 PetriNetUnfolder]: For 3349/3561 co-relation queries the response was YES. [2022-12-06 00:08:24,628 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3349/3561 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2992 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:08:24,630 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:24,630 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:08:24,775 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:08:24,775 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 173 [2022-12-06 00:08:24,775 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:08:24,775 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:08:24,775 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:08:24,775 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:08:24,776 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable712 [2022-12-06 00:08:24,776 INFO L420 AbstractCegarLoop]: === Iteration 714 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:08:24,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:08:24,776 INFO L85 PathProgramCache]: Analyzing trace with hash 1609630771, now seen corresponding path program 1 times [2022-12-06 00:08:24,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:08:24,776 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815095819] [2022-12-06 00:08:24,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:08:24,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:08:24,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:08:24,838 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-06 00:08:24,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:08:24,838 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815095819] [2022-12-06 00:08:24,838 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1815095819] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:08:24,838 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:08:24,838 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:08:24,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202693700] [2022-12-06 00:08:24,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:08:24,839 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:08:24,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:08:24,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:08:24,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:08:24,839 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:08:24,839 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:08:24,839 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:08:24,839 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:08:24,839 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:08:25,111 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:08:25,111 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:08:25,117 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13562 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:08:25,124 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:08:25,125 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:08:25,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:08:25,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:08:25,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:08:25,125 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:08:25,125 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:08:25,125 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:08:25,163 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:08:25,164 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:25,164 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:08:25,164 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:08:25,164 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:08:25,164 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:25,165 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:08:25,165 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:08:25,165 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:25,165 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:25,191 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:08:25,191 INFO L131 PetriNetUnfolder]: For 3293/3500 co-relation queries the response was YES. [2022-12-06 00:08:25,192 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3293/3500 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2991 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:08:25,194 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:25,194 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:08:25,337 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:08:25,337 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 173 [2022-12-06 00:08:25,337 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:08:25,337 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:08:25,337 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:08:25,338 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:08:25,338 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable713 [2022-12-06 00:08:25,338 INFO L420 AbstractCegarLoop]: === Iteration 715 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:08:25,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:08:25,338 INFO L85 PathProgramCache]: Analyzing trace with hash -942526190, now seen corresponding path program 1 times [2022-12-06 00:08:25,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:08:25,338 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731393007] [2022-12-06 00:08:25,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:08:25,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:08:25,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:08:25,415 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-06 00:08:25,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:08:25,415 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731393007] [2022-12-06 00:08:25,416 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1731393007] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:08:25,416 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:08:25,416 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:08:25,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668582523] [2022-12-06 00:08:25,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:08:25,416 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:08:25,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:08:25,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:08:25,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:08:25,416 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:08:25,416 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:08:25,416 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:08:25,416 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:08:25,416 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:08:25,690 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:08:25,691 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 00:08:25,696 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13550 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:08:25,703 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:08:25,703 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:08:25,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:08:25,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:08:25,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:08:25,704 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:08:25,704 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:08:25,704 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:08:25,737 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:08:25,738 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:25,738 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:08:25,738 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:08:25,738 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:08:25,738 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:25,739 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:08:25,739 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:08:25,739 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:25,739 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:25,763 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:08:25,763 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 00:08:25,764 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3312/3520 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2999 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:08:25,765 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:25,765 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:08:25,911 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:08:25,912 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 174 [2022-12-06 00:08:25,912 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:08:25,912 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:08:25,912 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:08:25,912 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:08:25,912 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable714 [2022-12-06 00:08:25,912 INFO L420 AbstractCegarLoop]: === Iteration 716 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:08:25,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:08:25,912 INFO L85 PathProgramCache]: Analyzing trace with hash 800284145, now seen corresponding path program 1 times [2022-12-06 00:08:25,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:08:25,913 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282535965] [2022-12-06 00:08:25,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:08:25,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:08:25,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:08:25,980 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-06 00:08:25,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:08:25,980 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282535965] [2022-12-06 00:08:25,980 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1282535965] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:08:25,980 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:08:25,980 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:08:25,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280308838] [2022-12-06 00:08:25,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:08:25,980 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:08:25,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:08:25,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:08:25,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:08:25,981 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:08:25,981 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:08:25,981 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:08:25,981 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:08:25,981 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:08:26,250 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:08:26,250 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:08:26,255 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13565 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:08:26,262 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:08:26,262 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:08:26,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:08:26,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:08:26,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:08:26,263 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:08:26,263 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:08:26,263 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:08:26,297 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:08:26,298 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:26,298 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:08:26,298 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:08:26,298 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:08:26,298 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:26,299 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:08:26,299 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:08:26,299 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:26,299 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:26,323 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:08:26,323 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 00:08:26,323 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3321/3530 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2991 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:08:26,325 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:26,325 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:08:26,474 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:08:26,474 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 176 [2022-12-06 00:08:26,475 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:08:26,475 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:08:26,475 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:08:26,475 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:08:26,475 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable715 [2022-12-06 00:08:26,475 INFO L420 AbstractCegarLoop]: === Iteration 717 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:08:26,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:08:26,475 INFO L85 PathProgramCache]: Analyzing trace with hash -1751872816, now seen corresponding path program 1 times [2022-12-06 00:08:26,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:08:26,475 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622184360] [2022-12-06 00:08:26,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:08:26,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:08:26,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:08:26,532 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-06 00:08:26,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:08:26,532 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622184360] [2022-12-06 00:08:26,532 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1622184360] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:08:26,532 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:08:26,532 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:08:26,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379490217] [2022-12-06 00:08:26,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:08:26,532 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:08:26,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:08:26,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:08:26,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:08:26,533 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:08:26,533 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:08:26,533 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:08:26,533 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:08:26,533 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:08:26,825 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:08:26,825 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:08:26,829 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13589 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:08:26,835 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:08:26,835 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:08:26,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:08:26,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:08:26,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:08:26,835 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:08:26,835 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:08:26,836 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:08:26,864 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:08:26,865 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:26,866 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:08:26,866 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:08:26,866 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:08:26,866 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:26,866 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:08:26,866 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:08:26,866 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:26,867 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:26,891 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:08:26,891 INFO L131 PetriNetUnfolder]: For 3348/3558 co-relation queries the response was YES. [2022-12-06 00:08:26,892 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3348/3558 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2986 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:08:26,894 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:26,894 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:08:27,037 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:08:27,037 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 171 [2022-12-06 00:08:27,037 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:08:27,037 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:08:27,037 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:08:27,037 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:08:27,038 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable716 [2022-12-06 00:08:27,038 INFO L420 AbstractCegarLoop]: === Iteration 718 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:08:27,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:08:27,038 INFO L85 PathProgramCache]: Analyzing trace with hash -9062481, now seen corresponding path program 1 times [2022-12-06 00:08:27,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:08:27,038 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288907678] [2022-12-06 00:08:27,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:08:27,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:08:27,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:08:27,104 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-06 00:08:27,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:08:27,104 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288907678] [2022-12-06 00:08:27,104 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [288907678] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:08:27,104 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:08:27,104 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:08:27,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884041727] [2022-12-06 00:08:27,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:08:27,105 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:08:27,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:08:27,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:08:27,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:08:27,105 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:08:27,105 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:08:27,105 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:08:27,105 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:08:27,105 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:08:27,385 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:08:27,385 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 00:08:27,391 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26969/27014 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13518 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:08:27,398 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:08:27,398 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:08:27,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:08:27,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:08:27,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:08:27,399 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:08:27,399 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:08:27,399 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:08:27,433 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:08:27,434 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:27,434 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:08:27,434 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:08:27,434 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:08:27,435 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:27,435 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:08:27,435 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:08:27,435 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:27,436 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:27,459 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:08:27,460 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 00:08:27,461 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3133/3273 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2979 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:08:27,462 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:27,463 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:08:27,610 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:08:27,611 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 177 [2022-12-06 00:08:27,611 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:08:27,611 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:08:27,611 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:08:27,611 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:08:27,611 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable717 [2022-12-06 00:08:27,611 INFO L420 AbstractCegarLoop]: === Iteration 719 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:08:27,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:08:27,611 INFO L85 PathProgramCache]: Analyzing trace with hash 1733747854, now seen corresponding path program 1 times [2022-12-06 00:08:27,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:08:27,611 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697750205] [2022-12-06 00:08:27,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:08:27,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:08:27,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:08:27,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-06 00:08:27,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:08:27,671 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697750205] [2022-12-06 00:08:27,671 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [697750205] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:08:27,671 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:08:27,671 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:08:27,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740817285] [2022-12-06 00:08:27,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:08:27,671 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:08:27,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:08:27,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:08:27,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:08:27,671 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:08:27,672 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:08:27,672 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:08:27,672 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:08:27,672 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:08:27,943 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:08:27,943 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 00:08:27,949 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26969/27014 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13516 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:08:27,957 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:08:27,957 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:08:27,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:08:27,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:08:27,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:08:27,958 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:08:27,958 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:08:27,958 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:08:27,993 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:08:27,994 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:27,995 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:08:27,995 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:08:27,995 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:08:27,995 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:27,995 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:08:27,995 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:08:27,995 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:27,996 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:28,020 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:08:28,020 INFO L131 PetriNetUnfolder]: For 3122/3262 co-relation queries the response was YES. [2022-12-06 00:08:28,021 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3122/3262 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2978 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:08:28,023 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:28,023 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:08:28,175 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:08:28,176 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 181 [2022-12-06 00:08:28,176 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:08:28,176 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:08:28,176 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:08:28,176 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:08:28,176 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable718 [2022-12-06 00:08:28,176 INFO L420 AbstractCegarLoop]: === Iteration 720 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:08:28,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:08:28,176 INFO L85 PathProgramCache]: Analyzing trace with hash -818409107, now seen corresponding path program 1 times [2022-12-06 00:08:28,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:08:28,176 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913247785] [2022-12-06 00:08:28,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:08:28,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:08:28,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:08:28,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-06 00:08:28,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:08:28,243 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913247785] [2022-12-06 00:08:28,243 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [913247785] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:08:28,243 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:08:28,243 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:08:28,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000990982] [2022-12-06 00:08:28,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:08:28,244 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:08:28,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:08:28,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:08:28,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:08:28,244 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:08:28,244 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:08:28,244 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:08:28,244 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:08:28,244 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:08:28,516 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:08:28,516 INFO L131 PetriNetUnfolder]: For 27136/27181 co-relation queries the response was YES. [2022-12-06 00:08:28,522 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27136/27181 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13555 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:08:28,530 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:08:28,531 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:08:28,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:08:28,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:08:28,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:08:28,532 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:08:28,532 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:08:28,532 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:08:28,568 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:08:28,569 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:28,569 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:08:28,570 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:08:28,570 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:08:28,570 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:28,570 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:08:28,570 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:08:28,571 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:28,571 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:28,596 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:08:28,596 INFO L131 PetriNetUnfolder]: For 3167/3307 co-relation queries the response was YES. [2022-12-06 00:08:28,597 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3167/3307 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2990 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:08:28,599 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:28,599 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:08:28,744 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:08:28,744 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 174 [2022-12-06 00:08:28,744 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:08:28,744 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:08:28,744 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:08:28,744 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:08:28,744 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable719 [2022-12-06 00:08:28,744 INFO L420 AbstractCegarLoop]: === Iteration 721 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:08:28,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:08:28,745 INFO L85 PathProgramCache]: Analyzing trace with hash 924401228, now seen corresponding path program 1 times [2022-12-06 00:08:28,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:08:28,745 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001875126] [2022-12-06 00:08:28,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:08:28,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:08:28,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:08:28,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-06 00:08:28,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:08:28,803 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001875126] [2022-12-06 00:08:28,803 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1001875126] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:08:28,803 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:08:28,803 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:08:28,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078757321] [2022-12-06 00:08:28,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:08:28,803 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:08:28,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:08:28,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:08:28,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:08:28,803 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:08:28,803 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:08:28,803 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:08:28,803 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:08:28,803 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:08:29,078 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:08:29,078 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 00:08:29,083 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26969/27014 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13551 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:08:29,091 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:08:29,091 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:08:29,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:08:29,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:08:29,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:08:29,091 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:08:29,092 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:08:29,092 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:08:29,126 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:08:29,127 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:29,127 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:08:29,127 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:08:29,127 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:08:29,127 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:29,128 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:08:29,128 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:08:29,128 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:29,128 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:29,152 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:08:29,152 INFO L131 PetriNetUnfolder]: For 3135/3276 co-relation queries the response was YES. [2022-12-06 00:08:29,153 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3135/3276 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2973 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:08:29,155 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:29,155 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:08:29,314 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:08:29,314 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 187 [2022-12-06 00:08:29,315 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:08:29,315 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:08:29,315 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:08:29,315 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:08:29,315 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable720 [2022-12-06 00:08:29,315 INFO L420 AbstractCegarLoop]: === Iteration 722 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:08:29,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:08:29,315 INFO L85 PathProgramCache]: Analyzing trace with hash -1627755733, now seen corresponding path program 1 times [2022-12-06 00:08:29,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:08:29,315 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050427603] [2022-12-06 00:08:29,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:08:29,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:08:29,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:08:29,374 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-06 00:08:29,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:08:29,375 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050427603] [2022-12-06 00:08:29,375 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2050427603] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:08:29,375 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:08:29,375 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:08:29,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480137358] [2022-12-06 00:08:29,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:08:29,375 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:08:29,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:08:29,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:08:29,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:08:29,375 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:08:29,376 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:08:29,376 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:08:29,376 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:08:29,376 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:08:29,644 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:08:29,644 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 00:08:29,649 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26969/27014 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13538 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:08:29,657 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:08:29,657 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:08:29,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:08:29,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:08:29,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:08:29,657 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:08:29,657 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:08:29,657 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:08:29,690 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:08:29,692 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:29,692 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:08:29,692 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:08:29,692 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:08:29,692 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:29,692 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:08:29,692 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:08:29,692 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:29,693 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:29,724 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:08:29,724 INFO L131 PetriNetUnfolder]: For 3122/3262 co-relation queries the response was YES. [2022-12-06 00:08:29,725 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3122/3262 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2974 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:08:29,727 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:29,727 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:08:29,877 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:08:29,877 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 185 [2022-12-06 00:08:29,877 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:08:29,877 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:08:29,878 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:08:29,878 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:08:29,878 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable721 [2022-12-06 00:08:29,878 INFO L420 AbstractCegarLoop]: === Iteration 723 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:08:29,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:08:29,878 INFO L85 PathProgramCache]: Analyzing trace with hash 115054602, now seen corresponding path program 1 times [2022-12-06 00:08:29,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:08:29,878 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243314006] [2022-12-06 00:08:29,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:08:29,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:08:29,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:08:29,937 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-06 00:08:29,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:08:29,937 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243314006] [2022-12-06 00:08:29,937 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [243314006] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:08:29,937 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:08:29,937 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:08:29,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448408134] [2022-12-06 00:08:29,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:08:29,937 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:08:29,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:08:29,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:08:29,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:08:29,938 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:08:29,938 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:08:29,938 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:08:29,938 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:08:29,938 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:08:30,202 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:08:30,203 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 00:08:30,207 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13557 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:08:30,215 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:08:30,215 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:08:30,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:08:30,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:08:30,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:08:30,216 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:08:30,216 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:08:30,216 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:08:30,248 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:08:30,250 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:30,250 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:08:30,250 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:08:30,250 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:08:30,250 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:30,250 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:08:30,250 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:08:30,250 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:30,251 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:30,275 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:08:30,275 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 00:08:30,276 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3312/3520 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2996 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:08:30,278 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:30,278 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:08:30,423 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:08:30,424 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 174 [2022-12-06 00:08:30,424 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:08:30,424 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:08:30,424 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:08:30,424 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:08:30,424 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable722 [2022-12-06 00:08:30,424 INFO L420 AbstractCegarLoop]: === Iteration 724 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:08:30,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:08:30,424 INFO L85 PathProgramCache]: Analyzing trace with hash 1857864937, now seen corresponding path program 1 times [2022-12-06 00:08:30,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:08:30,424 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818057958] [2022-12-06 00:08:30,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:08:30,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:08:30,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:08:30,492 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-06 00:08:30,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:08:30,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818057958] [2022-12-06 00:08:30,492 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [818057958] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:08:30,492 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:08:30,492 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:08:30,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938115996] [2022-12-06 00:08:30,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:08:30,492 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:08:30,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:08:30,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:08:30,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:08:30,493 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:08:30,493 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:08:30,493 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:08:30,493 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:08:30,493 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:08:30,772 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:08:30,773 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 00:08:30,778 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26965/27010 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13511 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:08:30,785 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:08:30,785 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:08:30,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:08:30,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:08:30,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:08:30,786 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:08:30,786 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:08:30,786 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:08:30,819 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:08:30,820 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:30,820 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:08:30,821 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:08:30,821 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:08:30,821 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:30,821 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:08:30,821 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:08:30,821 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:30,822 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:30,847 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:08:30,847 INFO L131 PetriNetUnfolder]: For 3134/3275 co-relation queries the response was YES. [2022-12-06 00:08:30,848 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3134/3275 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2973 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:08:30,850 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:30,850 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:08:31,003 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:08:31,004 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 183 [2022-12-06 00:08:31,004 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:08:31,004 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:08:31,004 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:08:31,004 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:08:31,004 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable723 [2022-12-06 00:08:31,004 INFO L420 AbstractCegarLoop]: === Iteration 725 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:08:31,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:08:31,004 INFO L85 PathProgramCache]: Analyzing trace with hash -694292024, now seen corresponding path program 1 times [2022-12-06 00:08:31,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:08:31,005 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99427147] [2022-12-06 00:08:31,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:08:31,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:08:31,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:08:31,072 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-06 00:08:31,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:08:31,072 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99427147] [2022-12-06 00:08:31,072 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [99427147] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:08:31,072 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:08:31,072 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:08:31,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092114749] [2022-12-06 00:08:31,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:08:31,073 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:08:31,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:08:31,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:08:31,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:08:31,073 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:08:31,073 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:08:31,073 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:08:31,073 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:08:31,073 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:08:31,353 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:08:31,353 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:08:31,358 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13573 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:08:31,364 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:08:31,365 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:08:31,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:08:31,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:08:31,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:08:31,365 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:08:31,365 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:08:31,365 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:08:31,396 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:08:31,398 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:31,398 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:08:31,398 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:08:31,398 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:08:31,398 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:31,398 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:08:31,398 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:08:31,398 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:31,399 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:31,422 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:08:31,423 INFO L131 PetriNetUnfolder]: For 3338/3550 co-relation queries the response was YES. [2022-12-06 00:08:31,423 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3338/3550 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2974 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:08:31,425 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:31,425 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:08:31,578 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:08:31,579 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 181 [2022-12-06 00:08:31,579 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:08:31,579 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:08:31,579 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:08:31,579 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:08:31,579 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable724 [2022-12-06 00:08:31,579 INFO L420 AbstractCegarLoop]: === Iteration 726 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:08:31,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:08:31,580 INFO L85 PathProgramCache]: Analyzing trace with hash 1048518311, now seen corresponding path program 1 times [2022-12-06 00:08:31,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:08:31,580 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189310430] [2022-12-06 00:08:31,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:08:31,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:08:31,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:08:31,646 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-06 00:08:31,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:08:31,646 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189310430] [2022-12-06 00:08:31,646 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1189310430] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:08:31,647 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:08:31,647 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:08:31,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102845107] [2022-12-06 00:08:31,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:08:31,647 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:08:31,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:08:31,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:08:31,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:08:31,647 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:08:31,647 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:08:31,647 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:08:31,647 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:08:31,648 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:08:31,926 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:08:31,927 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 00:08:31,932 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13553 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:08:31,939 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:08:31,939 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:08:31,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:08:31,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:08:31,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:08:31,940 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:08:31,940 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:08:31,940 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:08:31,974 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:08:31,975 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:31,975 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:08:31,975 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:08:31,975 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:08:31,976 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:31,976 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:08:31,976 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:08:31,976 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:31,977 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:32,000 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:08:32,001 INFO L131 PetriNetUnfolder]: For 3301/3509 co-relation queries the response was YES. [2022-12-06 00:08:32,001 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3301/3509 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 3000 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:08:32,003 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:32,003 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:08:32,152 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:08:32,152 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 177 [2022-12-06 00:08:32,152 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:08:32,152 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:08:32,152 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:08:32,152 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:08:32,152 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable725 [2022-12-06 00:08:32,153 INFO L420 AbstractCegarLoop]: === Iteration 727 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:08:32,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:08:32,153 INFO L85 PathProgramCache]: Analyzing trace with hash -1503638650, now seen corresponding path program 1 times [2022-12-06 00:08:32,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:08:32,153 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979881437] [2022-12-06 00:08:32,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:08:32,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:08:32,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:08:32,211 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-06 00:08:32,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:08:32,211 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979881437] [2022-12-06 00:08:32,211 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1979881437] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:08:32,211 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:08:32,211 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:08:32,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886812589] [2022-12-06 00:08:32,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:08:32,211 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:08:32,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:08:32,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:08:32,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:08:32,212 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:08:32,212 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:08:32,212 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:08:32,212 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:08:32,212 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:08:32,477 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:08:32,477 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 00:08:32,483 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13558 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:08:32,490 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:08:32,490 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:08:32,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:08:32,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:08:32,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:08:32,491 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:08:32,491 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:08:32,491 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:08:32,525 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:08:32,526 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:32,526 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:08:32,526 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:08:32,526 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:08:32,526 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:32,527 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:08:32,527 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:08:32,527 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:32,527 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:32,552 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:08:32,552 INFO L131 PetriNetUnfolder]: For 3301/3509 co-relation queries the response was YES. [2022-12-06 00:08:32,553 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3301/3509 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 3000 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:08:32,555 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:32,555 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:08:32,703 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:08:32,704 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 178 [2022-12-06 00:08:32,704 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:08:32,704 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:08:32,704 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:08:32,704 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:08:32,704 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable726 [2022-12-06 00:08:32,704 INFO L420 AbstractCegarLoop]: === Iteration 728 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:08:32,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:08:32,704 INFO L85 PathProgramCache]: Analyzing trace with hash 239171685, now seen corresponding path program 1 times [2022-12-06 00:08:32,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:08:32,705 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417279074] [2022-12-06 00:08:32,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:08:32,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:08:32,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:08:32,768 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-06 00:08:32,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:08:32,768 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417279074] [2022-12-06 00:08:32,768 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [417279074] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:08:32,768 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:08:32,768 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:08:32,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061752850] [2022-12-06 00:08:32,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:08:32,769 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:08:32,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:08:32,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:08:32,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:08:32,769 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:08:32,769 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:08:32,769 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:08:32,769 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:08:32,769 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:08:33,037 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:08:33,038 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 00:08:33,043 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13587 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:08:33,050 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:08:33,050 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:08:33,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:08:33,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:08:33,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:08:33,051 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:08:33,051 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:08:33,051 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:08:33,084 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:08:33,085 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:33,086 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:08:33,086 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:08:33,086 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:08:33,086 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:33,086 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:08:33,086 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:08:33,086 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:33,087 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:33,110 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:08:33,111 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 00:08:33,111 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3321/3530 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2974 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:08:33,113 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:33,113 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:08:33,256 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:08:33,257 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 171 [2022-12-06 00:08:33,257 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:08:33,257 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:08:33,257 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:08:33,257 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:08:33,257 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable727 [2022-12-06 00:08:33,257 INFO L420 AbstractCegarLoop]: === Iteration 729 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:08:33,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:08:33,257 INFO L85 PathProgramCache]: Analyzing trace with hash 1981982020, now seen corresponding path program 1 times [2022-12-06 00:08:33,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:08:33,258 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670972381] [2022-12-06 00:08:33,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:08:33,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:08:33,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:08:33,334 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-06 00:08:33,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:08:33,334 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670972381] [2022-12-06 00:08:33,335 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1670972381] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:08:33,335 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:08:33,335 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:08:33,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752551321] [2022-12-06 00:08:33,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:08:33,335 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:08:33,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:08:33,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:08:33,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:08:33,335 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:08:33,335 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:08:33,335 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:08:33,335 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:08:33,335 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:08:33,642 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:08:33,642 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:08:33,648 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13546 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:08:33,657 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:08:33,657 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:08:33,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:08:33,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:08:33,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:08:33,658 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:08:33,658 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:08:33,658 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:08:33,691 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:08:33,692 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:33,692 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:08:33,692 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:08:33,692 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:08:33,692 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:33,693 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:08:33,693 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:08:33,693 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:33,693 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:33,718 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:08:33,718 INFO L131 PetriNetUnfolder]: For 3348/3558 co-relation queries the response was YES. [2022-12-06 00:08:33,719 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3348/3558 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2996 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:08:33,721 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:33,721 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:08:33,872 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:08:33,872 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 180 [2022-12-06 00:08:33,873 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:08:33,873 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:08:33,873 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:08:33,873 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:08:33,873 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable728 [2022-12-06 00:08:33,873 INFO L420 AbstractCegarLoop]: === Iteration 730 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:08:33,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:08:33,873 INFO L85 PathProgramCache]: Analyzing trace with hash -570174941, now seen corresponding path program 1 times [2022-12-06 00:08:33,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:08:33,873 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054833469] [2022-12-06 00:08:33,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:08:33,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:08:33,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:08:33,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-06 00:08:33,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:08:33,939 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054833469] [2022-12-06 00:08:33,940 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2054833469] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:08:33,940 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:08:33,940 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:08:33,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971223277] [2022-12-06 00:08:33,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:08:33,940 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:08:33,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:08:33,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:08:33,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:08:33,940 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:08:33,940 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:08:33,940 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:08:33,940 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:08:33,940 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:08:34,239 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:08:34,239 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:08:34,244 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13572 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:08:34,250 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:08:34,250 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:08:34,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:08:34,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:08:34,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:08:34,251 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:08:34,251 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:08:34,251 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:08:34,280 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:08:34,281 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:34,281 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:08:34,281 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:08:34,282 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:08:34,282 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:34,282 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:08:34,282 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:08:34,282 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:34,283 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:34,307 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:08:34,307 INFO L131 PetriNetUnfolder]: For 3304/3511 co-relation queries the response was YES. [2022-12-06 00:08:34,308 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3304/3511 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2981 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:08:34,310 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:34,310 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:08:34,460 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:08:34,460 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 178 [2022-12-06 00:08:34,460 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:08:34,460 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:08:34,460 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:08:34,460 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:08:34,460 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable729 [2022-12-06 00:08:34,460 INFO L420 AbstractCegarLoop]: === Iteration 731 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:08:34,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:08:34,461 INFO L85 PathProgramCache]: Analyzing trace with hash 1172635394, now seen corresponding path program 1 times [2022-12-06 00:08:34,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:08:34,461 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408880536] [2022-12-06 00:08:34,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:08:34,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:08:34,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:08:34,532 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-06 00:08:34,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:08:34,532 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408880536] [2022-12-06 00:08:34,532 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [408880536] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:08:34,532 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:08:34,532 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:08:34,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709634811] [2022-12-06 00:08:34,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:08:34,532 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:08:34,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:08:34,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:08:34,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:08:34,533 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:08:34,533 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:08:34,533 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:08:34,533 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:08:34,533 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:08:34,811 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:08:34,811 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:08:34,817 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13568 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:08:34,825 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:08:34,825 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:08:34,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:08:34,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:08:34,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:08:34,826 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:08:34,826 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:08:34,826 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:08:34,859 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:08:34,860 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:34,860 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:08:34,860 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:08:34,860 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:08:34,860 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:34,861 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:08:34,861 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:08:34,861 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:34,861 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:34,885 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:08:34,885 INFO L131 PetriNetUnfolder]: For 3318/3528 co-relation queries the response was YES. [2022-12-06 00:08:34,886 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3318/3528 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2984 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:08:34,888 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:34,888 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:08:35,028 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:08:35,029 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 169 [2022-12-06 00:08:35,029 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:08:35,029 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:08:35,029 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:08:35,029 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:08:35,029 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable730 [2022-12-06 00:08:35,029 INFO L420 AbstractCegarLoop]: === Iteration 732 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:08:35,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:08:35,029 INFO L85 PathProgramCache]: Analyzing trace with hash -1379521567, now seen corresponding path program 1 times [2022-12-06 00:08:35,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:08:35,029 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66250511] [2022-12-06 00:08:35,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:08:35,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:08:35,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:08:35,090 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-06 00:08:35,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:08:35,090 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66250511] [2022-12-06 00:08:35,090 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [66250511] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:08:35,090 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:08:35,090 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:08:35,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990571985] [2022-12-06 00:08:35,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:08:35,091 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:08:35,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:08:35,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:08:35,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:08:35,091 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:08:35,091 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:08:35,091 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:08:35,091 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:08:35,091 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:08:35,359 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:08:35,359 INFO L131 PetriNetUnfolder]: For 27146/27191 co-relation queries the response was YES. [2022-12-06 00:08:35,364 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27146/27191 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13537 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:08:35,371 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:08:35,371 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:08:35,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:08:35,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:08:35,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:08:35,371 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:08:35,371 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:08:35,371 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:08:35,403 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:08:35,404 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:35,404 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:08:35,404 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:08:35,404 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:08:35,404 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:35,405 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:08:35,405 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:08:35,405 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:35,406 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:35,429 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:08:35,429 INFO L131 PetriNetUnfolder]: For 3168/3309 co-relation queries the response was YES. [2022-12-06 00:08:35,430 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3168/3309 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2992 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:08:35,432 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:35,432 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:08:35,578 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:08:35,579 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 175 [2022-12-06 00:08:35,579 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:08:35,579 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:08:35,579 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:08:35,579 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:08:35,579 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable731 [2022-12-06 00:08:35,579 INFO L420 AbstractCegarLoop]: === Iteration 733 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:08:35,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:08:35,579 INFO L85 PathProgramCache]: Analyzing trace with hash 363288768, now seen corresponding path program 1 times [2022-12-06 00:08:35,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:08:35,580 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674062621] [2022-12-06 00:08:35,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:08:35,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:08:35,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:08:35,658 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-06 00:08:35,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:08:35,658 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674062621] [2022-12-06 00:08:35,658 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [674062621] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:08:35,658 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:08:35,658 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:08:35,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730279213] [2022-12-06 00:08:35,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:08:35,658 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:08:35,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:08:35,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:08:35,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:08:35,659 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:08:35,659 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:08:35,659 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:08:35,659 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:08:35,659 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:08:35,959 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:08:35,959 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:08:35,965 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13573 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:08:35,973 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:08:35,973 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:08:35,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:08:35,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:08:35,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:08:35,974 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:08:35,974 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:08:35,974 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:08:36,014 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:08:36,015 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:36,016 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:08:36,016 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:08:36,016 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:08:36,016 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:36,016 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:08:36,016 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:08:36,017 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:36,017 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:36,042 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:08:36,042 INFO L131 PetriNetUnfolder]: For 3338/3547 co-relation queries the response was YES. [2022-12-06 00:08:36,043 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3338/3547 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2989 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:08:36,045 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:36,045 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:08:36,203 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:08:36,203 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 187 [2022-12-06 00:08:36,204 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:08:36,204 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:08:36,204 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:08:36,204 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:08:36,204 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable732 [2022-12-06 00:08:36,204 INFO L420 AbstractCegarLoop]: === Iteration 734 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:08:36,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:08:36,204 INFO L85 PathProgramCache]: Analyzing trace with hash 2106099103, now seen corresponding path program 1 times [2022-12-06 00:08:36,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:08:36,204 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745340196] [2022-12-06 00:08:36,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:08:36,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:08:36,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:08:36,275 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-06 00:08:36,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:08:36,276 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745340196] [2022-12-06 00:08:36,276 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1745340196] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:08:36,276 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:08:36,276 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:08:36,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124269225] [2022-12-06 00:08:36,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:08:36,276 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:08:36,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:08:36,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:08:36,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:08:36,277 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:08:36,277 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:08:36,277 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:08:36,277 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:08:36,277 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:08:36,583 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:08:36,583 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:08:36,590 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13558 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:08:36,598 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:08:36,598 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:08:36,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:08:36,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:08:36,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:08:36,599 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:08:36,599 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:08:36,599 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:08:36,638 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:08:36,639 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:36,639 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:08:36,640 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:08:36,640 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:08:36,640 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:36,640 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:08:36,640 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:08:36,640 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:36,641 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:36,665 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:08:36,666 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 00:08:36,667 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3312/3520 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2998 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:08:36,669 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:36,669 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:08:36,814 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:08:36,814 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 174 [2022-12-06 00:08:36,814 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:08:36,814 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:08:36,815 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:08:36,815 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:08:36,815 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable733 [2022-12-06 00:08:36,815 INFO L420 AbstractCegarLoop]: === Iteration 735 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:08:36,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:08:36,815 INFO L85 PathProgramCache]: Analyzing trace with hash -446057858, now seen corresponding path program 1 times [2022-12-06 00:08:36,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:08:36,815 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191153448] [2022-12-06 00:08:36,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:08:36,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:08:36,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:08:36,880 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-06 00:08:36,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:08:36,881 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191153448] [2022-12-06 00:08:36,881 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [191153448] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:08:36,881 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:08:36,881 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:08:36,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613738318] [2022-12-06 00:08:36,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:08:36,881 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:08:36,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:08:36,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:08:36,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:08:36,881 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:08:36,881 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:08:36,882 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:08:36,882 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:08:36,882 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:08:37,180 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:08:37,181 INFO L131 PetriNetUnfolder]: For 27150/27195 co-relation queries the response was YES. [2022-12-06 00:08:37,185 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27150/27195 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13526 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:08:37,191 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:08:37,191 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:08:37,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:08:37,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:08:37,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:08:37,192 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:08:37,192 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:08:37,192 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:08:37,220 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:08:37,221 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:37,221 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:08:37,221 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:08:37,221 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:08:37,221 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:37,222 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:08:37,222 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:08:37,222 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:37,222 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:37,250 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:08:37,250 INFO L131 PetriNetUnfolder]: For 3167/3307 co-relation queries the response was YES. [2022-12-06 00:08:37,251 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3167/3307 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 3000 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:08:37,254 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:37,254 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:08:37,427 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:08:37,428 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 207 [2022-12-06 00:08:37,428 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:08:37,428 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:08:37,428 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:08:37,428 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:08:37,428 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable734 [2022-12-06 00:08:37,428 INFO L420 AbstractCegarLoop]: === Iteration 736 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:08:37,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:08:37,428 INFO L85 PathProgramCache]: Analyzing trace with hash 1296752477, now seen corresponding path program 1 times [2022-12-06 00:08:37,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:08:37,429 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107726532] [2022-12-06 00:08:37,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:08:37,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:08:37,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:08:37,509 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-06 00:08:37,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:08:37,510 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107726532] [2022-12-06 00:08:37,510 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2107726532] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:08:37,510 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:08:37,510 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:08:37,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118742955] [2022-12-06 00:08:37,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:08:37,510 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:08:37,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:08:37,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:08:37,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:08:37,511 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:08:37,511 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:08:37,511 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:08:37,511 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:08:37,511 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:08:37,835 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:08:37,835 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:08:37,840 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13565 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:08:37,848 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:08:37,848 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:08:37,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:08:37,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:08:37,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:08:37,848 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:08:37,848 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:08:37,848 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:08:37,882 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:08:37,883 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:37,883 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:08:37,883 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:08:37,883 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:08:37,883 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:37,884 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:08:37,884 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:08:37,884 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:37,884 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:37,909 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:08:37,909 INFO L131 PetriNetUnfolder]: For 3310/3519 co-relation queries the response was YES. [2022-12-06 00:08:37,910 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3310/3519 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2997 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:08:37,912 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:37,912 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:08:38,055 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:08:38,056 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 173 [2022-12-06 00:08:38,056 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:08:38,056 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:08:38,056 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:08:38,056 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:08:38,056 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable735 [2022-12-06 00:08:38,056 INFO L420 AbstractCegarLoop]: === Iteration 737 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:08:38,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:08:38,057 INFO L85 PathProgramCache]: Analyzing trace with hash -1255404484, now seen corresponding path program 1 times [2022-12-06 00:08:38,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:08:38,057 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765410586] [2022-12-06 00:08:38,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:08:38,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:08:38,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:08:38,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-06 00:08:38,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:08:38,133 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765410586] [2022-12-06 00:08:38,133 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [765410586] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:08:38,133 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:08:38,133 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:08:38,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050551036] [2022-12-06 00:08:38,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:08:38,133 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:08:38,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:08:38,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:08:38,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:08:38,134 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:08:38,134 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:08:38,134 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:08:38,134 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:08:38,134 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:08:38,417 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:08:38,417 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 00:08:38,422 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13556 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:08:38,429 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:08:38,429 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:08:38,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:08:38,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:08:38,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:08:38,430 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:08:38,430 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:08:38,430 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:08:38,464 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:08:38,465 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:38,465 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:08:38,465 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:08:38,465 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:08:38,465 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:38,466 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:08:38,466 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:08:38,466 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:38,466 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:38,490 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:08:38,490 INFO L131 PetriNetUnfolder]: For 3348/3558 co-relation queries the response was YES. [2022-12-06 00:08:38,491 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3348/3558 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2961 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:08:38,493 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:38,493 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:08:38,636 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:08:38,637 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 172 [2022-12-06 00:08:38,637 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:08:38,637 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:08:38,637 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:08:38,637 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:08:38,637 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable736 [2022-12-06 00:08:38,637 INFO L420 AbstractCegarLoop]: === Iteration 738 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:08:38,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:08:38,637 INFO L85 PathProgramCache]: Analyzing trace with hash 487405851, now seen corresponding path program 1 times [2022-12-06 00:08:38,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:08:38,638 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335714948] [2022-12-06 00:08:38,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:08:38,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:08:38,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:08:38,697 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:08:38,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:08:38,697 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335714948] [2022-12-06 00:08:38,697 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [335714948] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:08:38,697 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:08:38,697 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:08:38,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888517795] [2022-12-06 00:08:38,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:08:38,698 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:08:38,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:08:38,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:08:38,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:08:38,698 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:08:38,698 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:08:38,698 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:08:38,698 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:08:38,698 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:08:38,966 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:08:38,966 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 00:08:38,971 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26965/27010 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13507 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:08:38,978 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:08:38,978 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:08:38,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:08:38,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:08:38,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:08:38,979 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:08:38,979 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:08:38,979 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:08:39,012 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:08:39,014 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:39,014 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:08:39,014 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:08:39,014 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:08:39,014 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:39,014 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:08:39,014 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:08:39,014 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:39,015 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:39,039 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:08:39,039 INFO L131 PetriNetUnfolder]: For 3122/3262 co-relation queries the response was YES. [2022-12-06 00:08:39,040 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3122/3262 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2988 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:08:39,042 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:39,042 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:08:39,182 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:08:39,183 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 169 [2022-12-06 00:08:39,183 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:08:39,183 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:08:39,183 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:08:39,183 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:08:39,183 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable737 [2022-12-06 00:08:39,183 INFO L420 AbstractCegarLoop]: === Iteration 739 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:08:39,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:08:39,184 INFO L85 PathProgramCache]: Analyzing trace with hash -2064751110, now seen corresponding path program 1 times [2022-12-06 00:08:39,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:08:39,184 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177587288] [2022-12-06 00:08:39,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:08:39,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:08:39,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:08:39,273 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-06 00:08:39,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:08:39,274 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177587288] [2022-12-06 00:08:39,274 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [177587288] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:08:39,274 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:08:39,274 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:08:39,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021741392] [2022-12-06 00:08:39,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:08:39,274 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:08:39,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:08:39,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:08:39,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:08:39,275 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:08:39,275 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:08:39,275 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:08:39,275 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:08:39,275 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:08:39,650 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:08:39,650 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 00:08:39,656 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13559 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:08:39,664 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:08:39,664 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:08:39,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:08:39,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:08:39,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:08:39,665 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:08:39,665 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:08:39,665 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:08:39,700 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:08:39,701 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:39,701 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:08:39,701 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:08:39,702 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:08:39,702 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:39,702 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:08:39,702 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:08:39,702 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:39,703 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:39,728 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:08:39,728 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 00:08:39,729 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3321/3530 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2994 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:08:39,731 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:39,731 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:08:39,882 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:08:39,883 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 181 [2022-12-06 00:08:39,883 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:08:39,883 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:08:39,883 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:08:39,883 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:08:39,883 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable738 [2022-12-06 00:08:39,883 INFO L420 AbstractCegarLoop]: === Iteration 740 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:08:39,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:08:39,883 INFO L85 PathProgramCache]: Analyzing trace with hash -321940775, now seen corresponding path program 1 times [2022-12-06 00:08:39,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:08:39,883 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526665837] [2022-12-06 00:08:39,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:08:39,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:08:39,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:08:39,947 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-06 00:08:39,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:08:39,948 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526665837] [2022-12-06 00:08:39,948 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1526665837] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:08:39,948 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:08:39,948 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:08:39,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694648554] [2022-12-06 00:08:39,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:08:39,948 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:08:39,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:08:39,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:08:39,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:08:39,948 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:08:39,949 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:08:39,949 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:08:39,949 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:08:39,949 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:08:40,237 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:08:40,237 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 00:08:40,243 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26969/27014 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13515 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:08:40,279 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:08:40,279 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:08:40,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:08:40,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:08:40,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:08:40,280 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:08:40,280 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:08:40,280 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:08:40,309 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:08:40,311 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:40,311 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:08:40,311 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:08:40,311 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:08:40,311 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:40,311 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:08:40,311 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:08:40,311 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:40,312 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:40,336 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:08:40,336 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 00:08:40,337 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3133/3273 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2958 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:08:40,339 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:40,339 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:08:40,493 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:08:40,494 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 183 [2022-12-06 00:08:40,494 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:08:40,494 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:08:40,494 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:08:40,494 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:08:40,494 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable739 [2022-12-06 00:08:40,494 INFO L420 AbstractCegarLoop]: === Iteration 741 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:08:40,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:08:40,494 INFO L85 PathProgramCache]: Analyzing trace with hash 1420869560, now seen corresponding path program 1 times [2022-12-06 00:08:40,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:08:40,494 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967915199] [2022-12-06 00:08:40,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:08:40,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:08:40,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:08:40,562 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-06 00:08:40,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:08:40,562 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967915199] [2022-12-06 00:08:40,562 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1967915199] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:08:40,563 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:08:40,563 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:08:40,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339254925] [2022-12-06 00:08:40,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:08:40,563 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:08:40,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:08:40,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:08:40,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:08:40,563 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:08:40,563 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:08:40,563 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:08:40,563 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:08:40,563 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:08:40,829 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:08:40,829 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:08:40,834 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13557 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:08:40,842 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:08:40,842 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:08:40,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:08:40,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:08:40,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:08:40,845 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:08:40,845 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:08:40,845 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:08:40,879 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:08:40,880 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:40,880 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:08:40,880 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:08:40,880 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:08:40,881 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:40,881 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:08:40,881 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:08:40,881 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:40,882 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:40,906 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:08:40,906 INFO L131 PetriNetUnfolder]: For 3338/3547 co-relation queries the response was YES. [2022-12-06 00:08:40,907 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3338/3547 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2980 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:08:40,908 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:40,908 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:08:41,073 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:08:41,073 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 193 [2022-12-06 00:08:41,074 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:08:41,074 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:08:41,074 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:08:41,074 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:08:41,074 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable740 [2022-12-06 00:08:41,074 INFO L420 AbstractCegarLoop]: === Iteration 742 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:08:41,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:08:41,074 INFO L85 PathProgramCache]: Analyzing trace with hash -1131287401, now seen corresponding path program 1 times [2022-12-06 00:08:41,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:08:41,074 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931242132] [2022-12-06 00:08:41,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:08:41,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:08:41,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:08:41,150 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-06 00:08:41,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:08:41,151 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931242132] [2022-12-06 00:08:41,151 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1931242132] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:08:41,151 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:08:41,151 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:08:41,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726779049] [2022-12-06 00:08:41,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:08:41,151 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:08:41,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:08:41,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:08:41,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:08:41,151 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:08:41,152 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:08:41,152 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:08:41,152 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:08:41,152 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:08:41,433 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:08:41,433 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:08:41,439 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13583 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:08:41,447 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:08:41,447 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:08:41,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:08:41,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:08:41,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:08:41,447 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:08:41,447 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:08:41,448 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:08:41,481 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:08:41,482 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:41,483 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:08:41,483 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:08:41,483 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:08:41,483 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:41,483 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:08:41,483 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:08:41,483 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:41,484 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:41,508 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:08:41,508 INFO L131 PetriNetUnfolder]: For 3309/3518 co-relation queries the response was YES. [2022-12-06 00:08:41,509 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3309/3518 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2987 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:08:41,511 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:41,511 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:08:41,663 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:08:41,663 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 180 [2022-12-06 00:08:41,663 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:08:41,663 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:08:41,663 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:08:41,663 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:08:41,663 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable741 [2022-12-06 00:08:41,664 INFO L420 AbstractCegarLoop]: === Iteration 743 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:08:41,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:08:41,664 INFO L85 PathProgramCache]: Analyzing trace with hash 611522934, now seen corresponding path program 1 times [2022-12-06 00:08:41,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:08:41,664 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549535750] [2022-12-06 00:08:41,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:08:41,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:08:41,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:08:41,729 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-06 00:08:41,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:08:41,729 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549535750] [2022-12-06 00:08:41,730 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [549535750] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:08:41,730 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:08:41,730 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:08:41,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706610294] [2022-12-06 00:08:41,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:08:41,730 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:08:41,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:08:41,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:08:41,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:08:41,730 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:08:41,730 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:08:41,730 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:08:41,730 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:08:41,730 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:08:42,000 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:08:42,000 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:08:42,006 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13556 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:08:42,012 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:08:42,013 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:08:42,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:08:42,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:08:42,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:08:42,013 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:08:42,013 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:08:42,013 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:08:42,047 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:08:42,048 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:42,048 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:08:42,048 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:08:42,048 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:08:42,048 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:42,049 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:08:42,049 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:08:42,049 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:42,049 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:42,075 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:08:42,075 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 00:08:42,076 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3312/3520 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2979 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:08:42,078 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:42,079 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:08:42,230 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:08:42,231 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 183 [2022-12-06 00:08:42,231 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:08:42,231 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:08:42,231 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:08:42,231 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:08:42,231 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable742 [2022-12-06 00:08:42,231 INFO L420 AbstractCegarLoop]: === Iteration 744 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:08:42,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:08:42,231 INFO L85 PathProgramCache]: Analyzing trace with hash -1940634027, now seen corresponding path program 1 times [2022-12-06 00:08:42,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:08:42,231 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590531324] [2022-12-06 00:08:42,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:08:42,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:08:42,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:08:42,300 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-06 00:08:42,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:08:42,300 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590531324] [2022-12-06 00:08:42,300 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1590531324] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:08:42,300 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:08:42,300 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:08:42,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059355305] [2022-12-06 00:08:42,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:08:42,301 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:08:42,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:08:42,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:08:42,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:08:42,301 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:08:42,301 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:08:42,301 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:08:42,301 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:08:42,301 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:08:42,567 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:08:42,567 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:08:42,573 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13573 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:08:42,580 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:08:42,580 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:08:42,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:08:42,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:08:42,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:08:42,581 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:08:42,581 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:08:42,581 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:08:42,616 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:08:42,618 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:42,618 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:08:42,618 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:08:42,618 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:08:42,618 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:42,618 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:08:42,618 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:08:42,619 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:42,619 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:42,644 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:08:42,644 INFO L131 PetriNetUnfolder]: For 3307/3517 co-relation queries the response was YES. [2022-12-06 00:08:42,645 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3307/3517 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2991 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:08:42,647 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:42,647 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:08:42,807 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:08:42,808 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 190 [2022-12-06 00:08:42,808 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:08:42,808 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:08:42,808 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:08:42,808 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:08:42,808 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable743 [2022-12-06 00:08:42,808 INFO L420 AbstractCegarLoop]: === Iteration 745 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:08:42,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:08:42,808 INFO L85 PathProgramCache]: Analyzing trace with hash -197823692, now seen corresponding path program 1 times [2022-12-06 00:08:42,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:08:42,809 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774991681] [2022-12-06 00:08:42,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:08:42,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:08:42,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:08:42,889 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-06 00:08:42,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:08:42,890 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774991681] [2022-12-06 00:08:42,890 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1774991681] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:08:42,890 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:08:42,890 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:08:42,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242399040] [2022-12-06 00:08:42,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:08:42,890 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:08:42,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:08:42,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:08:42,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:08:42,890 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:08:42,890 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:08:42,891 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:08:42,891 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:08:42,891 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:08:43,163 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:08:43,163 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 00:08:43,169 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13576 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:08:43,176 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:08:43,176 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:08:43,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:08:43,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:08:43,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:08:43,177 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:08:43,177 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:08:43,177 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:08:43,237 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:08:43,238 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:43,239 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:08:43,239 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:08:43,239 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:08:43,239 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:43,239 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:08:43,239 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:08:43,239 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:43,240 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:43,265 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:08:43,265 INFO L131 PetriNetUnfolder]: For 3338/3547 co-relation queries the response was YES. [2022-12-06 00:08:43,266 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3338/3547 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2983 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:08:43,268 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:43,268 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:08:43,423 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:08:43,423 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 184 [2022-12-06 00:08:43,423 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:08:43,423 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:08:43,424 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:08:43,424 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:08:43,424 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable744 [2022-12-06 00:08:43,424 INFO L420 AbstractCegarLoop]: === Iteration 746 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:08:43,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:08:43,424 INFO L85 PathProgramCache]: Analyzing trace with hash 1544986643, now seen corresponding path program 1 times [2022-12-06 00:08:43,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:08:43,424 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770604077] [2022-12-06 00:08:43,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:08:43,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:08:43,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:08:43,510 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-06 00:08:43,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:08:43,511 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770604077] [2022-12-06 00:08:43,511 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [770604077] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:08:43,511 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:08:43,511 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:08:43,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823318705] [2022-12-06 00:08:43,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:08:43,511 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:08:43,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:08:43,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:08:43,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:08:43,512 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:08:43,512 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:08:43,512 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:08:43,512 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:08:43,512 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:08:43,789 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:08:43,789 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:08:43,795 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13543 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:08:43,803 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:08:43,803 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:08:43,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:08:43,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:08:43,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:08:43,804 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:08:43,804 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:08:43,804 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:08:43,839 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:08:43,840 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:43,841 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:08:43,841 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:08:43,841 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:08:43,841 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:43,841 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:08:43,841 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:08:43,841 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:43,842 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:43,866 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:08:43,866 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 00:08:43,867 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3312/3520 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2983 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:08:43,869 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:43,869 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:08:44,010 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:08:44,010 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 169 [2022-12-06 00:08:44,010 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:08:44,010 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:08:44,010 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:08:44,010 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:08:44,010 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable745 [2022-12-06 00:08:44,010 INFO L420 AbstractCegarLoop]: === Iteration 747 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:08:44,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:08:44,011 INFO L85 PathProgramCache]: Analyzing trace with hash -1007170318, now seen corresponding path program 1 times [2022-12-06 00:08:44,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:08:44,011 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639091304] [2022-12-06 00:08:44,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:08:44,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:08:44,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:08:44,075 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-06 00:08:44,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:08:44,076 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639091304] [2022-12-06 00:08:44,076 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [639091304] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:08:44,076 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:08:44,076 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:08:44,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970811863] [2022-12-06 00:08:44,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:08:44,076 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:08:44,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:08:44,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:08:44,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:08:44,076 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:08:44,076 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:08:44,076 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:08:44,076 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:08:44,077 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:08:44,346 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:08:44,346 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:08:44,351 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13558 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:08:44,359 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:08:44,359 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:08:44,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:08:44,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:08:44,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:08:44,359 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:08:44,359 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:08:44,360 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:08:44,392 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:08:44,393 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:44,394 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:08:44,394 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:08:44,394 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:08:44,394 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:44,394 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:08:44,394 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:08:44,394 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:44,395 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:44,418 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:08:44,419 INFO L131 PetriNetUnfolder]: For 3310/3519 co-relation queries the response was YES. [2022-12-06 00:08:44,419 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3310/3519 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2988 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:08:44,421 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:44,421 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:08:44,568 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:08:44,568 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 174 [2022-12-06 00:08:44,568 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:08:44,568 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:08:44,568 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:08:44,568 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:08:44,568 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable746 [2022-12-06 00:08:44,568 INFO L420 AbstractCegarLoop]: === Iteration 748 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:08:44,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:08:44,569 INFO L85 PathProgramCache]: Analyzing trace with hash 735640017, now seen corresponding path program 1 times [2022-12-06 00:08:44,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:08:44,569 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849215625] [2022-12-06 00:08:44,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:08:44,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:08:44,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:08:44,627 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-06 00:08:44,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:08:44,627 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849215625] [2022-12-06 00:08:44,627 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [849215625] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:08:44,627 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:08:44,627 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:08:44,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463490581] [2022-12-06 00:08:44,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:08:44,627 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:08:44,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:08:44,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:08:44,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:08:44,628 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:08:44,628 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:08:44,628 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:08:44,628 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:08:44,628 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:08:44,911 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:08:44,911 INFO L131 PetriNetUnfolder]: For 27136/27181 co-relation queries the response was YES. [2022-12-06 00:08:44,916 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27136/27181 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13536 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:08:44,923 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:08:44,923 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:08:44,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:08:44,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:08:44,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:08:44,924 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:08:44,924 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:08:44,924 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:08:44,956 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:08:44,957 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:44,957 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:08:44,957 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:08:44,957 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:08:44,958 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:44,958 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:08:44,958 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:08:44,958 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:44,959 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:44,983 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:08:44,984 INFO L131 PetriNetUnfolder]: For 3167/3307 co-relation queries the response was YES. [2022-12-06 00:08:44,984 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3167/3307 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2981 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:08:44,986 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:44,986 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:08:45,161 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:08:45,161 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 204 [2022-12-06 00:08:45,161 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:08:45,162 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:08:45,162 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:08:45,162 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:08:45,162 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable747 [2022-12-06 00:08:45,162 INFO L420 AbstractCegarLoop]: === Iteration 749 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:08:45,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:08:45,162 INFO L85 PathProgramCache]: Analyzing trace with hash -1816516944, now seen corresponding path program 1 times [2022-12-06 00:08:45,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:08:45,162 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592264492] [2022-12-06 00:08:45,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:08:45,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:08:45,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:08:45,229 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-06 00:08:45,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:08:45,229 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592264492] [2022-12-06 00:08:45,229 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [592264492] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:08:45,229 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:08:45,229 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:08:45,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789341946] [2022-12-06 00:08:45,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:08:45,229 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:08:45,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:08:45,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:08:45,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:08:45,230 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:08:45,230 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:08:45,230 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:08:45,230 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:08:45,230 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:08:45,506 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:08:45,506 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:08:45,511 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13554 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:08:45,519 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:08:45,519 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:08:45,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:08:45,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:08:45,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:08:45,519 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:08:45,519 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:08:45,519 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:08:45,552 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:08:45,553 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:45,554 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:08:45,554 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:08:45,554 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:08:45,554 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:45,554 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:08:45,554 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:08:45,554 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:45,555 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:45,579 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:08:45,579 INFO L131 PetriNetUnfolder]: For 3338/3547 co-relation queries the response was YES. [2022-12-06 00:08:45,580 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3338/3547 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2981 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:08:45,582 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:45,582 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:08:45,731 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:08:45,732 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 178 [2022-12-06 00:08:45,732 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:08:45,732 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:08:45,732 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:08:45,732 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:08:45,732 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable748 [2022-12-06 00:08:45,732 INFO L420 AbstractCegarLoop]: === Iteration 750 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:08:45,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:08:45,732 INFO L85 PathProgramCache]: Analyzing trace with hash -73706609, now seen corresponding path program 1 times [2022-12-06 00:08:45,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:08:45,732 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67029255] [2022-12-06 00:08:45,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:08:45,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:08:45,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:08:45,791 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-06 00:08:45,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:08:45,792 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67029255] [2022-12-06 00:08:45,792 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [67029255] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:08:45,792 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:08:45,792 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:08:45,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111713911] [2022-12-06 00:08:45,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:08:45,792 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:08:45,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:08:45,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:08:45,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:08:45,792 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:08:45,793 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:08:45,793 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:08:45,793 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:08:45,793 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:08:46,059 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:08:46,059 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:08:46,064 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13524 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:08:46,070 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:08:46,071 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:08:46,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:08:46,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:08:46,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:08:46,071 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:08:46,071 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:08:46,071 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:08:46,103 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:08:46,104 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:46,104 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:08:46,104 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:08:46,104 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:08:46,104 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:46,104 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:08:46,105 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:08:46,105 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:46,105 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:46,137 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:08:46,137 INFO L131 PetriNetUnfolder]: For 3304/3511 co-relation queries the response was YES. [2022-12-06 00:08:46,138 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3304/3511 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2985 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:08:46,140 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:46,140 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:08:46,305 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:08:46,306 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 202 [2022-12-06 00:08:46,306 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:08:46,306 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:08:46,306 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:08:46,306 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:08:46,306 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable749 [2022-12-06 00:08:46,306 INFO L420 AbstractCegarLoop]: === Iteration 751 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:08:46,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:08:46,306 INFO L85 PathProgramCache]: Analyzing trace with hash 1669103726, now seen corresponding path program 1 times [2022-12-06 00:08:46,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:08:46,306 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781398862] [2022-12-06 00:08:46,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:08:46,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:08:46,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:08:46,365 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-06 00:08:46,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:08:46,365 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781398862] [2022-12-06 00:08:46,365 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1781398862] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:08:46,365 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:08:46,365 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:08:46,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148433614] [2022-12-06 00:08:46,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:08:46,365 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:08:46,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:08:46,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:08:46,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:08:46,366 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:08:46,366 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:08:46,366 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:08:46,366 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:08:46,366 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:08:46,629 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:08:46,629 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:08:46,635 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13571 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:08:46,643 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:08:46,643 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:08:46,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:08:46,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:08:46,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:08:46,645 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:08:46,645 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:08:46,645 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:08:46,688 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:08:46,689 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:46,689 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:08:46,689 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:08:46,689 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:08:46,689 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:46,690 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:08:46,690 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:08:46,690 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:46,690 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:46,718 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:08:46,718 INFO L131 PetriNetUnfolder]: For 3301/3509 co-relation queries the response was YES. [2022-12-06 00:08:46,719 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3301/3509 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2998 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:08:46,721 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:46,721 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:08:46,861 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:08:46,861 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 172 [2022-12-06 00:08:46,861 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:08:46,861 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:08:46,861 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:08:46,862 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:08:46,862 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable750 [2022-12-06 00:08:46,862 INFO L420 AbstractCegarLoop]: === Iteration 752 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:08:46,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:08:46,862 INFO L85 PathProgramCache]: Analyzing trace with hash -883053235, now seen corresponding path program 1 times [2022-12-06 00:08:46,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:08:46,862 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544441494] [2022-12-06 00:08:46,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:08:46,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:08:46,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:08:46,921 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-06 00:08:46,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:08:46,921 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544441494] [2022-12-06 00:08:46,921 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [544441494] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:08:46,921 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:08:46,921 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:08:46,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991647583] [2022-12-06 00:08:46,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:08:46,922 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:08:46,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:08:46,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:08:46,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:08:46,922 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:08:46,922 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:08:46,922 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:08:46,922 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:08:46,922 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:08:47,191 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:08:47,191 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 00:08:47,197 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13566 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:08:47,204 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:08:47,204 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:08:47,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:08:47,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:08:47,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:08:47,205 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:08:47,205 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:08:47,205 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:08:47,239 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:08:47,241 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:47,241 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:08:47,241 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:08:47,241 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:08:47,241 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:47,241 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:08:47,241 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:08:47,241 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:47,242 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:47,266 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:08:47,266 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 00:08:47,267 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3312/3520 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2988 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:08:47,269 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:47,269 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:08:47,413 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:08:47,414 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 173 [2022-12-06 00:08:47,414 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:08:47,414 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:08:47,414 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:08:47,414 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:08:47,414 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable751 [2022-12-06 00:08:47,414 INFO L420 AbstractCegarLoop]: === Iteration 753 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:08:47,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:08:47,414 INFO L85 PathProgramCache]: Analyzing trace with hash 859757100, now seen corresponding path program 1 times [2022-12-06 00:08:47,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:08:47,415 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328449795] [2022-12-06 00:08:47,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:08:47,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:08:47,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:08:47,482 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-06 00:08:47,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:08:47,482 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328449795] [2022-12-06 00:08:47,482 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1328449795] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:08:47,482 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:08:47,482 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:08:47,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394266706] [2022-12-06 00:08:47,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:08:47,483 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:08:47,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:08:47,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:08:47,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:08:47,483 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:08:47,483 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:08:47,483 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:08:47,483 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:08:47,483 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:08:47,776 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:08:47,776 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:08:47,781 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13535 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:08:47,788 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:08:47,788 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:08:47,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:08:47,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:08:47,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:08:47,789 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:08:47,789 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:08:47,789 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:08:47,820 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:08:47,821 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:47,821 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:08:47,821 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:08:47,821 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:08:47,821 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:47,822 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:08:47,822 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:08:47,822 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:47,822 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:47,847 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:08:47,847 INFO L131 PetriNetUnfolder]: For 3327/3536 co-relation queries the response was YES. [2022-12-06 00:08:47,848 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3327/3536 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2984 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:08:47,850 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:47,850 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:08:48,012 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:08:48,012 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 191 [2022-12-06 00:08:48,012 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:08:48,012 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:08:48,012 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:08:48,012 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:08:48,012 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable752 [2022-12-06 00:08:48,012 INFO L420 AbstractCegarLoop]: === Iteration 754 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:08:48,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:08:48,013 INFO L85 PathProgramCache]: Analyzing trace with hash -1692399861, now seen corresponding path program 1 times [2022-12-06 00:08:48,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:08:48,013 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403205965] [2022-12-06 00:08:48,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:08:48,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:08:48,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:08:48,066 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-06 00:08:48,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:08:48,067 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403205965] [2022-12-06 00:08:48,067 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [403205965] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:08:48,067 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:08:48,067 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:08:48,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354434910] [2022-12-06 00:08:48,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:08:48,067 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:08:48,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:08:48,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:08:48,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:08:48,067 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:08:48,067 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:08:48,067 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:08:48,068 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:08:48,068 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:08:48,328 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:08:48,328 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 00:08:48,333 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13556 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:08:48,340 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:08:48,340 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:08:48,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:08:48,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:08:48,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:08:48,341 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:08:48,341 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:08:48,341 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:08:48,373 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:08:48,374 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:48,374 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:08:48,375 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:08:48,375 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:08:48,375 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:48,375 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:08:48,375 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:08:48,375 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:48,376 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:48,399 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:08:48,399 INFO L131 PetriNetUnfolder]: For 3304/3511 co-relation queries the response was YES. [2022-12-06 00:08:48,400 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3304/3511 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2988 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:08:48,402 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:48,402 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:08:48,541 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:08:48,542 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 167 [2022-12-06 00:08:48,542 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:08:48,542 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:08:48,542 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:08:48,542 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:08:48,542 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable753 [2022-12-06 00:08:48,542 INFO L420 AbstractCegarLoop]: === Iteration 755 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:08:48,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:08:48,542 INFO L85 PathProgramCache]: Analyzing trace with hash 50410474, now seen corresponding path program 1 times [2022-12-06 00:08:48,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:08:48,542 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761121411] [2022-12-06 00:08:48,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:08:48,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:08:48,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:08:48,607 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-06 00:08:48,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:08:48,608 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761121411] [2022-12-06 00:08:48,608 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1761121411] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:08:48,608 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:08:48,608 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:08:48,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986682072] [2022-12-06 00:08:48,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:08:48,608 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:08:48,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:08:48,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:08:48,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:08:48,608 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:08:48,608 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:08:48,609 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:08:48,609 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:08:48,609 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:08:48,890 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:08:48,891 INFO L131 PetriNetUnfolder]: For 27229/27274 co-relation queries the response was YES. [2022-12-06 00:08:48,896 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27229/27274 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13575 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:08:48,904 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:08:48,904 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:08:48,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:08:48,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:08:48,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:08:48,905 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:08:48,905 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:08:48,905 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:08:48,939 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:08:48,940 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:48,940 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:08:48,940 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:08:48,940 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:08:48,940 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:48,941 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:08:48,941 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:08:48,941 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:48,941 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:48,966 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:08:48,966 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 00:08:48,967 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3312/3520 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2969 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:08:48,969 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:48,969 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:08:49,120 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:08:49,121 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 181 [2022-12-06 00:08:49,121 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:08:49,121 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:08:49,121 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:08:49,121 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:08:49,121 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable754 [2022-12-06 00:08:49,121 INFO L420 AbstractCegarLoop]: === Iteration 756 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:08:49,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:08:49,121 INFO L85 PathProgramCache]: Analyzing trace with hash 1793220809, now seen corresponding path program 1 times [2022-12-06 00:08:49,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:08:49,121 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601847072] [2022-12-06 00:08:49,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:08:49,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:08:49,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:08:49,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-06 00:08:49,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:08:49,195 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601847072] [2022-12-06 00:08:49,195 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [601847072] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:08:49,195 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:08:49,195 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:08:49,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064302178] [2022-12-06 00:08:49,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:08:49,196 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:08:49,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:08:49,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:08:49,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:08:49,196 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:08:49,196 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:08:49,196 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:08:49,196 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:08:49,196 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:08:49,486 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:08:49,486 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 00:08:49,492 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26965/27010 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13512 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:08:49,499 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:08:49,499 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:08:49,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:08:49,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:08:49,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:08:49,500 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:08:49,500 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:08:49,500 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:08:49,535 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:08:49,537 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:49,537 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:08:49,537 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:08:49,537 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:08:49,537 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:49,537 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:08:49,537 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:08:49,538 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:49,538 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:49,562 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:08:49,563 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 00:08:49,564 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3133/3273 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2969 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:08:49,566 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:49,566 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:08:49,724 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:08:49,725 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 188 [2022-12-06 00:08:49,725 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:08:49,725 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:08:49,725 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:08:49,725 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:08:49,725 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable755 [2022-12-06 00:08:49,725 INFO L420 AbstractCegarLoop]: === Iteration 757 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:08:49,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:08:49,726 INFO L85 PathProgramCache]: Analyzing trace with hash -758936152, now seen corresponding path program 1 times [2022-12-06 00:08:49,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:08:49,726 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128294450] [2022-12-06 00:08:49,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:08:49,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:08:49,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:08:49,790 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-06 00:08:49,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:08:49,791 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128294450] [2022-12-06 00:08:49,791 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [128294450] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:08:49,791 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:08:49,791 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:08:49,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025749620] [2022-12-06 00:08:49,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:08:49,791 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:08:49,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:08:49,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:08:49,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:08:49,792 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:08:49,792 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:08:49,792 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:08:49,792 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:08:49,792 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:08:50,084 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:08:50,084 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 00:08:50,090 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26969/27014 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13523 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:08:50,098 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:08:50,098 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:08:50,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:08:50,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:08:50,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:08:50,099 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:08:50,099 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:08:50,099 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:08:50,133 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:08:50,135 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:50,135 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:08:50,135 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:08:50,135 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:08:50,135 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:50,135 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:08:50,135 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:08:50,135 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:50,136 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:50,160 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:08:50,160 INFO L131 PetriNetUnfolder]: For 3146/3287 co-relation queries the response was YES. [2022-12-06 00:08:50,161 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3146/3287 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2977 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:08:50,163 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:50,163 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:08:50,313 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:08:50,313 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 178 [2022-12-06 00:08:50,313 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:08:50,313 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:08:50,313 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:08:50,313 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:08:50,314 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable756 [2022-12-06 00:08:50,314 INFO L420 AbstractCegarLoop]: === Iteration 758 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:08:50,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:08:50,314 INFO L85 PathProgramCache]: Analyzing trace with hash 983874183, now seen corresponding path program 1 times [2022-12-06 00:08:50,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:08:50,314 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285428231] [2022-12-06 00:08:50,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:08:50,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:08:50,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:08:50,370 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-06 00:08:50,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:08:50,371 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285428231] [2022-12-06 00:08:50,371 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [285428231] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:08:50,371 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:08:50,371 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:08:50,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134839918] [2022-12-06 00:08:50,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:08:50,371 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:08:50,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:08:50,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:08:50,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:08:50,371 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:08:50,372 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:08:50,372 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:08:50,372 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:08:50,372 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:08:50,670 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:08:50,670 INFO L131 PetriNetUnfolder]: For 27146/27191 co-relation queries the response was YES. [2022-12-06 00:08:50,675 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27146/27191 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13508 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:08:50,682 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:08:50,682 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:08:50,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:08:50,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:08:50,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:08:50,682 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:08:50,683 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:08:50,683 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:08:50,712 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:08:50,713 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:50,713 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:08:50,713 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:08:50,713 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:08:50,713 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:50,714 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:08:50,714 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:08:50,714 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:50,714 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:50,739 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:08:50,739 INFO L131 PetriNetUnfolder]: For 3167/3307 co-relation queries the response was YES. [2022-12-06 00:08:50,740 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3167/3307 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2985 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:08:50,742 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:50,742 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:08:50,901 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:08:50,901 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 188 [2022-12-06 00:08:50,901 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:08:50,901 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:08:50,901 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:08:50,901 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:08:50,901 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable757 [2022-12-06 00:08:50,901 INFO L420 AbstractCegarLoop]: === Iteration 759 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:08:50,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:08:50,902 INFO L85 PathProgramCache]: Analyzing trace with hash -1568282778, now seen corresponding path program 1 times [2022-12-06 00:08:50,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:08:50,902 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138104583] [2022-12-06 00:08:50,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:08:50,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:08:50,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:08:50,986 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-06 00:08:50,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:08:50,986 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138104583] [2022-12-06 00:08:50,986 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [138104583] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:08:50,986 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:08:50,987 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:08:50,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609505433] [2022-12-06 00:08:50,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:08:50,987 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:08:50,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:08:50,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:08:50,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:08:50,987 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:08:50,987 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:08:50,988 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:08:50,988 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:08:50,988 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:08:51,303 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:08:51,303 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:08:51,308 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13569 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:08:51,316 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:08:51,316 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:08:51,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:08:51,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:08:51,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:08:51,317 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:08:51,317 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:08:51,317 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:08:51,354 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:08:51,356 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:51,356 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:08:51,356 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:08:51,356 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:08:51,356 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:51,357 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:08:51,357 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:08:51,357 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:51,357 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:51,383 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:08:51,384 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 00:08:51,385 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3321/3530 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2970 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:08:51,387 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:51,387 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:08:51,536 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:08:51,537 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 181 [2022-12-06 00:08:51,537 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:08:51,537 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:08:51,537 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:08:51,537 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:08:51,537 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable758 [2022-12-06 00:08:51,537 INFO L420 AbstractCegarLoop]: === Iteration 760 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:08:51,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:08:51,537 INFO L85 PathProgramCache]: Analyzing trace with hash 174527557, now seen corresponding path program 1 times [2022-12-06 00:08:51,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:08:51,537 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132905600] [2022-12-06 00:08:51,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:08:51,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:08:51,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:08:51,598 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-06 00:08:51,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:08:51,598 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132905600] [2022-12-06 00:08:51,598 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1132905600] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:08:51,598 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:08:51,598 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:08:51,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077748127] [2022-12-06 00:08:51,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:08:51,599 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:08:51,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:08:51,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:08:51,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:08:51,599 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:08:51,599 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:08:51,599 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:08:51,599 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:08:51,599 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:08:51,870 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:08:51,870 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:08:51,876 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13566 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:08:51,883 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:08:51,883 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:08:51,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:08:51,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:08:51,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:08:51,884 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:08:51,884 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:08:51,884 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:08:51,916 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:08:51,917 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:51,918 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:08:51,918 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:08:51,918 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:08:51,918 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:51,918 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:08:51,918 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:08:51,918 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:51,919 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:51,943 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:08:51,944 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 00:08:51,944 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3321/3530 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2987 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:08:51,946 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:51,946 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:08:52,102 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:08:52,103 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 185 [2022-12-06 00:08:52,103 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:08:52,103 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:08:52,103 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:08:52,103 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:08:52,103 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable759 [2022-12-06 00:08:52,103 INFO L420 AbstractCegarLoop]: === Iteration 761 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:08:52,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:08:52,103 INFO L85 PathProgramCache]: Analyzing trace with hash 1917337892, now seen corresponding path program 1 times [2022-12-06 00:08:52,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:08:52,104 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681313320] [2022-12-06 00:08:52,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:08:52,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:08:52,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:08:52,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-06 00:08:52,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:08:52,189 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681313320] [2022-12-06 00:08:52,189 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [681313320] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:08:52,189 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:08:52,189 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:08:52,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626856413] [2022-12-06 00:08:52,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:08:52,190 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:08:52,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:08:52,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:08:52,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:08:52,190 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:08:52,190 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:08:52,190 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:08:52,190 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:08:52,190 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:08:52,514 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:08:52,514 INFO L131 PetriNetUnfolder]: For 27229/27274 co-relation queries the response was YES. [2022-12-06 00:08:52,523 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27229/27274 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13558 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:08:52,533 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:08:52,533 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:08:52,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:08:52,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:08:52,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:08:52,534 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:08:52,534 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:08:52,534 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:08:52,574 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:08:52,575 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:52,575 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:08:52,575 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:08:52,575 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:08:52,575 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:52,576 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:08:52,576 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:08:52,576 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:52,576 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:52,601 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:08:52,601 INFO L131 PetriNetUnfolder]: For 3327/3536 co-relation queries the response was YES. [2022-12-06 00:08:52,602 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3327/3536 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2975 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:08:52,604 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:52,604 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:08:52,746 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:08:52,747 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 172 [2022-12-06 00:08:52,747 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:08:52,747 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:08:52,747 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:08:52,747 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:08:52,747 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable760 [2022-12-06 00:08:52,747 INFO L420 AbstractCegarLoop]: === Iteration 762 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:08:52,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:08:52,748 INFO L85 PathProgramCache]: Analyzing trace with hash -634819069, now seen corresponding path program 1 times [2022-12-06 00:08:52,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:08:52,748 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72435040] [2022-12-06 00:08:52,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:08:52,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:08:52,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:08:52,818 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-06 00:08:52,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:08:52,818 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72435040] [2022-12-06 00:08:52,818 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [72435040] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:08:52,818 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:08:52,818 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:08:52,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017399890] [2022-12-06 00:08:52,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:08:52,818 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:08:52,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:08:52,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:08:52,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:08:52,819 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:08:52,819 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:08:52,819 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:08:52,819 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:08:52,819 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:08:53,126 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:08:53,126 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 00:08:53,132 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13558 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:08:53,141 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:08:53,141 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:08:53,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:08:53,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:08:53,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:08:53,141 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:08:53,142 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:08:53,142 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:08:53,177 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:08:53,178 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:53,178 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:08:53,178 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:08:53,178 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:08:53,179 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:53,179 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:08:53,179 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:08:53,179 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:53,180 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:53,211 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:08:53,211 INFO L131 PetriNetUnfolder]: For 3301/3509 co-relation queries the response was YES. [2022-12-06 00:08:53,212 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3301/3509 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2981 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:08:53,214 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:53,214 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:08:53,378 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:08:53,379 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 201 [2022-12-06 00:08:53,379 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:08:53,379 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:08:53,379 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:08:53,379 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:08:53,379 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable761 [2022-12-06 00:08:53,379 INFO L420 AbstractCegarLoop]: === Iteration 763 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:08:53,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:08:53,379 INFO L85 PathProgramCache]: Analyzing trace with hash 1107991266, now seen corresponding path program 1 times [2022-12-06 00:08:53,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:08:53,379 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525434000] [2022-12-06 00:08:53,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:08:53,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:08:53,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:08:53,448 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:08:53,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:08:53,449 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525434000] [2022-12-06 00:08:53,449 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1525434000] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:08:53,449 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:08:53,449 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:08:53,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884184660] [2022-12-06 00:08:53,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:08:53,449 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:08:53,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:08:53,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:08:53,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:08:53,449 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:08:53,449 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:08:53,449 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:08:53,450 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:08:53,450 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:08:53,773 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:08:53,773 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:08:53,778 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13566 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:08:53,784 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:08:53,784 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:08:53,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:08:53,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:08:53,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:08:53,784 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:08:53,785 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:08:53,785 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:08:53,817 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:08:53,818 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:53,818 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:08:53,818 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:08:53,818 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:08:53,818 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:53,819 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:08:53,819 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:08:53,819 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:53,819 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:53,847 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:08:53,847 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 00:08:53,848 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3312/3520 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2982 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:08:53,850 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:53,850 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:08:53,991 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:08:53,992 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 174 [2022-12-06 00:08:53,992 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:08:53,992 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:08:53,992 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:08:53,992 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:08:53,992 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable762 [2022-12-06 00:08:53,992 INFO L420 AbstractCegarLoop]: === Iteration 764 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:08:53,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:08:53,992 INFO L85 PathProgramCache]: Analyzing trace with hash -1444165695, now seen corresponding path program 1 times [2022-12-06 00:08:53,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:08:53,992 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411341571] [2022-12-06 00:08:53,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:08:53,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:08:54,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:08:54,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-06 00:08:54,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:08:54,076 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411341571] [2022-12-06 00:08:54,076 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1411341571] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:08:54,076 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:08:54,076 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:08:54,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48102410] [2022-12-06 00:08:54,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:08:54,077 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:08:54,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:08:54,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:08:54,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:08:54,077 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:08:54,077 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:08:54,077 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:08:54,077 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:08:54,077 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:08:54,348 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:08:54,349 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 00:08:54,354 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26969/27014 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13528 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:08:54,361 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:08:54,361 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:08:54,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:08:54,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:08:54,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:08:54,362 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:08:54,362 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:08:54,362 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:08:54,395 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:08:54,396 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:54,396 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:08:54,396 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:08:54,396 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:08:54,397 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:54,397 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:08:54,397 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:08:54,397 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:54,398 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:54,422 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:08:54,422 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 00:08:54,423 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3133/3273 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2994 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:08:54,425 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:54,425 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:08:54,570 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:08:54,570 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 174 [2022-12-06 00:08:54,570 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:08:54,570 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:08:54,570 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:08:54,570 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:08:54,571 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable763 [2022-12-06 00:08:54,571 INFO L420 AbstractCegarLoop]: === Iteration 765 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:08:54,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:08:54,571 INFO L85 PathProgramCache]: Analyzing trace with hash 298644640, now seen corresponding path program 1 times [2022-12-06 00:08:54,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:08:54,571 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828113951] [2022-12-06 00:08:54,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:08:54,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:08:54,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:08:54,638 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:08:54,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:08:54,639 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828113951] [2022-12-06 00:08:54,639 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1828113951] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:08:54,639 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:08:54,639 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:08:54,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321102135] [2022-12-06 00:08:54,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:08:54,639 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:08:54,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:08:54,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:08:54,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:08:54,639 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:08:54,639 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:08:54,639 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:08:54,639 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:08:54,640 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:08:54,915 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:08:54,915 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:08:54,921 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13563 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:08:54,928 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:08:54,929 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:08:54,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:08:54,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:08:54,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:08:54,929 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:08:54,929 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:08:54,929 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:08:54,963 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:08:54,964 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:54,964 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:08:54,965 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:08:54,965 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:08:54,965 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:54,965 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:08:54,965 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:08:54,965 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:54,966 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:54,989 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:08:54,989 INFO L131 PetriNetUnfolder]: For 3349/3561 co-relation queries the response was YES. [2022-12-06 00:08:54,990 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3349/3561 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2965 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:08:54,992 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:54,992 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:08:55,139 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:08:55,140 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 175 [2022-12-06 00:08:55,140 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:08:55,140 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:08:55,140 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:08:55,140 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:08:55,140 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable764 [2022-12-06 00:08:55,140 INFO L420 AbstractCegarLoop]: === Iteration 766 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:08:55,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:08:55,140 INFO L85 PathProgramCache]: Analyzing trace with hash 2041454975, now seen corresponding path program 1 times [2022-12-06 00:08:55,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:08:55,140 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666480144] [2022-12-06 00:08:55,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:08:55,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:08:55,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:08:55,203 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-06 00:08:55,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:08:55,204 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666480144] [2022-12-06 00:08:55,204 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1666480144] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:08:55,204 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:08:55,204 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:08:55,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464437025] [2022-12-06 00:08:55,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:08:55,204 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:08:55,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:08:55,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:08:55,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:08:55,204 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:08:55,205 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:08:55,205 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:08:55,205 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:08:55,205 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:08:55,474 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:08:55,474 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 00:08:55,479 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26969/27014 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13505 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:08:55,486 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:08:55,486 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:08:55,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:08:55,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:08:55,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:08:55,487 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:08:55,487 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:08:55,487 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:08:55,521 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:08:55,522 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:55,522 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:08:55,522 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:08:55,522 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:08:55,522 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:55,523 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:08:55,523 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:08:55,523 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:55,523 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:55,547 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:08:55,547 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 00:08:55,548 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3133/3273 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2967 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:08:55,550 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:55,550 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:08:55,693 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:08:55,694 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 172 [2022-12-06 00:08:55,694 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:08:55,694 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:08:55,694 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:08:55,694 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:08:55,694 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable765 [2022-12-06 00:08:55,694 INFO L420 AbstractCegarLoop]: === Iteration 767 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:08:55,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:08:55,694 INFO L85 PathProgramCache]: Analyzing trace with hash -510701986, now seen corresponding path program 1 times [2022-12-06 00:08:55,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:08:55,694 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575034657] [2022-12-06 00:08:55,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:08:55,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:08:55,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:08:55,762 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-06 00:08:55,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:08:55,763 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575034657] [2022-12-06 00:08:55,763 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1575034657] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:08:55,763 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:08:55,763 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:08:55,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645767962] [2022-12-06 00:08:55,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:08:55,763 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:08:55,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:08:55,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:08:55,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:08:55,763 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:08:55,763 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:08:55,763 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:08:55,763 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:08:55,763 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:08:56,033 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:08:56,033 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:08:56,038 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13560 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:08:56,045 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:08:56,046 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:08:56,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:08:56,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:08:56,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:08:56,046 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:08:56,046 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:08:56,046 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:08:56,078 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:08:56,080 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:56,080 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:08:56,080 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:08:56,080 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:08:56,080 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:56,080 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:08:56,080 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:08:56,081 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:56,081 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:56,116 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:08:56,116 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 00:08:56,117 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3312/3520 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2982 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:08:56,120 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:56,120 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:08:56,269 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:08:56,271 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 191 [2022-12-06 00:08:56,271 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:08:56,271 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:08:56,271 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:08:56,271 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:08:56,271 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable766 [2022-12-06 00:08:56,271 INFO L420 AbstractCegarLoop]: === Iteration 768 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:08:56,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:08:56,271 INFO L85 PathProgramCache]: Analyzing trace with hash 1232108349, now seen corresponding path program 1 times [2022-12-06 00:08:56,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:08:56,272 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756377965] [2022-12-06 00:08:56,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:08:56,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:08:56,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:08:56,341 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-06 00:08:56,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:08:56,342 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756377965] [2022-12-06 00:08:56,342 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1756377965] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:08:56,342 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:08:56,342 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:08:56,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409604876] [2022-12-06 00:08:56,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:08:56,342 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:08:56,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:08:56,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:08:56,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:08:56,343 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:08:56,343 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:08:56,343 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:08:56,343 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:08:56,343 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:08:56,648 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:08:56,648 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:08:56,652 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13546 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:08:56,658 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:08:56,658 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:08:56,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:08:56,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:08:56,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:08:56,659 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:08:56,659 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:08:56,659 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:08:56,687 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:08:56,688 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:56,688 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:08:56,688 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:08:56,688 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:08:56,688 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:56,688 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:08:56,688 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:08:56,689 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:56,689 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:56,713 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:08:56,713 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 00:08:56,714 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3321/3530 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2996 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:08:56,716 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:56,716 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:08:56,858 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:08:56,858 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 170 [2022-12-06 00:08:56,859 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:08:56,859 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:08:56,859 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:08:56,859 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:08:56,859 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable767 [2022-12-06 00:08:56,859 INFO L420 AbstractCegarLoop]: === Iteration 769 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:08:56,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:08:56,859 INFO L85 PathProgramCache]: Analyzing trace with hash -1320048612, now seen corresponding path program 1 times [2022-12-06 00:08:56,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:08:56,859 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829819524] [2022-12-06 00:08:56,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:08:56,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:08:56,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:08:56,927 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-06 00:08:56,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:08:56,927 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829819524] [2022-12-06 00:08:56,927 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1829819524] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:08:56,927 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:08:56,927 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:08:56,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137626193] [2022-12-06 00:08:56,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:08:56,928 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:08:56,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:08:56,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:08:56,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:08:56,928 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:08:56,928 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:08:56,928 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:08:56,928 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:08:56,928 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:08:57,206 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:08:57,206 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:08:57,211 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13553 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:08:57,218 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:08:57,218 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:08:57,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:08:57,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:08:57,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:08:57,218 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:08:57,218 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:08:57,218 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:08:57,251 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:08:57,252 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:57,252 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:08:57,252 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:08:57,253 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:08:57,253 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:57,253 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:08:57,253 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:08:57,253 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:57,254 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:57,277 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:08:57,277 INFO L131 PetriNetUnfolder]: For 3338/3547 co-relation queries the response was YES. [2022-12-06 00:08:57,278 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3338/3547 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2969 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:08:57,280 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:57,280 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:08:57,435 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:08:57,436 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 183 [2022-12-06 00:08:57,436 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:08:57,436 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:08:57,436 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:08:57,436 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:08:57,436 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable768 [2022-12-06 00:08:57,436 INFO L420 AbstractCegarLoop]: === Iteration 770 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:08:57,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:08:57,436 INFO L85 PathProgramCache]: Analyzing trace with hash 422761723, now seen corresponding path program 1 times [2022-12-06 00:08:57,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:08:57,437 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378099425] [2022-12-06 00:08:57,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:08:57,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:08:57,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:08:57,495 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-06 00:08:57,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:08:57,495 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378099425] [2022-12-06 00:08:57,495 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1378099425] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:08:57,495 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:08:57,495 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:08:57,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209634450] [2022-12-06 00:08:57,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:08:57,495 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:08:57,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:08:57,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:08:57,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:08:57,496 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:08:57,496 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:08:57,496 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:08:57,496 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:08:57,496 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:08:57,749 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:08:57,749 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:08:57,754 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13593 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:08:57,762 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:08:57,762 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:08:57,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:08:57,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:08:57,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:08:57,762 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:08:57,762 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:08:57,762 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:08:57,796 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:08:57,797 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:57,797 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:08:57,797 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:08:57,797 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:08:57,797 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:57,797 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:08:57,797 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:08:57,797 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:57,798 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:57,821 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:08:57,822 INFO L131 PetriNetUnfolder]: For 3304/3511 co-relation queries the response was YES. [2022-12-06 00:08:57,822 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3304/3511 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2998 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:08:57,824 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:57,824 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:08:57,963 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:08:57,964 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 167 [2022-12-06 00:08:57,964 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:08:57,964 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:08:57,964 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:08:57,964 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:08:57,964 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable769 [2022-12-06 00:08:57,964 INFO L420 AbstractCegarLoop]: === Iteration 771 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:08:57,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:08:57,964 INFO L85 PathProgramCache]: Analyzing trace with hash -2129395238, now seen corresponding path program 1 times [2022-12-06 00:08:57,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:08:57,964 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949098956] [2022-12-06 00:08:57,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:08:57,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:08:57,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:08:58,030 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-06 00:08:58,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:08:58,031 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949098956] [2022-12-06 00:08:58,031 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1949098956] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:08:58,031 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:08:58,031 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:08:58,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542415297] [2022-12-06 00:08:58,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:08:58,031 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:08:58,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:08:58,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:08:58,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:08:58,031 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:08:58,031 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:08:58,032 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:08:58,032 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:08:58,032 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:08:58,300 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:08:58,300 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:08:58,305 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13543 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:08:58,311 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:08:58,311 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:08:58,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:08:58,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:08:58,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:08:58,312 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:08:58,312 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:08:58,312 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:08:58,343 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:08:58,344 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:58,344 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:08:58,344 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:08:58,344 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:08:58,344 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:58,345 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:08:58,345 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:08:58,345 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:58,345 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:58,369 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:08:58,369 INFO L131 PetriNetUnfolder]: For 3310/3519 co-relation queries the response was YES. [2022-12-06 00:08:58,370 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3310/3519 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2995 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:08:58,372 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:58,372 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:08:58,520 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:08:58,520 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 176 [2022-12-06 00:08:58,520 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:08:58,520 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:08:58,520 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:08:58,521 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:08:58,521 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable770 [2022-12-06 00:08:58,521 INFO L420 AbstractCegarLoop]: === Iteration 772 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:08:58,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:08:58,521 INFO L85 PathProgramCache]: Analyzing trace with hash -386584903, now seen corresponding path program 1 times [2022-12-06 00:08:58,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:08:58,521 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334088143] [2022-12-06 00:08:58,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:08:58,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:08:58,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:08:58,586 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-06 00:08:58,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:08:58,587 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334088143] [2022-12-06 00:08:58,587 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1334088143] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:08:58,587 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:08:58,587 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:08:58,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948764624] [2022-12-06 00:08:58,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:08:58,587 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:08:58,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:08:58,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:08:58,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:08:58,587 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:08:58,588 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:08:58,588 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:08:58,588 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:08:58,588 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:08:58,849 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:08:58,849 INFO L131 PetriNetUnfolder]: For 27136/27181 co-relation queries the response was YES. [2022-12-06 00:08:58,854 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27136/27181 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13524 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:08:58,860 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:08:58,860 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:08:58,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:08:58,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:08:58,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:08:58,861 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:08:58,861 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:08:58,861 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:08:58,892 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:08:58,893 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:58,894 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:08:58,894 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:08:58,894 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:08:58,894 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:58,894 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:08:58,894 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:08:58,894 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:58,895 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:58,918 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:08:58,918 INFO L131 PetriNetUnfolder]: For 3167/3307 co-relation queries the response was YES. [2022-12-06 00:08:58,919 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3167/3307 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 3003 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:08:58,921 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:58,921 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:08:59,062 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:08:59,062 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 168 [2022-12-06 00:08:59,062 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:08:59,063 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:08:59,063 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:08:59,063 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:08:59,063 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable771 [2022-12-06 00:08:59,063 INFO L420 AbstractCegarLoop]: === Iteration 773 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:08:59,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:08:59,063 INFO L85 PathProgramCache]: Analyzing trace with hash 1356225432, now seen corresponding path program 1 times [2022-12-06 00:08:59,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:08:59,063 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423070576] [2022-12-06 00:08:59,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:08:59,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:08:59,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:08:59,151 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-06 00:08:59,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:08:59,151 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423070576] [2022-12-06 00:08:59,152 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [423070576] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:08:59,152 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:08:59,152 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:08:59,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849456055] [2022-12-06 00:08:59,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:08:59,152 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:08:59,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:08:59,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:08:59,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:08:59,152 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:08:59,153 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:08:59,153 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:08:59,153 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:08:59,153 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:08:59,423 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:08:59,423 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:08:59,428 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13592 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:08:59,435 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:08:59,435 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:08:59,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:08:59,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:08:59,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:08:59,436 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:08:59,436 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:08:59,436 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:08:59,495 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:08:59,496 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:59,496 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:08:59,496 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:08:59,496 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:08:59,496 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:59,497 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:08:59,497 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:08:59,497 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:59,497 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:59,522 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:08:59,522 INFO L131 PetriNetUnfolder]: For 3338/3547 co-relation queries the response was YES. [2022-12-06 00:08:59,522 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3338/3547 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2975 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:08:59,524 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:08:59,524 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:08:59,675 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:08:59,676 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 180 [2022-12-06 00:08:59,676 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:08:59,676 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:08:59,676 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:08:59,676 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:08:59,676 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable772 [2022-12-06 00:08:59,676 INFO L420 AbstractCegarLoop]: === Iteration 774 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:08:59,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:08:59,676 INFO L85 PathProgramCache]: Analyzing trace with hash -1195931529, now seen corresponding path program 1 times [2022-12-06 00:08:59,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:08:59,676 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087569366] [2022-12-06 00:08:59,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:08:59,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:08:59,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:08:59,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-06 00:08:59,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:08:59,745 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087569366] [2022-12-06 00:08:59,745 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1087569366] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:08:59,745 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:08:59,745 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:08:59,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102739012] [2022-12-06 00:08:59,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:08:59,745 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:08:59,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:08:59,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:08:59,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:08:59,746 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:08:59,746 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:08:59,746 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:08:59,746 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:08:59,746 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:09:00,011 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:09:00,011 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:09:00,017 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13557 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:09:00,026 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:09:00,026 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:09:00,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:09:00,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:09:00,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:09:00,026 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:09:00,026 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:09:00,027 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:09:00,060 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:09:00,061 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:00,061 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:09:00,061 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:09:00,061 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:09:00,062 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:00,062 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:09:00,062 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:09:00,062 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:00,063 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:00,086 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:09:00,086 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 00:09:00,087 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3312/3520 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 3003 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:09:00,089 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:00,089 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:09:00,229 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:09:00,230 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 169 [2022-12-06 00:09:00,230 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:09:00,230 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:09:00,230 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:09:00,230 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:09:00,230 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable773 [2022-12-06 00:09:00,230 INFO L420 AbstractCegarLoop]: === Iteration 775 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:09:00,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:09:00,230 INFO L85 PathProgramCache]: Analyzing trace with hash 546878806, now seen corresponding path program 1 times [2022-12-06 00:09:00,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:09:00,230 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299201511] [2022-12-06 00:09:00,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:09:00,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:09:00,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:09:00,289 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-06 00:09:00,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:09:00,289 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299201511] [2022-12-06 00:09:00,289 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [299201511] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:09:00,289 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:09:00,289 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:09:00,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119168686] [2022-12-06 00:09:00,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:09:00,289 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:09:00,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:09:00,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:09:00,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:09:00,290 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:09:00,290 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:09:00,290 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:09:00,290 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:09:00,290 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:09:00,549 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:09:00,549 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 00:09:00,554 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26965/27010 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13509 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:09:00,561 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:09:00,561 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:09:00,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:09:00,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:09:00,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:09:00,562 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:09:00,562 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:09:00,562 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:09:00,594 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:09:00,595 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:00,595 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:09:00,596 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:09:00,596 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:09:00,596 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:00,596 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:09:00,596 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:09:00,596 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:00,597 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:00,620 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:09:00,620 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 00:09:00,621 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3133/3273 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2980 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:09:00,623 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:00,623 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:09:00,787 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:09:00,788 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 192 [2022-12-06 00:09:00,788 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:09:00,788 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:09:00,788 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:09:00,788 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:09:00,788 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable774 [2022-12-06 00:09:00,788 INFO L420 AbstractCegarLoop]: === Iteration 776 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:09:00,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:09:00,788 INFO L85 PathProgramCache]: Analyzing trace with hash -2005278155, now seen corresponding path program 1 times [2022-12-06 00:09:00,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:09:00,789 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876605915] [2022-12-06 00:09:00,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:09:00,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:09:00,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:09:00,846 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-06 00:09:00,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:09:00,846 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876605915] [2022-12-06 00:09:00,846 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [876605915] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:09:00,846 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:09:00,846 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:09:00,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067705677] [2022-12-06 00:09:00,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:09:00,846 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:09:00,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:09:00,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:09:00,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:09:00,847 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:09:00,847 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:09:00,847 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:09:00,847 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:09:00,847 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:09:01,117 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:09:01,117 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:09:01,122 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13545 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:09:01,128 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:09:01,128 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:09:01,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:09:01,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:09:01,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:09:01,129 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:09:01,129 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:09:01,129 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:09:01,160 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:09:01,161 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:01,161 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:09:01,161 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:09:01,161 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:09:01,161 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:01,162 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:09:01,162 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:09:01,162 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:01,162 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:01,186 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:09:01,186 INFO L131 PetriNetUnfolder]: For 3307/3517 co-relation queries the response was YES. [2022-12-06 00:09:01,187 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3307/3517 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 3011 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:09:01,189 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:01,189 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:09:01,324 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:09:01,324 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 163 [2022-12-06 00:09:01,324 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:09:01,324 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:09:01,324 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:09:01,324 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:09:01,324 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable775 [2022-12-06 00:09:01,324 INFO L420 AbstractCegarLoop]: === Iteration 777 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:09:01,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:09:01,324 INFO L85 PathProgramCache]: Analyzing trace with hash -262467820, now seen corresponding path program 1 times [2022-12-06 00:09:01,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:09:01,325 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942039909] [2022-12-06 00:09:01,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:09:01,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:09:01,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:09:01,382 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-06 00:09:01,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:09:01,382 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942039909] [2022-12-06 00:09:01,382 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [942039909] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:09:01,382 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:09:01,382 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:09:01,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557612149] [2022-12-06 00:09:01,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:09:01,382 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:09:01,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:09:01,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:09:01,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:09:01,382 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:09:01,383 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:09:01,383 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:09:01,383 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:09:01,383 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:09:01,638 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:09:01,639 INFO L131 PetriNetUnfolder]: For 27136/27181 co-relation queries the response was YES. [2022-12-06 00:09:01,644 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27136/27181 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13536 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:09:01,651 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:09:01,651 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:09:01,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:09:01,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:09:01,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:09:01,652 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:09:01,652 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:09:01,652 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:09:01,686 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:09:01,688 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:01,688 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:09:01,688 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:09:01,688 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:09:01,688 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:01,688 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:09:01,689 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:09:01,689 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:01,689 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:01,715 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:09:01,715 INFO L131 PetriNetUnfolder]: For 3180/3321 co-relation queries the response was YES. [2022-12-06 00:09:01,716 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3180/3321 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2981 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:09:01,718 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:01,718 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:09:01,857 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:09:01,858 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 170 [2022-12-06 00:09:01,858 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:09:01,858 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:09:01,858 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:09:01,858 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:09:01,858 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable776 [2022-12-06 00:09:01,858 INFO L420 AbstractCegarLoop]: === Iteration 778 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:09:01,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:09:01,858 INFO L85 PathProgramCache]: Analyzing trace with hash 1480342515, now seen corresponding path program 1 times [2022-12-06 00:09:01,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:09:01,858 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401190633] [2022-12-06 00:09:01,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:09:01,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:09:01,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:09:01,917 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-06 00:09:01,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:09:01,918 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401190633] [2022-12-06 00:09:01,918 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1401190633] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:09:01,918 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:09:01,918 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:09:01,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557433838] [2022-12-06 00:09:01,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:09:01,918 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:09:01,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:09:01,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:09:01,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:09:01,918 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:09:01,919 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:09:01,919 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:09:01,919 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:09:01,919 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:09:02,192 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:09:02,192 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 00:09:02,197 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26969/27014 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13513 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:09:02,205 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:09:02,205 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:09:02,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:09:02,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:09:02,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:09:02,206 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:09:02,206 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:09:02,206 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:09:02,241 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:09:02,242 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:02,243 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:09:02,243 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:09:02,243 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:09:02,243 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:02,243 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:09:02,243 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:09:02,243 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:02,244 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:02,279 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:09:02,279 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 00:09:02,280 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3133/3273 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2969 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:09:02,282 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:02,282 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:09:02,421 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:09:02,421 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 178 [2022-12-06 00:09:02,421 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:09:02,421 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:09:02,422 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:09:02,422 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:09:02,422 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable777 [2022-12-06 00:09:02,422 INFO L420 AbstractCegarLoop]: === Iteration 779 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:09:02,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:09:02,422 INFO L85 PathProgramCache]: Analyzing trace with hash -1071814446, now seen corresponding path program 1 times [2022-12-06 00:09:02,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:09:02,422 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142989258] [2022-12-06 00:09:02,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:09:02,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:09:02,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:09:02,481 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:09:02,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:09:02,481 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142989258] [2022-12-06 00:09:02,481 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2142989258] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:09:02,481 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:09:02,482 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:09:02,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731135338] [2022-12-06 00:09:02,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:09:02,482 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:09:02,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:09:02,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:09:02,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:09:02,482 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:09:02,482 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:09:02,482 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:09:02,482 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:09:02,482 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:09:02,751 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:09:02,751 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:09:02,757 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13543 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:09:02,765 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:09:02,765 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:09:02,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:09:02,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:09:02,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:09:02,766 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:09:02,766 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:09:02,766 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:09:02,801 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:09:02,802 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:02,802 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:09:02,802 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:09:02,802 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:09:02,802 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:02,803 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:09:02,803 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:09:02,803 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:02,803 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:02,827 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:09:02,828 INFO L131 PetriNetUnfolder]: For 3318/3528 co-relation queries the response was YES. [2022-12-06 00:09:02,829 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3318/3528 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2988 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:09:02,830 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:02,831 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:09:02,985 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:09:02,985 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 183 [2022-12-06 00:09:02,985 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:09:02,986 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:09:02,986 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:09:02,986 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:09:02,986 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable778 [2022-12-06 00:09:02,986 INFO L420 AbstractCegarLoop]: === Iteration 780 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:09:02,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:09:02,986 INFO L85 PathProgramCache]: Analyzing trace with hash 670995889, now seen corresponding path program 1 times [2022-12-06 00:09:02,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:09:02,986 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679208738] [2022-12-06 00:09:02,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:09:02,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:09:02,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:09:03,054 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-06 00:09:03,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:09:03,054 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679208738] [2022-12-06 00:09:03,054 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1679208738] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:09:03,054 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:09:03,054 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:09:03,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003053998] [2022-12-06 00:09:03,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:09:03,054 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:09:03,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:09:03,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:09:03,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:09:03,055 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:09:03,055 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:09:03,055 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:09:03,055 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:09:03,055 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:09:03,336 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:09:03,336 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:09:03,342 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13532 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:09:03,349 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:09:03,349 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:09:03,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:09:03,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:09:03,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:09:03,350 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:09:03,350 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:09:03,350 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:09:03,385 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:09:03,386 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:03,387 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:09:03,387 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:09:03,387 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:09:03,387 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:03,387 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:09:03,387 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:09:03,387 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:03,388 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:03,412 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:09:03,412 INFO L131 PetriNetUnfolder]: For 3310/3519 co-relation queries the response was YES. [2022-12-06 00:09:03,413 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3310/3519 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2982 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:09:03,415 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:03,415 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:09:03,555 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:09:03,556 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 169 [2022-12-06 00:09:03,556 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:09:03,556 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:09:03,556 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:09:03,556 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:09:03,556 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable779 [2022-12-06 00:09:03,556 INFO L420 AbstractCegarLoop]: === Iteration 781 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:09:03,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:09:03,556 INFO L85 PathProgramCache]: Analyzing trace with hash -1881161072, now seen corresponding path program 1 times [2022-12-06 00:09:03,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:09:03,557 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556573347] [2022-12-06 00:09:03,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:09:03,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:09:03,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:09:03,626 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-06 00:09:03,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:09:03,626 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556573347] [2022-12-06 00:09:03,626 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [556573347] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:09:03,626 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:09:03,626 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:09:03,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554944532] [2022-12-06 00:09:03,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:09:03,626 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:09:03,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:09:03,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:09:03,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:09:03,627 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:09:03,627 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:09:03,627 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:09:03,627 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:09:03,627 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:09:03,925 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:09:03,925 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 00:09:03,930 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13555 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:09:03,937 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:09:03,937 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:09:03,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:09:03,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:09:03,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:09:03,937 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:09:03,938 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:09:03,938 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:09:03,968 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:09:03,969 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:03,969 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:09:03,969 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:09:03,969 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:09:03,969 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:03,969 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:09:03,969 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:09:03,970 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:03,970 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:03,994 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:09:03,994 INFO L131 PetriNetUnfolder]: For 3348/3558 co-relation queries the response was YES. [2022-12-06 00:09:03,995 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3348/3558 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2980 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:09:03,997 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:03,997 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:09:04,148 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:09:04,149 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 180 [2022-12-06 00:09:04,149 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:09:04,149 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:09:04,149 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:09:04,149 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:09:04,149 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable780 [2022-12-06 00:09:04,149 INFO L420 AbstractCegarLoop]: === Iteration 782 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:09:04,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:09:04,149 INFO L85 PathProgramCache]: Analyzing trace with hash -138350737, now seen corresponding path program 1 times [2022-12-06 00:09:04,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:09:04,150 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132239835] [2022-12-06 00:09:04,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:09:04,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:09:04,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:09:04,219 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-06 00:09:04,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:09:04,219 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132239835] [2022-12-06 00:09:04,219 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [132239835] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:09:04,219 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:09:04,219 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:09:04,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839408877] [2022-12-06 00:09:04,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:09:04,220 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:09:04,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:09:04,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:09:04,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:09:04,220 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:09:04,220 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:09:04,220 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:09:04,220 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:09:04,220 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:09:04,496 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:09:04,496 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 00:09:04,501 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26969/27014 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13528 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:09:04,509 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:09:04,509 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:09:04,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:09:04,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:09:04,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:09:04,510 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:09:04,510 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:09:04,510 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:09:04,544 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:09:04,545 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:04,545 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:09:04,545 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:09:04,545 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:09:04,545 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:04,546 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:09:04,546 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:09:04,546 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:04,546 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:04,570 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:09:04,570 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 00:09:04,571 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3133/3273 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2960 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:09:04,573 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:04,573 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:09:04,713 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:09:04,714 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 169 [2022-12-06 00:09:04,714 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:09:04,714 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:09:04,714 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:09:04,714 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:09:04,714 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable781 [2022-12-06 00:09:04,714 INFO L420 AbstractCegarLoop]: === Iteration 783 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:09:04,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:09:04,714 INFO L85 PathProgramCache]: Analyzing trace with hash 1604459598, now seen corresponding path program 1 times [2022-12-06 00:09:04,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:09:04,714 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382779841] [2022-12-06 00:09:04,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:09:04,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:09:04,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:09:04,774 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-06 00:09:04,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:09:04,774 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382779841] [2022-12-06 00:09:04,774 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1382779841] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:09:04,774 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:09:04,774 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:09:04,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455088496] [2022-12-06 00:09:04,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:09:04,774 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:09:04,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:09:04,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:09:04,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:09:04,775 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:09:04,775 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:09:04,775 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:09:04,775 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:09:04,775 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:09:05,034 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:09:05,034 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:09:05,039 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13560 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:09:05,047 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:09:05,047 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:09:05,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:09:05,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:09:05,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:09:05,048 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:09:05,048 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:09:05,048 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:09:05,095 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:09:05,097 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:05,097 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:09:05,097 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:09:05,097 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:09:05,098 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:05,098 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:09:05,098 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:09:05,098 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:05,099 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:05,132 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:09:05,132 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 00:09:05,134 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3312/3520 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2982 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:09:05,137 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:05,137 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:09:05,288 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:09:05,289 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 192 [2022-12-06 00:09:05,289 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:09:05,289 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:09:05,289 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:09:05,289 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:09:05,289 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable782 [2022-12-06 00:09:05,289 INFO L420 AbstractCegarLoop]: === Iteration 784 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:09:05,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:09:05,289 INFO L85 PathProgramCache]: Analyzing trace with hash -947697363, now seen corresponding path program 1 times [2022-12-06 00:09:05,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:09:05,290 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683118817] [2022-12-06 00:09:05,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:09:05,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:09:05,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:09:05,350 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-06 00:09:05,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:09:05,350 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683118817] [2022-12-06 00:09:05,350 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [683118817] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:09:05,350 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:09:05,351 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:09:05,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089735153] [2022-12-06 00:09:05,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:09:05,351 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:09:05,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:09:05,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:09:05,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:09:05,351 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:09:05,351 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:09:05,351 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:09:05,351 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:09:05,351 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:09:05,612 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:09:05,612 INFO L131 PetriNetUnfolder]: For 27229/27274 co-relation queries the response was YES. [2022-12-06 00:09:05,618 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27229/27274 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13553 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:09:05,625 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:09:05,625 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:09:05,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:09:05,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:09:05,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:09:05,626 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:09:05,626 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:09:05,626 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:09:05,661 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:09:05,662 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:05,662 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:09:05,662 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:09:05,663 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:09:05,663 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:05,663 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:09:05,663 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:09:05,663 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:05,664 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:05,688 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:09:05,688 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 00:09:05,689 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3312/3520 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2985 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:09:05,691 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:05,691 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:09:05,843 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:09:05,843 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 180 [2022-12-06 00:09:05,843 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:09:05,843 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:09:05,843 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:09:05,843 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:09:05,843 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable783 [2022-12-06 00:09:05,843 INFO L420 AbstractCegarLoop]: === Iteration 785 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:09:05,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:09:05,844 INFO L85 PathProgramCache]: Analyzing trace with hash 795112972, now seen corresponding path program 1 times [2022-12-06 00:09:05,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:09:05,844 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627598967] [2022-12-06 00:09:05,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:09:05,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:09:05,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:09:05,915 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-06 00:09:05,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:09:05,915 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627598967] [2022-12-06 00:09:05,915 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1627598967] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:09:05,915 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:09:05,915 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:09:05,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010814382] [2022-12-06 00:09:05,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:09:05,916 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:09:05,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:09:05,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:09:05,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:09:05,916 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:09:05,916 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:09:05,916 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:09:05,916 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:09:05,916 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:09:06,199 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:09:06,199 INFO L131 PetriNetUnfolder]: For 27229/27274 co-relation queries the response was YES. [2022-12-06 00:09:06,206 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27229/27274 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13552 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:09:06,214 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:09:06,214 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:09:06,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:09:06,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:09:06,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:09:06,215 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:09:06,215 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:09:06,215 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:09:06,248 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:09:06,249 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:06,249 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:09:06,249 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:09:06,249 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:09:06,249 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:06,249 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:09:06,249 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:09:06,250 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:06,250 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:06,274 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:09:06,274 INFO L131 PetriNetUnfolder]: For 3348/3558 co-relation queries the response was YES. [2022-12-06 00:09:06,275 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3348/3558 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2990 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:09:06,277 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:06,277 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:09:06,420 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:09:06,420 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 171 [2022-12-06 00:09:06,420 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:09:06,421 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:09:06,421 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:09:06,421 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:09:06,421 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable784 [2022-12-06 00:09:06,421 INFO L420 AbstractCegarLoop]: === Iteration 786 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:09:06,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:09:06,421 INFO L85 PathProgramCache]: Analyzing trace with hash -1757043989, now seen corresponding path program 1 times [2022-12-06 00:09:06,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:09:06,421 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23736522] [2022-12-06 00:09:06,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:09:06,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:09:06,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:09:06,499 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-06 00:09:06,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:09:06,500 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23736522] [2022-12-06 00:09:06,500 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [23736522] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:09:06,500 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:09:06,500 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:09:06,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333334562] [2022-12-06 00:09:06,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:09:06,500 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:09:06,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:09:06,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:09:06,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:09:06,500 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:09:06,500 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:09:06,500 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:09:06,500 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:09:06,500 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:09:06,796 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:09:06,796 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 00:09:06,801 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26969/27014 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13561 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:09:06,806 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:09:06,807 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:09:06,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:09:06,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:09:06,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:09:06,807 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:09:06,807 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:09:06,808 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:09:06,837 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:09:06,838 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:06,838 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:09:06,839 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:09:06,839 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:09:06,839 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:06,839 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:09:06,839 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:09:06,839 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:06,840 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:06,864 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:09:06,865 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 00:09:06,865 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3133/3273 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2973 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:09:06,867 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:06,867 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:09:07,023 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:09:07,024 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 185 [2022-12-06 00:09:07,024 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:09:07,024 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:09:07,024 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:09:07,024 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:09:07,024 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable785 [2022-12-06 00:09:07,024 INFO L420 AbstractCegarLoop]: === Iteration 787 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:09:07,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:09:07,025 INFO L85 PathProgramCache]: Analyzing trace with hash -14233654, now seen corresponding path program 1 times [2022-12-06 00:09:07,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:09:07,025 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786006885] [2022-12-06 00:09:07,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:09:07,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:09:07,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:09:07,098 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-06 00:09:07,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:09:07,098 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786006885] [2022-12-06 00:09:07,098 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [786006885] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:09:07,098 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:09:07,098 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:09:07,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254919975] [2022-12-06 00:09:07,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:09:07,098 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:09:07,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:09:07,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:09:07,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:09:07,099 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:09:07,099 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:09:07,099 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:09:07,099 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:09:07,099 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:09:07,372 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:09:07,372 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 00:09:07,377 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26965/27010 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13518 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:09:07,383 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:09:07,383 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:09:07,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:09:07,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:09:07,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:09:07,384 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:09:07,384 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:09:07,384 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:09:07,417 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:09:07,418 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:07,418 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:09:07,418 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:09:07,418 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:09:07,418 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:07,419 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:09:07,419 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:09:07,419 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:07,419 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:07,443 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:09:07,443 INFO L131 PetriNetUnfolder]: For 3122/3262 co-relation queries the response was YES. [2022-12-06 00:09:07,444 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3122/3262 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2989 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:09:07,446 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:07,446 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:09:07,589 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:09:07,589 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 171 [2022-12-06 00:09:07,590 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:09:07,590 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:09:07,590 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:09:07,590 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:09:07,590 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable786 [2022-12-06 00:09:07,590 INFO L420 AbstractCegarLoop]: === Iteration 788 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:09:07,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:09:07,590 INFO L85 PathProgramCache]: Analyzing trace with hash 1728576681, now seen corresponding path program 1 times [2022-12-06 00:09:07,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:09:07,590 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510860723] [2022-12-06 00:09:07,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:09:07,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:09:07,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:09:07,648 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-06 00:09:07,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:09:07,648 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510860723] [2022-12-06 00:09:07,648 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [510860723] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:09:07,649 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:09:07,649 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:09:07,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125363543] [2022-12-06 00:09:07,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:09:07,649 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:09:07,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:09:07,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:09:07,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:09:07,649 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:09:07,649 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:09:07,649 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:09:07,649 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:09:07,649 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:09:07,916 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:09:07,916 INFO L131 PetriNetUnfolder]: For 27136/27181 co-relation queries the response was YES. [2022-12-06 00:09:07,921 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27136/27181 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13513 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:09:07,928 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:09:07,929 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:09:07,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:09:07,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:09:07,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:09:07,929 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:09:07,929 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:09:07,929 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:09:07,963 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:09:07,964 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:07,964 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:09:07,964 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:09:07,964 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:09:07,964 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:07,965 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:09:07,965 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:09:07,965 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:07,965 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:07,989 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:09:07,989 INFO L131 PetriNetUnfolder]: For 3156/3296 co-relation queries the response was YES. [2022-12-06 00:09:07,990 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3156/3296 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2993 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:09:07,991 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:07,991 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:09:08,139 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:09:08,139 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 175 [2022-12-06 00:09:08,139 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:09:08,139 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:09:08,139 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:09:08,139 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:09:08,140 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable787 [2022-12-06 00:09:08,140 INFO L420 AbstractCegarLoop]: === Iteration 789 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:09:08,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:09:08,140 INFO L85 PathProgramCache]: Analyzing trace with hash -823580280, now seen corresponding path program 1 times [2022-12-06 00:09:08,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:09:08,140 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214412142] [2022-12-06 00:09:08,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:09:08,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:09:08,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:09:08,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-06 00:09:08,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:09:08,207 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214412142] [2022-12-06 00:09:08,207 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1214412142] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:09:08,207 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:09:08,208 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:09:08,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262223587] [2022-12-06 00:09:08,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:09:08,208 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:09:08,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:09:08,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:09:08,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:09:08,208 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:09:08,208 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:09:08,208 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:09:08,208 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:09:08,208 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:09:08,467 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:09:08,468 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 00:09:08,472 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13558 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:09:08,479 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:09:08,479 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:09:08,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:09:08,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:09:08,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:09:08,480 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:09:08,480 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:09:08,480 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:09:08,512 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:09:08,513 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:08,513 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:09:08,513 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:09:08,513 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:09:08,513 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:08,514 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:09:08,514 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:09:08,514 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:08,514 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:08,539 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:09:08,539 INFO L131 PetriNetUnfolder]: For 3338/3547 co-relation queries the response was YES. [2022-12-06 00:09:08,540 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3338/3547 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2989 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:09:08,542 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:08,542 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:09:08,685 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:09:08,686 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 173 [2022-12-06 00:09:08,686 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:09:08,686 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:09:08,686 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:09:08,686 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:09:08,686 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable788 [2022-12-06 00:09:08,686 INFO L420 AbstractCegarLoop]: === Iteration 790 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:09:08,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:09:08,686 INFO L85 PathProgramCache]: Analyzing trace with hash 919230055, now seen corresponding path program 1 times [2022-12-06 00:09:08,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:09:08,686 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226795662] [2022-12-06 00:09:08,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:09:08,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:09:08,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:09:08,747 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-06 00:09:08,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:09:08,747 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226795662] [2022-12-06 00:09:08,747 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [226795662] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:09:08,747 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:09:08,747 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:09:08,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487872852] [2022-12-06 00:09:08,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:09:08,748 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:09:08,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:09:08,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:09:08,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:09:08,748 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:09:08,748 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:09:08,748 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:09:08,748 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:09:08,748 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:09:09,010 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:09:09,011 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 00:09:09,016 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26965/27010 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13531 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:09:09,023 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:09:09,023 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:09:09,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:09:09,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:09:09,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:09:09,024 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:09:09,024 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:09:09,024 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:09:09,055 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:09:09,056 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:09,056 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:09:09,056 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:09:09,056 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:09:09,056 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:09,057 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:09:09,057 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:09:09,057 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:09,057 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:09,081 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:09:09,081 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 00:09:09,082 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3133/3273 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2958 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:09:09,084 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:09,084 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:09:09,228 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:09:09,229 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 173 [2022-12-06 00:09:09,229 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:09:09,229 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:09:09,229 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:09:09,229 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:09:09,229 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable789 [2022-12-06 00:09:09,229 INFO L420 AbstractCegarLoop]: === Iteration 791 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:09:09,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:09:09,229 INFO L85 PathProgramCache]: Analyzing trace with hash -1632926906, now seen corresponding path program 1 times [2022-12-06 00:09:09,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:09:09,229 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540495502] [2022-12-06 00:09:09,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:09:09,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:09:09,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:09:09,298 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-06 00:09:09,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:09:09,298 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540495502] [2022-12-06 00:09:09,298 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1540495502] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:09:09,298 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:09:09,298 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:09:09,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134994895] [2022-12-06 00:09:09,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:09:09,299 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:09:09,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:09:09,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:09:09,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:09:09,299 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:09:09,299 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:09:09,299 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:09:09,299 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:09:09,299 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:09:09,605 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:09:09,605 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 00:09:09,609 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26965/27010 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13517 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:09:09,615 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:09:09,616 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:09:09,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:09:09,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:09:09,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:09:09,616 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:09:09,616 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:09:09,616 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:09:09,646 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:09:09,648 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:09,648 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:09:09,648 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:09:09,648 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:09:09,648 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:09,648 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:09:09,648 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:09:09,649 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:09,649 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:09,673 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:09:09,673 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 00:09:09,674 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3133/3273 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2981 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:09:09,676 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:09,676 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:09:09,834 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:09:09,834 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 186 [2022-12-06 00:09:09,834 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:09:09,834 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:09:09,834 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:09:09,835 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:09:09,835 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable790 [2022-12-06 00:09:09,835 INFO L420 AbstractCegarLoop]: === Iteration 792 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:09:09,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:09:09,835 INFO L85 PathProgramCache]: Analyzing trace with hash 109883429, now seen corresponding path program 1 times [2022-12-06 00:09:09,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:09:09,835 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052848160] [2022-12-06 00:09:09,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:09:09,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:09:09,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:09:09,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-06 00:09:09,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:09:09,912 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052848160] [2022-12-06 00:09:09,912 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2052848160] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:09:09,912 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:09:09,912 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:09:09,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906010137] [2022-12-06 00:09:09,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:09:09,913 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:09:09,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:09:09,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:09:09,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:09:09,913 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:09:09,913 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:09:09,913 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:09:09,913 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:09:09,913 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:09:10,224 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:09:10,224 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 00:09:10,230 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26969/27014 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13522 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:09:10,240 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:09:10,240 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:09:10,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:09:10,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:09:10,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:09:10,241 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:09:10,241 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:09:10,241 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:09:10,279 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:09:10,281 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:10,281 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:09:10,281 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:09:10,281 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:09:10,281 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:10,281 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:09:10,281 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:09:10,281 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:10,282 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:10,311 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:09:10,312 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 00:09:10,313 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3133/3273 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2986 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:09:10,315 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:10,315 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:09:10,468 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:09:10,468 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 187 [2022-12-06 00:09:10,468 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:09:10,468 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:09:10,468 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:09:10,468 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:09:10,468 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable791 [2022-12-06 00:09:10,468 INFO L420 AbstractCegarLoop]: === Iteration 793 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:09:10,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:09:10,469 INFO L85 PathProgramCache]: Analyzing trace with hash 1852693764, now seen corresponding path program 1 times [2022-12-06 00:09:10,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:09:10,469 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323160659] [2022-12-06 00:09:10,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:09:10,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:09:10,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:09:10,528 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-06 00:09:10,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:09:10,529 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323160659] [2022-12-06 00:09:10,529 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [323160659] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:09:10,529 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:09:10,529 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:09:10,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89452016] [2022-12-06 00:09:10,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:09:10,529 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:09:10,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:09:10,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:09:10,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:09:10,529 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:09:10,530 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:09:10,530 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:09:10,530 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:09:10,530 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:09:10,804 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:09:10,804 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:09:10,810 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13537 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:09:10,817 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:09:10,817 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:09:10,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:09:10,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:09:10,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:09:10,818 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:09:10,818 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:09:10,818 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:09:10,852 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:09:10,853 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:10,853 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:09:10,853 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:09:10,853 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:09:10,853 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:10,853 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:09:10,854 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:09:10,854 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:10,854 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:10,878 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:09:10,878 INFO L131 PetriNetUnfolder]: For 3337/3547 co-relation queries the response was YES. [2022-12-06 00:09:10,879 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3337/3547 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2980 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:09:10,881 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:10,881 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:09:11,036 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:09:11,036 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 183 [2022-12-06 00:09:11,037 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:09:11,037 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:09:11,037 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:09:11,037 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:09:11,037 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable792 [2022-12-06 00:09:11,037 INFO L420 AbstractCegarLoop]: === Iteration 794 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:09:11,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:09:11,037 INFO L85 PathProgramCache]: Analyzing trace with hash -699463197, now seen corresponding path program 1 times [2022-12-06 00:09:11,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:09:11,037 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724339652] [2022-12-06 00:09:11,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:09:11,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:09:11,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:09:11,098 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-06 00:09:11,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:09:11,099 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724339652] [2022-12-06 00:09:11,099 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1724339652] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:09:11,099 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:09:11,099 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:09:11,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311128218] [2022-12-06 00:09:11,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:09:11,099 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:09:11,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:09:11,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:09:11,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:09:11,099 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:09:11,099 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:09:11,100 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:09:11,100 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:09:11,100 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:09:11,382 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:09:11,382 INFO L131 PetriNetUnfolder]: For 27136/27181 co-relation queries the response was YES. [2022-12-06 00:09:11,388 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27136/27181 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13517 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:09:11,396 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:09:11,396 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:09:11,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:09:11,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:09:11,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:09:11,396 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:09:11,396 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:09:11,396 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:09:11,428 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:09:11,429 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:11,429 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:09:11,429 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:09:11,429 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:09:11,430 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:11,430 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:09:11,430 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:09:11,430 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:11,431 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:11,455 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:09:11,455 INFO L131 PetriNetUnfolder]: For 3156/3296 co-relation queries the response was YES. [2022-12-06 00:09:11,456 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3156/3296 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2988 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:09:11,458 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:11,458 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:09:11,608 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:09:11,609 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 180 [2022-12-06 00:09:11,609 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:09:11,609 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:09:11,609 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:09:11,609 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:09:11,609 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable793 [2022-12-06 00:09:11,609 INFO L420 AbstractCegarLoop]: === Iteration 795 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:09:11,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:09:11,609 INFO L85 PathProgramCache]: Analyzing trace with hash 1043347138, now seen corresponding path program 1 times [2022-12-06 00:09:11,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:09:11,609 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521447618] [2022-12-06 00:09:11,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:09:11,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:09:11,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:09:11,678 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-06 00:09:11,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:09:11,678 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521447618] [2022-12-06 00:09:11,678 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1521447618] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:09:11,678 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:09:11,678 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:09:11,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173067979] [2022-12-06 00:09:11,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:09:11,679 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:09:11,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:09:11,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:09:11,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:09:11,679 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:09:11,679 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:09:11,679 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:09:11,679 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:09:11,679 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:09:11,968 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:09:11,968 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 00:09:11,973 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26969/27014 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13522 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:09:11,980 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:09:11,980 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:09:11,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:09:11,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:09:11,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:09:11,981 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:09:11,981 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:09:11,981 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:09:12,014 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:09:12,016 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:12,016 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:09:12,016 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:09:12,016 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:09:12,016 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:12,016 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:09:12,016 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:09:12,016 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:12,017 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:12,041 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:09:12,041 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 00:09:12,042 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3133/3273 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2967 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:09:12,044 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:12,044 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:09:12,201 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:09:12,202 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 186 [2022-12-06 00:09:12,202 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:09:12,202 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:09:12,202 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:09:12,202 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:09:12,202 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable794 [2022-12-06 00:09:12,202 INFO L420 AbstractCegarLoop]: === Iteration 796 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:09:12,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:09:12,202 INFO L85 PathProgramCache]: Analyzing trace with hash -1508809823, now seen corresponding path program 1 times [2022-12-06 00:09:12,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:09:12,202 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169265270] [2022-12-06 00:09:12,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:09:12,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:09:12,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:09:12,263 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-06 00:09:12,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:09:12,264 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169265270] [2022-12-06 00:09:12,264 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [169265270] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:09:12,264 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:09:12,264 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:09:12,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944553103] [2022-12-06 00:09:12,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:09:12,264 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:09:12,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:09:12,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:09:12,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:09:12,264 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:09:12,264 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:09:12,264 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:09:12,264 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:09:12,264 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:09:12,530 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:09:12,530 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 00:09:12,535 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26965/27010 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13506 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:09:12,542 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:09:12,542 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:09:12,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:09:12,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:09:12,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:09:12,543 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:09:12,543 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:09:12,543 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:09:12,602 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:09:12,603 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:12,603 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:09:12,603 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:09:12,603 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:09:12,603 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:12,604 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:09:12,604 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:09:12,604 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:12,604 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:12,628 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:09:12,628 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 00:09:12,629 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3133/3273 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2963 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:09:12,631 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:12,631 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:09:12,773 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:09:12,773 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 170 [2022-12-06 00:09:12,774 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:09:12,774 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:09:12,774 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:09:12,774 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:09:12,774 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable795 [2022-12-06 00:09:12,774 INFO L420 AbstractCegarLoop]: === Iteration 797 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:09:12,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:09:12,774 INFO L85 PathProgramCache]: Analyzing trace with hash 234000512, now seen corresponding path program 1 times [2022-12-06 00:09:12,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:09:12,774 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085563367] [2022-12-06 00:09:12,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:09:12,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:09:12,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:09:12,833 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:09:12,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:09:12,833 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085563367] [2022-12-06 00:09:12,834 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2085563367] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:09:12,834 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:09:12,834 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:09:12,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815659759] [2022-12-06 00:09:12,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:09:12,834 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:09:12,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:09:12,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:09:12,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:09:12,834 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:09:12,834 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:09:12,834 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:09:12,834 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:09:12,834 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:09:13,093 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:09:13,093 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:09:13,098 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13561 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:09:13,105 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:09:13,105 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:09:13,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:09:13,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:09:13,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:09:13,106 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:09:13,106 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:09:13,106 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:09:13,140 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:09:13,141 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:13,141 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:09:13,141 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:09:13,141 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:09:13,141 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:13,141 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:09:13,142 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:09:13,142 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:13,142 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:13,166 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:09:13,166 INFO L131 PetriNetUnfolder]: For 3338/3547 co-relation queries the response was YES. [2022-12-06 00:09:13,167 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3338/3547 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2970 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:09:13,169 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:13,169 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:09:13,311 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:09:13,311 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 170 [2022-12-06 00:09:13,311 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:09:13,311 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:09:13,311 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:09:13,311 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:09:13,311 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable796 [2022-12-06 00:09:13,311 INFO L420 AbstractCegarLoop]: === Iteration 798 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:09:13,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:09:13,312 INFO L85 PathProgramCache]: Analyzing trace with hash 1976810847, now seen corresponding path program 1 times [2022-12-06 00:09:13,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:09:13,312 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806615930] [2022-12-06 00:09:13,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:09:13,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:09:13,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:09:13,380 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-06 00:09:13,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:09:13,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806615930] [2022-12-06 00:09:13,381 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [806615930] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:09:13,381 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:09:13,381 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:09:13,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131795878] [2022-12-06 00:09:13,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:09:13,381 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:09:13,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:09:13,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:09:13,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:09:13,381 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:09:13,381 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:09:13,381 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:09:13,381 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:09:13,381 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:09:13,657 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:09:13,658 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:09:13,663 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13558 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:09:13,670 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:09:13,670 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:09:13,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:09:13,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:09:13,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:09:13,670 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:09:13,670 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:09:13,670 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:09:13,703 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:09:13,704 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:13,704 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:09:13,704 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:09:13,704 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:09:13,705 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:13,705 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:09:13,705 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:09:13,705 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:13,705 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:13,729 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:09:13,729 INFO L131 PetriNetUnfolder]: For 3293/3500 co-relation queries the response was YES. [2022-12-06 00:09:13,730 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3293/3500 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2997 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:09:13,732 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:13,732 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:09:13,883 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:09:13,883 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 179 [2022-12-06 00:09:13,884 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:09:13,884 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:09:13,884 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:09:13,884 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:09:13,884 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable797 [2022-12-06 00:09:13,884 INFO L420 AbstractCegarLoop]: === Iteration 799 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:09:13,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:09:13,884 INFO L85 PathProgramCache]: Analyzing trace with hash -575346114, now seen corresponding path program 1 times [2022-12-06 00:09:13,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:09:13,884 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001965851] [2022-12-06 00:09:13,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:09:13,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:09:13,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:09:13,944 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-06 00:09:13,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:09:13,944 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001965851] [2022-12-06 00:09:13,944 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1001965851] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:09:13,944 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:09:13,944 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:09:13,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575582322] [2022-12-06 00:09:13,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:09:13,944 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:09:13,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:09:13,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:09:13,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:09:13,945 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:09:13,945 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:09:13,945 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:09:13,945 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:09:13,945 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:09:14,209 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:09:14,210 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 00:09:14,214 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13554 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:09:14,220 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:09:14,220 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:09:14,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:09:14,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:09:14,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:09:14,221 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:09:14,221 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:09:14,221 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:09:14,252 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:09:14,253 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:14,253 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:09:14,254 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:09:14,254 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:09:14,254 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:14,254 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:09:14,254 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:09:14,254 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:14,255 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:14,278 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:09:14,278 INFO L131 PetriNetUnfolder]: For 3310/3519 co-relation queries the response was YES. [2022-12-06 00:09:14,279 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3310/3519 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2989 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:09:14,281 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:14,281 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:09:14,425 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:09:14,425 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 171 [2022-12-06 00:09:14,425 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:09:14,425 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:09:14,426 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:09:14,426 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:09:14,426 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable798 [2022-12-06 00:09:14,426 INFO L420 AbstractCegarLoop]: === Iteration 800 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:09:14,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:09:14,426 INFO L85 PathProgramCache]: Analyzing trace with hash 1167464221, now seen corresponding path program 1 times [2022-12-06 00:09:14,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:09:14,426 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528164796] [2022-12-06 00:09:14,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:09:14,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:09:14,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:09:14,493 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-06 00:09:14,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:09:14,493 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528164796] [2022-12-06 00:09:14,493 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [528164796] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:09:14,493 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:09:14,493 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:09:14,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658943128] [2022-12-06 00:09:14,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:09:14,494 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:09:14,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:09:14,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:09:14,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:09:14,494 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:09:14,494 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:09:14,494 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:09:14,494 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:09:14,494 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:09:14,763 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:09:14,763 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:09:14,768 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13538 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:09:14,775 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:09:14,775 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:09:14,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:09:14,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:09:14,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:09:14,776 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:09:14,776 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:09:14,776 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:09:14,807 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:09:14,808 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:14,808 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:09:14,808 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:09:14,808 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:09:14,808 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:14,809 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:09:14,809 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:09:14,809 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:14,809 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:14,833 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:09:14,833 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 00:09:14,834 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3312/3520 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2984 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:09:14,835 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:14,836 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:09:14,992 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:09:14,993 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 185 [2022-12-06 00:09:14,993 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:09:14,993 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:09:14,993 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:09:14,993 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:09:14,993 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable799 [2022-12-06 00:09:14,993 INFO L420 AbstractCegarLoop]: === Iteration 801 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:09:14,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:09:14,993 INFO L85 PathProgramCache]: Analyzing trace with hash -1384692740, now seen corresponding path program 1 times [2022-12-06 00:09:14,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:09:14,993 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716216901] [2022-12-06 00:09:14,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:09:14,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:09:15,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:09:15,052 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-06 00:09:15,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:09:15,053 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716216901] [2022-12-06 00:09:15,053 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [716216901] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:09:15,053 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:09:15,053 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:09:15,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223047597] [2022-12-06 00:09:15,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:09:15,053 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:09:15,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:09:15,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:09:15,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:09:15,053 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:09:15,053 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:09:15,053 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:09:15,054 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:09:15,054 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:09:15,316 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:09:15,316 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:09:15,320 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13554 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:09:15,327 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:09:15,327 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:09:15,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:09:15,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:09:15,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:09:15,327 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:09:15,327 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:09:15,327 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:09:15,359 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:09:15,360 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:15,360 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:09:15,361 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:09:15,361 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:09:15,361 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:15,361 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:09:15,361 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:09:15,361 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:15,362 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:15,393 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:09:15,393 INFO L131 PetriNetUnfolder]: For 3337/3547 co-relation queries the response was YES. [2022-12-06 00:09:15,394 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3337/3547 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2995 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:09:15,396 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:15,396 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:09:15,553 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:09:15,553 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 192 [2022-12-06 00:09:15,553 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:09:15,553 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:09:15,554 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:09:15,554 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:09:15,554 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable800 [2022-12-06 00:09:15,554 INFO L420 AbstractCegarLoop]: === Iteration 802 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:09:15,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:09:15,554 INFO L85 PathProgramCache]: Analyzing trace with hash 358117595, now seen corresponding path program 1 times [2022-12-06 00:09:15,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:09:15,554 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560910392] [2022-12-06 00:09:15,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:09:15,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:09:15,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:09:15,611 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:09:15,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:09:15,611 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560910392] [2022-12-06 00:09:15,611 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1560910392] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:09:15,611 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:09:15,612 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:09:15,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075691701] [2022-12-06 00:09:15,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:09:15,612 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:09:15,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:09:15,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:09:15,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:09:15,612 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:09:15,612 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:09:15,612 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:09:15,612 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:09:15,612 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:09:15,868 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:09:15,868 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:09:15,873 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13558 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:09:15,879 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:09:15,879 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:09:15,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:09:15,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:09:15,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:09:15,880 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:09:15,880 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:09:15,880 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:09:15,912 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:09:15,913 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:15,913 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:09:15,913 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:09:15,913 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:09:15,913 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:15,914 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:09:15,914 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:09:15,914 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:15,914 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:15,938 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:09:15,938 INFO L131 PetriNetUnfolder]: For 3293/3500 co-relation queries the response was YES. [2022-12-06 00:09:15,939 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3293/3500 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2979 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:09:15,941 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:15,941 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:09:16,079 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:09:16,079 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 166 [2022-12-06 00:09:16,079 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:09:16,079 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:09:16,079 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:09:16,079 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:09:16,080 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable801 [2022-12-06 00:09:16,080 INFO L420 AbstractCegarLoop]: === Iteration 803 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:09:16,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:09:16,080 INFO L85 PathProgramCache]: Analyzing trace with hash 2100927930, now seen corresponding path program 1 times [2022-12-06 00:09:16,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:09:16,080 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531402393] [2022-12-06 00:09:16,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:09:16,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:09:16,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:09:16,146 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-06 00:09:16,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:09:16,147 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531402393] [2022-12-06 00:09:16,147 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1531402393] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:09:16,147 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:09:16,147 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:09:16,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538198505] [2022-12-06 00:09:16,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:09:16,147 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:09:16,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:09:16,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:09:16,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:09:16,147 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:09:16,147 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:09:16,148 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:09:16,148 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:09:16,148 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:09:16,407 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:09:16,408 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:09:16,412 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13555 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:09:16,419 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:09:16,419 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:09:16,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:09:16,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:09:16,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:09:16,419 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:09:16,419 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:09:16,419 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:09:16,451 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:09:16,452 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:16,452 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:09:16,452 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:09:16,452 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:09:16,452 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:16,453 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:09:16,453 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:09:16,453 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:16,453 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:16,477 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:09:16,477 INFO L131 PetriNetUnfolder]: For 3310/3519 co-relation queries the response was YES. [2022-12-06 00:09:16,478 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3310/3519 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2976 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:09:16,480 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:16,480 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:09:16,627 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:09:16,627 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 175 [2022-12-06 00:09:16,627 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:09:16,627 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:09:16,627 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:09:16,627 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:09:16,627 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable802 [2022-12-06 00:09:16,627 INFO L420 AbstractCegarLoop]: === Iteration 804 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:09:16,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:09:16,628 INFO L85 PathProgramCache]: Analyzing trace with hash -451229031, now seen corresponding path program 1 times [2022-12-06 00:09:16,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:09:16,628 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685246652] [2022-12-06 00:09:16,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:09:16,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:09:16,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:09:16,687 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-06 00:09:16,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:09:16,687 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685246652] [2022-12-06 00:09:16,687 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [685246652] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:09:16,687 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:09:16,687 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:09:16,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353551905] [2022-12-06 00:09:16,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:09:16,687 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:09:16,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:09:16,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:09:16,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:09:16,688 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:09:16,688 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:09:16,688 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:09:16,688 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:09:16,688 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:09:16,961 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:09:16,961 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 00:09:16,966 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13569 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:09:16,972 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:09:16,972 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:09:16,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:09:16,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:09:16,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:09:16,973 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:09:16,973 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:09:16,973 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:09:17,006 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:09:17,007 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:17,007 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:09:17,007 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:09:17,007 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:09:17,007 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:17,008 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:09:17,008 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:09:17,008 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:17,008 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:17,033 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:09:17,033 INFO L131 PetriNetUnfolder]: For 3310/3519 co-relation queries the response was YES. [2022-12-06 00:09:17,034 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3310/3519 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2976 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:09:17,036 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:17,036 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:09:17,175 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:09:17,175 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 168 [2022-12-06 00:09:17,175 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:09:17,175 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:09:17,176 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:09:17,176 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:09:17,176 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable803 [2022-12-06 00:09:17,176 INFO L420 AbstractCegarLoop]: === Iteration 805 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:09:17,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:09:17,176 INFO L85 PathProgramCache]: Analyzing trace with hash 1291581304, now seen corresponding path program 1 times [2022-12-06 00:09:17,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:09:17,176 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351020665] [2022-12-06 00:09:17,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:09:17,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:09:17,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:09:17,235 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-06 00:09:17,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:09:17,235 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351020665] [2022-12-06 00:09:17,235 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1351020665] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:09:17,235 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:09:17,235 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:09:17,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837005252] [2022-12-06 00:09:17,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:09:17,236 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:09:17,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:09:17,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:09:17,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:09:17,236 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:09:17,236 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:09:17,236 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:09:17,236 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:09:17,236 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:09:17,511 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:09:17,511 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 00:09:17,517 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13572 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:09:17,524 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:09:17,525 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:09:17,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:09:17,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:09:17,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:09:17,525 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:09:17,525 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:09:17,525 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:09:17,561 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:09:17,562 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:17,562 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:09:17,563 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:09:17,563 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:09:17,563 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:17,563 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:09:17,563 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:09:17,563 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:17,564 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:17,588 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:09:17,588 INFO L131 PetriNetUnfolder]: For 3327/3536 co-relation queries the response was YES. [2022-12-06 00:09:17,589 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3327/3536 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2973 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:09:17,591 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:17,591 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:09:17,741 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:09:17,742 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 179 [2022-12-06 00:09:17,742 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:09:17,742 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:09:17,742 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:09:17,742 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:09:17,742 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable804 [2022-12-06 00:09:17,742 INFO L420 AbstractCegarLoop]: === Iteration 806 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:09:17,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:09:17,742 INFO L85 PathProgramCache]: Analyzing trace with hash -1260575657, now seen corresponding path program 1 times [2022-12-06 00:09:17,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:09:17,742 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104834445] [2022-12-06 00:09:17,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:09:17,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:09:17,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:09:17,812 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-06 00:09:17,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:09:17,812 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104834445] [2022-12-06 00:09:17,812 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2104834445] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:09:17,812 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:09:17,812 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:09:17,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884796880] [2022-12-06 00:09:17,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:09:17,812 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:09:17,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:09:17,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:09:17,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:09:17,813 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:09:17,813 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:09:17,813 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:09:17,813 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:09:17,813 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:09:18,082 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:09:18,082 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 00:09:18,087 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13565 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:09:18,094 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:09:18,094 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:09:18,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:09:18,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:09:18,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:09:18,094 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:09:18,094 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:09:18,094 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:09:18,126 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:09:18,127 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:18,127 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:09:18,127 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:09:18,128 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:09:18,128 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:18,128 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:09:18,128 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:09:18,128 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:18,129 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:18,152 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:09:18,153 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 00:09:18,153 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3312/3520 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2973 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:09:18,155 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:18,155 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:09:18,308 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:09:18,308 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 180 [2022-12-06 00:09:18,308 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:09:18,308 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:09:18,308 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:09:18,308 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:09:18,309 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable805 [2022-12-06 00:09:18,309 INFO L420 AbstractCegarLoop]: === Iteration 807 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:09:18,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:09:18,309 INFO L85 PathProgramCache]: Analyzing trace with hash 482234678, now seen corresponding path program 1 times [2022-12-06 00:09:18,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:09:18,309 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713088678] [2022-12-06 00:09:18,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:09:18,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:09:18,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:09:18,375 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-06 00:09:18,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:09:18,375 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713088678] [2022-12-06 00:09:18,375 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [713088678] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:09:18,376 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:09:18,376 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:09:18,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017636489] [2022-12-06 00:09:18,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:09:18,376 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:09:18,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:09:18,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:09:18,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:09:18,376 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:09:18,376 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:09:18,376 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:09:18,376 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:09:18,376 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:09:18,639 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:09:18,639 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:09:18,644 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13560 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:09:18,651 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:09:18,652 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:09:18,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:09:18,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:09:18,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:09:18,652 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:09:18,652 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:09:18,652 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:09:18,685 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:09:18,686 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:18,686 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:09:18,687 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:09:18,687 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:09:18,687 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:18,687 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:09:18,687 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:09:18,687 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:18,688 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:18,711 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:09:18,711 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 00:09:18,712 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3321/3530 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2992 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:09:18,714 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:18,714 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:09:18,862 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:09:18,862 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 175 [2022-12-06 00:09:18,863 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:09:18,863 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:09:18,863 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:09:18,863 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:09:18,863 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable806 [2022-12-06 00:09:18,863 INFO L420 AbstractCegarLoop]: === Iteration 808 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:09:18,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:09:18,863 INFO L85 PathProgramCache]: Analyzing trace with hash -2069922283, now seen corresponding path program 1 times [2022-12-06 00:09:18,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:09:18,863 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913052108] [2022-12-06 00:09:18,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:09:18,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:09:18,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:09:18,948 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-06 00:09:18,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:09:18,948 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913052108] [2022-12-06 00:09:18,948 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1913052108] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:09:18,948 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:09:18,948 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:09:18,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022799335] [2022-12-06 00:09:18,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:09:18,949 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:09:18,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:09:18,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:09:18,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:09:18,949 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:09:18,949 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:09:18,949 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:09:18,949 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:09:18,949 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:09:19,225 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:09:19,225 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:09:19,230 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13556 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:09:19,237 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:09:19,237 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:09:19,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:09:19,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:09:19,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:09:19,237 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:09:19,237 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:09:19,237 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:09:19,269 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:09:19,270 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:19,270 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:09:19,270 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:09:19,270 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:09:19,270 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:19,270 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:09:19,270 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:09:19,271 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:19,271 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:19,295 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:09:19,295 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 00:09:19,296 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3312/3520 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 3001 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:09:19,298 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:19,298 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:09:19,458 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:09:19,458 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 188 [2022-12-06 00:09:19,458 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:09:19,458 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:09:19,458 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:09:19,459 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:09:19,459 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable807 [2022-12-06 00:09:19,459 INFO L420 AbstractCegarLoop]: === Iteration 809 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:09:19,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:09:19,459 INFO L85 PathProgramCache]: Analyzing trace with hash -327111948, now seen corresponding path program 1 times [2022-12-06 00:09:19,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:09:19,459 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945070605] [2022-12-06 00:09:19,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:09:19,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:09:19,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:09:19,517 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-06 00:09:19,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:09:19,517 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945070605] [2022-12-06 00:09:19,517 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1945070605] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:09:19,517 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:09:19,518 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:09:19,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866013367] [2022-12-06 00:09:19,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:09:19,518 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:09:19,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:09:19,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:09:19,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:09:19,518 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:09:19,518 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:09:19,518 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:09:19,518 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:09:19,518 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:09:19,870 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:09:19,871 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 00:09:19,877 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26969/27014 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13554 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:09:19,885 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:09:19,885 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:09:19,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:09:19,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:09:19,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:09:19,886 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:09:19,886 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:09:19,886 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:09:19,926 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:09:19,928 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:19,928 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:09:19,928 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:09:19,928 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:09:19,928 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:19,929 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:09:19,929 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:09:19,929 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:19,929 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:19,960 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:09:19,960 INFO L131 PetriNetUnfolder]: For 3146/3287 co-relation queries the response was YES. [2022-12-06 00:09:19,961 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3146/3287 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2968 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:09:19,964 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:19,964 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:09:20,202 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:09:20,202 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 274 [2022-12-06 00:09:20,202 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:09:20,203 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:09:20,203 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:09:20,203 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:09:20,203 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable808 [2022-12-06 00:09:20,203 INFO L420 AbstractCegarLoop]: === Iteration 810 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:09:20,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:09:20,203 INFO L85 PathProgramCache]: Analyzing trace with hash 1415698387, now seen corresponding path program 1 times [2022-12-06 00:09:20,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:09:20,203 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246152692] [2022-12-06 00:09:20,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:09:20,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:09:20,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:09:20,286 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-06 00:09:20,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:09:20,287 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246152692] [2022-12-06 00:09:20,287 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1246152692] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:09:20,287 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:09:20,287 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:09:20,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007743781] [2022-12-06 00:09:20,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:09:20,287 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:09:20,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:09:20,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:09:20,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:09:20,288 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:09:20,288 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:09:20,288 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:09:20,288 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:09:20,288 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:09:20,640 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:09:20,641 INFO L131 PetriNetUnfolder]: For 27229/27274 co-relation queries the response was YES. [2022-12-06 00:09:20,648 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27229/27274 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13562 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:09:20,657 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:09:20,657 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:09:20,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:09:20,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:09:20,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:09:20,658 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:09:20,658 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:09:20,658 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:09:20,703 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:09:20,704 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:20,704 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:09:20,704 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:09:20,705 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:09:20,705 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:20,705 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:09:20,705 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:09:20,705 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:20,706 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:20,738 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:09:20,739 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 00:09:20,740 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3312/3520 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2979 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:09:20,743 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:20,743 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:09:20,919 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:09:20,919 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 214 [2022-12-06 00:09:20,919 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:09:20,919 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:09:20,919 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:09:20,920 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:09:20,920 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable809 [2022-12-06 00:09:20,920 INFO L420 AbstractCegarLoop]: === Iteration 811 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:09:20,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:09:20,920 INFO L85 PathProgramCache]: Analyzing trace with hash -1136458574, now seen corresponding path program 1 times [2022-12-06 00:09:20,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:09:20,920 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242714394] [2022-12-06 00:09:20,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:09:20,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:09:20,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:09:21,002 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-06 00:09:21,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:09:21,003 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242714394] [2022-12-06 00:09:21,003 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [242714394] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:09:21,003 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:09:21,003 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:09:21,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154975684] [2022-12-06 00:09:21,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:09:21,003 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:09:21,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:09:21,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:09:21,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:09:21,004 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:09:21,004 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:09:21,004 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:09:21,004 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:09:21,004 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:09:21,359 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:09:21,359 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:09:21,367 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13557 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:09:21,377 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:09:21,377 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:09:21,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:09:21,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:09:21,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:09:21,378 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:09:21,378 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:09:21,378 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:09:21,427 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:09:21,429 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:21,429 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:09:21,429 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:09:21,429 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:09:21,429 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:21,430 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:09:21,430 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:09:21,430 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:21,430 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:21,463 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:09:21,463 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 00:09:21,464 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3321/3530 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2983 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:09:21,467 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:21,467 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:09:21,638 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:09:21,638 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 209 [2022-12-06 00:09:21,638 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:09:21,639 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:09:21,639 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:09:21,639 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:09:21,639 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable810 [2022-12-06 00:09:21,639 INFO L420 AbstractCegarLoop]: === Iteration 812 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:09:21,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:09:21,639 INFO L85 PathProgramCache]: Analyzing trace with hash 606351761, now seen corresponding path program 1 times [2022-12-06 00:09:21,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:09:21,639 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646662341] [2022-12-06 00:09:21,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:09:21,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:09:21,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:09:21,731 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-06 00:09:21,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:09:21,731 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646662341] [2022-12-06 00:09:21,732 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [646662341] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:09:21,732 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:09:21,732 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:09:21,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035736651] [2022-12-06 00:09:21,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:09:21,732 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:09:21,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:09:21,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:09:21,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:09:21,732 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:09:21,732 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:09:21,733 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:09:21,733 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:09:21,733 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:09:22,072 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:09:22,072 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 00:09:22,079 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26965/27010 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13518 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:09:22,088 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:09:22,088 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:09:22,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:09:22,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:09:22,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:09:22,089 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:09:22,089 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:09:22,089 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:09:22,137 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:09:22,138 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:22,138 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:09:22,138 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:09:22,138 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:09:22,139 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:22,139 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:09:22,139 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:09:22,139 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:22,140 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:22,172 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:09:22,172 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 00:09:22,173 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3133/3273 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2969 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:09:22,176 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:22,176 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:09:22,356 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:09:22,357 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 219 [2022-12-06 00:09:22,357 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:09:22,357 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:09:22,357 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:09:22,357 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:09:22,357 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable811 [2022-12-06 00:09:22,357 INFO L420 AbstractCegarLoop]: === Iteration 813 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:09:22,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:09:22,357 INFO L85 PathProgramCache]: Analyzing trace with hash -1945805200, now seen corresponding path program 1 times [2022-12-06 00:09:22,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:09:22,357 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148018142] [2022-12-06 00:09:22,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:09:22,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:09:22,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:09:22,433 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-06 00:09:22,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:09:22,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148018142] [2022-12-06 00:09:22,433 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [148018142] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:09:22,433 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:09:22,433 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:09:22,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174185413] [2022-12-06 00:09:22,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:09:22,434 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:09:22,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:09:22,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:09:22,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:09:22,434 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:09:22,434 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:09:22,434 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:09:22,434 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:09:22,434 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:09:22,779 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:09:22,779 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:09:22,786 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13556 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:09:22,796 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:09:22,797 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:09:22,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:09:22,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:09:22,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:09:22,798 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:09:22,798 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:09:22,798 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:09:22,845 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:09:22,847 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:22,847 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:09:22,847 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:09:22,847 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:09:22,847 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:22,848 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:09:22,848 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:09:22,848 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:22,849 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:22,881 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:09:22,881 INFO L131 PetriNetUnfolder]: For 3337/3547 co-relation queries the response was YES. [2022-12-06 00:09:22,883 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3337/3547 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2984 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:09:22,885 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:22,885 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:09:23,067 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:09:23,067 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 220 [2022-12-06 00:09:23,067 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:09:23,067 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:09:23,067 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:09:23,067 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:09:23,068 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable812 [2022-12-06 00:09:23,068 INFO L420 AbstractCegarLoop]: === Iteration 814 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:09:23,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:09:23,068 INFO L85 PathProgramCache]: Analyzing trace with hash -202994865, now seen corresponding path program 1 times [2022-12-06 00:09:23,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:09:23,068 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395120612] [2022-12-06 00:09:23,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:09:23,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:09:23,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:09:23,158 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-06 00:09:23,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:09:23,158 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395120612] [2022-12-06 00:09:23,158 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1395120612] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:09:23,158 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:09:23,158 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:09:23,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431842865] [2022-12-06 00:09:23,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:09:23,159 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:09:23,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:09:23,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:09:23,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:09:23,159 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:09:23,159 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:09:23,159 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:09:23,160 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:09:23,160 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:09:23,575 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:09:23,576 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 00:09:23,582 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13560 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:09:23,590 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:09:23,590 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:09:23,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:09:23,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:09:23,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:09:23,591 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:09:23,591 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:09:23,591 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:09:23,636 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:09:23,637 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:23,638 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:09:23,638 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:09:23,638 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:09:23,638 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:23,638 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:09:23,638 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:09:23,639 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:23,639 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:23,672 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:09:23,672 INFO L131 PetriNetUnfolder]: For 3304/3511 co-relation queries the response was YES. [2022-12-06 00:09:23,674 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3304/3511 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2996 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:09:23,677 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:23,677 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:09:23,855 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:09:23,856 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 218 [2022-12-06 00:09:23,856 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:09:23,856 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:09:23,856 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:09:23,856 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:09:23,856 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable813 [2022-12-06 00:09:23,856 INFO L420 AbstractCegarLoop]: === Iteration 815 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:09:23,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:09:23,857 INFO L85 PathProgramCache]: Analyzing trace with hash 1539815470, now seen corresponding path program 1 times [2022-12-06 00:09:23,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:09:23,857 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30495331] [2022-12-06 00:09:23,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:09:23,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:09:23,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:09:23,941 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-06 00:09:23,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:09:23,942 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30495331] [2022-12-06 00:09:23,942 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [30495331] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:09:23,942 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:09:23,942 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:09:23,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581940866] [2022-12-06 00:09:23,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:09:23,942 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:09:23,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:09:23,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:09:23,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:09:23,943 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:09:23,943 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:09:23,943 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:09:23,943 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:09:23,943 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:09:24,295 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:09:24,295 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 00:09:24,302 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26969/27014 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13542 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:09:24,312 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:09:24,312 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:09:24,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:09:24,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:09:24,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:09:24,313 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:09:24,313 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:09:24,313 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:09:24,360 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:09:24,362 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:24,362 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:09:24,362 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:09:24,362 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:09:24,362 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:24,363 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:09:24,363 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:09:24,363 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:24,364 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:24,395 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:09:24,396 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 00:09:24,397 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3133/3273 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2959 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:09:24,399 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:24,399 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:09:24,570 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:09:24,571 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 209 [2022-12-06 00:09:24,571 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:09:24,571 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:09:24,571 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:09:24,571 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:09:24,571 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable814 [2022-12-06 00:09:24,571 INFO L420 AbstractCegarLoop]: === Iteration 816 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:09:24,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:09:24,572 INFO L85 PathProgramCache]: Analyzing trace with hash -1012341491, now seen corresponding path program 1 times [2022-12-06 00:09:24,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:09:24,572 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303519077] [2022-12-06 00:09:24,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:09:24,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:09:24,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:09:24,645 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-06 00:09:24,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:09:24,645 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303519077] [2022-12-06 00:09:24,645 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [303519077] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:09:24,645 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:09:24,645 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:09:24,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484721075] [2022-12-06 00:09:24,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:09:24,645 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:09:24,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:09:24,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:09:24,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:09:24,646 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:09:24,646 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:09:24,646 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:09:24,646 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:09:24,646 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:09:24,991 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:09:24,991 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 00:09:24,998 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26969/27014 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13527 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:09:25,009 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:09:25,009 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:09:25,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:09:25,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:09:25,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:09:25,010 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:09:25,010 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:09:25,010 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:09:25,061 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:09:25,062 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:25,063 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:09:25,063 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:09:25,063 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:09:25,063 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:25,063 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:09:25,064 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:09:25,064 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:25,064 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:25,098 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:09:25,098 INFO L131 PetriNetUnfolder]: For 3122/3262 co-relation queries the response was YES. [2022-12-06 00:09:25,099 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3122/3262 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2967 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:09:25,102 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:25,102 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:09:25,291 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:09:25,292 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 229 [2022-12-06 00:09:25,292 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:09:25,292 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:09:25,292 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:09:25,292 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:09:25,292 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable815 [2022-12-06 00:09:25,292 INFO L420 AbstractCegarLoop]: === Iteration 817 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:09:25,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:09:25,293 INFO L85 PathProgramCache]: Analyzing trace with hash 730468844, now seen corresponding path program 1 times [2022-12-06 00:09:25,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:09:25,293 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259715473] [2022-12-06 00:09:25,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:09:25,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:09:25,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:09:25,404 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-06 00:09:25,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:09:25,404 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259715473] [2022-12-06 00:09:25,404 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1259715473] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:09:25,404 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:09:25,405 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:09:25,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026613350] [2022-12-06 00:09:25,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:09:25,405 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:09:25,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:09:25,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:09:25,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:09:25,405 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:09:25,405 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:09:25,405 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:09:25,405 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:09:25,406 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:09:25,751 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:09:25,752 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 00:09:25,759 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26969/27014 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13553 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:09:25,768 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:09:25,768 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:09:25,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:09:25,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:09:25,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:09:25,769 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:09:25,769 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:09:25,769 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:09:25,818 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:09:25,820 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:25,820 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:09:25,820 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:09:25,820 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:09:25,820 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:25,821 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:09:25,821 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:09:25,821 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:25,822 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:25,852 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:09:25,853 INFO L131 PetriNetUnfolder]: For 3151/3294 co-relation queries the response was YES. [2022-12-06 00:09:25,854 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3151/3294 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2979 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:09:25,857 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:25,857 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:09:26,038 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:09:26,038 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 218 [2022-12-06 00:09:26,038 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:09:26,038 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:09:26,038 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:09:26,038 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:09:26,039 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable816 [2022-12-06 00:09:26,039 INFO L420 AbstractCegarLoop]: === Iteration 818 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:09:26,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:09:26,039 INFO L85 PathProgramCache]: Analyzing trace with hash -1821688117, now seen corresponding path program 1 times [2022-12-06 00:09:26,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:09:26,039 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331385221] [2022-12-06 00:09:26,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:09:26,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:09:26,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:09:26,123 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-06 00:09:26,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:09:26,123 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331385221] [2022-12-06 00:09:26,123 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [331385221] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:09:26,123 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:09:26,123 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:09:26,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777099771] [2022-12-06 00:09:26,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:09:26,124 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:09:26,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:09:26,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:09:26,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:09:26,124 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:09:26,124 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:09:26,124 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:09:26,124 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:09:26,124 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:09:26,496 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:09:26,496 INFO L131 PetriNetUnfolder]: For 27229/27274 co-relation queries the response was YES. [2022-12-06 00:09:26,503 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27229/27274 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13567 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:09:26,512 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:09:26,512 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:09:26,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:09:26,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:09:26,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:09:26,513 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:09:26,513 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:09:26,513 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:09:26,556 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:09:26,557 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:26,557 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:09:26,557 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:09:26,557 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:09:26,558 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:26,558 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:09:26,558 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:09:26,558 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:26,559 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:26,589 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:09:26,589 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 00:09:26,591 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3312/3520 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2986 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:09:26,593 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:26,593 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:09:26,769 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:09:26,769 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 212 [2022-12-06 00:09:26,769 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:09:26,769 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:09:26,769 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:09:26,769 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:09:26,769 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable817 [2022-12-06 00:09:26,769 INFO L420 AbstractCegarLoop]: === Iteration 819 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:09:26,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:09:26,770 INFO L85 PathProgramCache]: Analyzing trace with hash -78877782, now seen corresponding path program 1 times [2022-12-06 00:09:26,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:09:26,770 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508430094] [2022-12-06 00:09:26,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:09:26,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:09:26,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:09:26,852 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-06 00:09:26,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:09:26,853 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508430094] [2022-12-06 00:09:26,853 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [508430094] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:09:26,853 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:09:26,853 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:09:26,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405660287] [2022-12-06 00:09:26,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:09:26,853 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:09:26,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:09:26,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:09:26,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:09:26,854 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:09:26,854 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:09:26,854 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:09:26,854 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:09:26,854 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:09:27,261 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:09:27,261 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:09:27,268 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13557 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:09:27,276 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:09:27,276 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:09:27,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:09:27,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:09:27,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:09:27,277 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:09:27,277 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:09:27,277 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:09:27,315 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:09:27,317 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:27,317 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:09:27,317 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:09:27,317 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:09:27,317 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:27,318 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:09:27,318 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:09:27,318 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:27,318 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:27,349 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:09:27,349 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 00:09:27,350 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3312/3520 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2977 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:09:27,353 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:27,353 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:09:27,624 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:09:27,625 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 308 [2022-12-06 00:09:27,625 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:09:27,625 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:09:27,625 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:09:27,625 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:09:27,625 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable818 [2022-12-06 00:09:27,625 INFO L420 AbstractCegarLoop]: === Iteration 820 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:09:27,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:09:27,625 INFO L85 PathProgramCache]: Analyzing trace with hash 1663932553, now seen corresponding path program 1 times [2022-12-06 00:09:27,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:09:27,626 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191097975] [2022-12-06 00:09:27,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:09:27,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:09:27,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:09:27,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:09:27,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:09:27,714 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191097975] [2022-12-06 00:09:27,714 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [191097975] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:09:27,714 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:09:27,715 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:09:27,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380070013] [2022-12-06 00:09:27,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:09:27,715 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:09:27,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:09:27,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:09:27,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:09:27,715 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:09:27,715 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:09:27,715 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:09:27,716 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:09:27,716 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:09:28,101 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:09:28,101 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 00:09:28,109 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26969/27014 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13528 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:09:28,119 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:09:28,119 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:09:28,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:09:28,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:09:28,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:09:28,120 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:09:28,120 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:09:28,120 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:09:28,164 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:09:28,166 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:28,166 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:09:28,166 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:09:28,166 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:09:28,166 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:28,167 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:09:28,167 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:09:28,167 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:28,168 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:28,199 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:09:28,199 INFO L131 PetriNetUnfolder]: For 3134/3275 co-relation queries the response was YES. [2022-12-06 00:09:28,200 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3134/3275 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2984 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:09:28,203 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:28,203 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:09:28,390 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:09:28,391 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 225 [2022-12-06 00:09:28,391 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:09:28,391 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:09:28,391 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:09:28,391 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:09:28,391 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable819 [2022-12-06 00:09:28,391 INFO L420 AbstractCegarLoop]: === Iteration 821 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:09:28,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:09:28,391 INFO L85 PathProgramCache]: Analyzing trace with hash -888224408, now seen corresponding path program 1 times [2022-12-06 00:09:28,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:09:28,392 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017193342] [2022-12-06 00:09:28,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:09:28,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:09:28,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:09:28,467 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-06 00:09:28,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:09:28,467 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017193342] [2022-12-06 00:09:28,467 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1017193342] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:09:28,467 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:09:28,468 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:09:28,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859866193] [2022-12-06 00:09:28,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:09:28,468 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:09:28,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:09:28,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:09:28,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:09:28,468 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:09:28,469 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:09:28,469 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:09:28,469 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:09:28,469 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:09:28,841 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:09:28,841 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:09:28,849 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13547 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:09:28,862 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:09:28,862 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:09:28,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:09:28,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:09:28,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:09:28,863 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:09:28,863 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:09:28,863 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:09:28,909 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:09:28,910 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:28,910 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:09:28,911 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:09:28,911 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:09:28,911 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:28,911 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:09:28,911 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:09:28,912 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:28,912 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:28,944 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:09:28,944 INFO L131 PetriNetUnfolder]: For 3348/3558 co-relation queries the response was YES. [2022-12-06 00:09:28,945 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3348/3558 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2979 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:09:28,948 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:28,948 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:09:29,142 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:09:29,143 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 232 [2022-12-06 00:09:29,143 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:09:29,143 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:09:29,143 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:09:29,143 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:09:29,143 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable820 [2022-12-06 00:09:29,143 INFO L420 AbstractCegarLoop]: === Iteration 822 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:09:29,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:09:29,144 INFO L85 PathProgramCache]: Analyzing trace with hash 854585927, now seen corresponding path program 1 times [2022-12-06 00:09:29,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:09:29,144 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666552292] [2022-12-06 00:09:29,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:09:29,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:09:29,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:09:29,218 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-06 00:09:29,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:09:29,219 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666552292] [2022-12-06 00:09:29,219 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1666552292] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:09:29,219 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:09:29,219 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:09:29,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225072592] [2022-12-06 00:09:29,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:09:29,219 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:09:29,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:09:29,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:09:29,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:09:29,220 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:09:29,220 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:09:29,220 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:09:29,220 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:09:29,220 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:09:29,607 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:09:29,608 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 00:09:29,616 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26965/27010 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13516 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:09:29,626 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:09:29,626 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:09:29,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:09:29,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:09:29,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:09:29,627 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:09:29,627 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:09:29,627 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:09:29,676 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:09:29,678 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:29,678 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:09:29,678 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:09:29,678 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:09:29,678 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:29,679 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:09:29,679 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:09:29,679 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:29,680 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:29,714 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:09:29,715 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 00:09:29,717 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3133/3273 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2977 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:09:29,719 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:29,720 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:09:29,920 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:09:29,921 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 243 [2022-12-06 00:09:29,921 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:09:29,921 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:09:29,921 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:09:29,921 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:09:29,921 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable821 [2022-12-06 00:09:29,921 INFO L420 AbstractCegarLoop]: === Iteration 823 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:09:29,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:09:29,922 INFO L85 PathProgramCache]: Analyzing trace with hash -1697571034, now seen corresponding path program 1 times [2022-12-06 00:09:29,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:09:29,922 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350470798] [2022-12-06 00:09:29,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:09:29,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:09:29,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:09:29,999 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-06 00:09:29,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:09:29,999 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350470798] [2022-12-06 00:09:30,000 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [350470798] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:09:30,000 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:09:30,000 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:09:30,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275371593] [2022-12-06 00:09:30,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:09:30,000 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:09:30,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:09:30,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:09:30,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:09:30,000 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:09:30,001 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:09:30,001 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:09:30,001 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:09:30,001 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:09:30,364 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:09:30,365 INFO L131 PetriNetUnfolder]: For 27146/27191 co-relation queries the response was YES. [2022-12-06 00:09:30,373 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27146/27191 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13537 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:09:30,383 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:09:30,383 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:09:30,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:09:30,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:09:30,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:09:30,384 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:09:30,384 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:09:30,384 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:09:30,432 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:09:30,433 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:30,433 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:09:30,434 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:09:30,434 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:09:30,434 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:30,434 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:09:30,434 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:09:30,434 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:30,435 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:30,469 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:09:30,470 INFO L131 PetriNetUnfolder]: For 3167/3307 co-relation queries the response was YES. [2022-12-06 00:09:30,471 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3167/3307 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 3007 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:09:30,474 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:30,475 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:09:30,653 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:09:30,654 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 220 [2022-12-06 00:09:30,654 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:09:30,654 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:09:30,654 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:09:30,654 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:09:30,654 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable822 [2022-12-06 00:09:30,654 INFO L420 AbstractCegarLoop]: === Iteration 824 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:09:30,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:09:30,655 INFO L85 PathProgramCache]: Analyzing trace with hash 45239301, now seen corresponding path program 1 times [2022-12-06 00:09:30,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:09:30,655 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196022001] [2022-12-06 00:09:30,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:09:30,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:09:30,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:09:30,729 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-06 00:09:30,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:09:30,729 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196022001] [2022-12-06 00:09:30,729 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1196022001] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:09:30,729 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:09:30,730 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:09:30,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643918436] [2022-12-06 00:09:30,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:09:30,730 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:09:30,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:09:30,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:09:30,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:09:30,730 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:09:30,730 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:09:30,730 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:09:30,731 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:09:30,731 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:09:31,085 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:09:31,085 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 00:09:31,093 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26965/27010 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13518 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:09:31,138 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:09:31,139 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:09:31,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:09:31,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:09:31,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:09:31,140 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:09:31,140 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:09:31,140 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:09:31,184 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:09:31,186 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:31,186 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:09:31,186 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:09:31,186 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:09:31,186 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:31,187 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:09:31,187 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:09:31,187 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:31,188 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:31,222 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:09:31,223 INFO L131 PetriNetUnfolder]: For 3122/3262 co-relation queries the response was YES. [2022-12-06 00:09:31,224 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3122/3262 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2970 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:09:31,228 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:31,228 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:09:31,405 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:09:31,406 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 220 [2022-12-06 00:09:31,406 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:09:31,406 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:09:31,406 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:09:31,406 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:09:31,406 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable823 [2022-12-06 00:09:31,406 INFO L420 AbstractCegarLoop]: === Iteration 825 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:09:31,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:09:31,406 INFO L85 PathProgramCache]: Analyzing trace with hash 1788049636, now seen corresponding path program 1 times [2022-12-06 00:09:31,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:09:31,406 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018957472] [2022-12-06 00:09:31,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:09:31,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:09:31,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:09:31,492 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-06 00:09:31,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:09:31,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018957472] [2022-12-06 00:09:31,492 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1018957472] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:09:31,493 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:09:31,493 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:09:31,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835242406] [2022-12-06 00:09:31,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:09:31,493 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:09:31,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:09:31,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:09:31,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:09:31,493 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:09:31,493 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:09:31,493 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:09:31,494 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:09:31,494 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:09:31,874 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:09:31,874 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 00:09:31,883 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13557 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:09:31,893 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:09:31,893 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:09:31,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:09:31,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:09:31,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:09:31,894 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:09:31,894 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:09:31,894 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:09:31,945 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:09:31,946 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:31,946 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:09:31,947 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:09:31,947 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:09:31,947 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:31,947 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:09:31,947 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:09:31,947 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:31,948 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:31,984 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:09:31,984 INFO L131 PetriNetUnfolder]: For 3348/3558 co-relation queries the response was YES. [2022-12-06 00:09:31,986 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3348/3558 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2993 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:09:31,988 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:31,989 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:09:32,166 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:09:32,166 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 219 [2022-12-06 00:09:32,166 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:09:32,166 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:09:32,167 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:09:32,167 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:09:32,167 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable824 [2022-12-06 00:09:32,167 INFO L420 AbstractCegarLoop]: === Iteration 826 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:09:32,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:09:32,167 INFO L85 PathProgramCache]: Analyzing trace with hash -764107325, now seen corresponding path program 1 times [2022-12-06 00:09:32,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:09:32,167 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783904607] [2022-12-06 00:09:32,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:09:32,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:09:32,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:09:32,244 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-06 00:09:32,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:09:32,245 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783904607] [2022-12-06 00:09:32,245 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [783904607] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:09:32,245 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:09:32,245 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:09:32,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981967329] [2022-12-06 00:09:32,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:09:32,245 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:09:32,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:09:32,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:09:32,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:09:32,246 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:09:32,246 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:09:32,246 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:09:32,246 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:09:32,246 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:09:32,592 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:09:32,592 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:09:32,600 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13576 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:09:32,610 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:09:32,610 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:09:32,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:09:32,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:09:32,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:09:32,611 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:09:32,611 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:09:32,611 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:09:32,655 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:09:32,657 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:32,657 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:09:32,657 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:09:32,657 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:09:32,657 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:32,658 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:09:32,658 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:09:32,658 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:32,659 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:32,690 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:09:32,690 INFO L131 PetriNetUnfolder]: For 3309/3518 co-relation queries the response was YES. [2022-12-06 00:09:32,692 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3309/3518 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2983 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:09:32,694 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:32,694 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:09:32,887 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:09:32,887 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 230 [2022-12-06 00:09:32,887 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:09:32,888 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:09:32,888 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:09:32,888 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:09:32,888 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable825 [2022-12-06 00:09:32,888 INFO L420 AbstractCegarLoop]: === Iteration 827 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:09:32,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:09:32,888 INFO L85 PathProgramCache]: Analyzing trace with hash 978703010, now seen corresponding path program 1 times [2022-12-06 00:09:32,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:09:32,888 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667659840] [2022-12-06 00:09:32,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:09:32,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:09:32,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:09:32,972 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-06 00:09:32,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:09:32,973 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667659840] [2022-12-06 00:09:32,973 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1667659840] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:09:32,973 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:09:32,973 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:09:32,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024484798] [2022-12-06 00:09:32,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:09:32,973 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:09:32,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:09:32,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:09:32,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:09:32,973 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:09:32,974 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:09:32,974 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:09:32,974 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:09:32,974 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:09:33,342 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:09:33,342 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:09:33,349 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13571 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:09:33,358 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:09:33,358 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:09:33,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:09:33,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:09:33,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:09:33,359 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:09:33,359 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:09:33,359 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:09:33,402 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:09:33,404 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:33,404 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:09:33,404 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:09:33,404 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:09:33,404 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:33,405 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:09:33,405 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:09:33,405 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:33,406 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:33,436 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:09:33,436 INFO L131 PetriNetUnfolder]: For 3307/3517 co-relation queries the response was YES. [2022-12-06 00:09:33,438 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3307/3517 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2975 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:09:33,440 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:33,440 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:09:33,620 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:09:33,620 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 216 [2022-12-06 00:09:33,620 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:09:33,620 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:09:33,621 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:09:33,621 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:09:33,621 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable826 [2022-12-06 00:09:33,621 INFO L420 AbstractCegarLoop]: === Iteration 828 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:09:33,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:09:33,621 INFO L85 PathProgramCache]: Analyzing trace with hash -1573453951, now seen corresponding path program 1 times [2022-12-06 00:09:33,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:09:33,621 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621474375] [2022-12-06 00:09:33,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:09:33,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:09:33,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:09:33,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:09:33,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:09:33,714 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621474375] [2022-12-06 00:09:33,714 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1621474375] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:09:33,714 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:09:33,714 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:09:33,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200759377] [2022-12-06 00:09:33,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:09:33,715 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:09:33,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:09:33,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:09:33,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:09:33,715 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:09:33,715 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:09:33,715 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:09:33,715 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:09:33,715 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:09:34,085 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:09:34,086 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 00:09:34,093 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13571 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:09:34,102 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:09:34,103 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:09:34,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:09:34,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:09:34,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:09:34,103 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:09:34,103 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:09:34,104 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:09:34,150 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:09:34,151 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:34,151 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:09:34,151 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:09:34,151 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:09:34,151 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:34,152 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:09:34,152 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:09:34,152 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:34,153 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:34,184 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:09:34,184 INFO L131 PetriNetUnfolder]: For 3301/3509 co-relation queries the response was YES. [2022-12-06 00:09:34,185 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3301/3509 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2982 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:09:34,188 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:34,188 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:09:34,365 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:09:34,366 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 215 [2022-12-06 00:09:34,366 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:09:34,366 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:09:34,366 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:09:34,366 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:09:34,366 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable827 [2022-12-06 00:09:34,366 INFO L420 AbstractCegarLoop]: === Iteration 829 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:09:34,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:09:34,366 INFO L85 PathProgramCache]: Analyzing trace with hash 169356384, now seen corresponding path program 1 times [2022-12-06 00:09:34,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:09:34,367 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355501911] [2022-12-06 00:09:34,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:09:34,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:09:34,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:09:34,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-06 00:09:34,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:09:34,453 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355501911] [2022-12-06 00:09:34,453 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [355501911] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:09:34,453 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:09:34,453 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:09:34,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071066585] [2022-12-06 00:09:34,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:09:34,453 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:09:34,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:09:34,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:09:34,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:09:34,454 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:09:34,454 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:09:34,454 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:09:34,454 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:09:34,454 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:09:34,854 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:09:34,854 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 00:09:34,862 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13575 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:09:34,871 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:09:34,871 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:09:34,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:09:34,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:09:34,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:09:34,872 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:09:34,872 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:09:34,872 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:09:34,975 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:09:34,977 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:34,977 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:09:34,977 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:09:34,977 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:09:34,977 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:34,978 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:09:34,978 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:09:34,978 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:34,979 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:35,011 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:09:35,011 INFO L131 PetriNetUnfolder]: For 3348/3558 co-relation queries the response was YES. [2022-12-06 00:09:35,012 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3348/3558 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 3012 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:09:35,015 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:35,015 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:09:35,189 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:09:35,190 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 213 [2022-12-06 00:09:35,190 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:09:35,190 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:09:35,190 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:09:35,190 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:09:35,190 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable828 [2022-12-06 00:09:35,190 INFO L420 AbstractCegarLoop]: === Iteration 830 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:09:35,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:09:35,190 INFO L85 PathProgramCache]: Analyzing trace with hash 1912166719, now seen corresponding path program 1 times [2022-12-06 00:09:35,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:09:35,191 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539348421] [2022-12-06 00:09:35,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:09:35,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:09:35,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:09:35,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-06 00:09:35,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:09:35,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539348421] [2022-12-06 00:09:35,270 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1539348421] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:09:35,270 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:09:35,270 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:09:35,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470120098] [2022-12-06 00:09:35,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:09:35,270 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:09:35,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:09:35,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:09:35,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:09:35,271 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:09:35,271 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:09:35,271 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:09:35,271 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:09:35,271 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:09:35,638 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:09:35,638 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:09:35,646 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13571 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:09:35,657 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:09:35,658 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:09:35,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:09:35,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:09:35,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:09:35,659 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:09:35,659 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:09:35,659 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:09:35,712 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:09:35,714 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:35,714 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:09:35,714 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:09:35,714 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:09:35,714 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:35,715 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:09:35,715 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:09:35,715 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:35,716 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:35,746 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:09:35,746 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 00:09:35,747 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3312/3520 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2993 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:09:35,750 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:35,750 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:09:35,929 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:09:35,930 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 216 [2022-12-06 00:09:35,930 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:09:35,930 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:09:35,930 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:09:35,930 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:09:35,930 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable829 [2022-12-06 00:09:35,930 INFO L420 AbstractCegarLoop]: === Iteration 831 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:09:35,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:09:35,931 INFO L85 PathProgramCache]: Analyzing trace with hash -639990242, now seen corresponding path program 1 times [2022-12-06 00:09:35,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:09:35,931 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491817293] [2022-12-06 00:09:35,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:09:35,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:09:35,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:09:36,010 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-06 00:09:36,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:09:36,011 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491817293] [2022-12-06 00:09:36,011 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [491817293] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:09:36,011 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:09:36,011 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:09:36,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817119718] [2022-12-06 00:09:36,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:09:36,011 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:09:36,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:09:36,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:09:36,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:09:36,012 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:09:36,012 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:09:36,012 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:09:36,012 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:09:36,012 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:09:36,371 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:09:36,371 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 00:09:36,378 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26969/27014 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13527 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:09:36,388 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:09:36,389 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:09:36,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:09:36,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:09:36,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:09:36,389 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:09:36,389 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:09:36,390 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:09:36,437 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:09:36,438 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:36,438 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:09:36,438 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:09:36,438 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:09:36,438 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:36,439 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:09:36,439 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:09:36,439 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:36,440 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:36,470 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:09:36,471 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 00:09:36,472 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3133/3273 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2986 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:09:36,475 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:36,475 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:09:36,667 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:09:36,667 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 229 [2022-12-06 00:09:36,667 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:09:36,667 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:09:36,667 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:09:36,668 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:09:36,668 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable830 [2022-12-06 00:09:36,668 INFO L420 AbstractCegarLoop]: === Iteration 832 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:09:36,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:09:36,668 INFO L85 PathProgramCache]: Analyzing trace with hash 1102820093, now seen corresponding path program 1 times [2022-12-06 00:09:36,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:09:36,668 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954463278] [2022-12-06 00:09:36,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:09:36,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:09:36,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:09:36,754 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-06 00:09:36,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:09:36,754 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954463278] [2022-12-06 00:09:36,754 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [954463278] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:09:36,755 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:09:36,755 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:09:36,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359538614] [2022-12-06 00:09:36,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:09:36,755 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:09:36,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:09:36,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:09:36,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:09:36,755 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:09:36,755 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:09:36,755 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:09:36,756 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:09:36,756 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:09:37,185 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:09:37,185 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:09:37,194 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13532 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:09:37,206 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:09:37,206 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:09:37,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:09:37,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:09:37,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:09:37,207 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:09:37,208 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:09:37,208 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:09:37,258 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:09:37,260 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:37,260 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:09:37,260 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:09:37,260 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:09:37,260 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:37,261 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:09:37,261 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:09:37,261 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:37,262 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:37,306 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:09:37,306 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 00:09:37,308 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3321/3530 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2986 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:09:37,311 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:37,311 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:09:37,628 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:09:37,629 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 369 [2022-12-06 00:09:37,629 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:09:37,629 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:09:37,629 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:09:37,629 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:09:37,629 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable831 [2022-12-06 00:09:37,629 INFO L420 AbstractCegarLoop]: === Iteration 833 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:09:37,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:09:37,630 INFO L85 PathProgramCache]: Analyzing trace with hash -1449336868, now seen corresponding path program 1 times [2022-12-06 00:09:37,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:09:37,630 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912117708] [2022-12-06 00:09:37,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:09:37,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:09:37,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:09:37,715 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-06 00:09:37,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:09:37,716 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912117708] [2022-12-06 00:09:37,716 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [912117708] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:09:37,716 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:09:37,716 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:09:37,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189674600] [2022-12-06 00:09:37,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:09:37,716 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:09:37,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:09:37,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:09:37,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:09:37,717 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:09:37,717 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:09:37,717 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:09:37,717 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:09:37,717 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:09:38,075 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:09:38,075 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:09:38,082 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13553 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:09:38,092 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:09:38,092 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:09:38,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:09:38,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:09:38,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:09:38,093 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:09:38,093 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:09:38,093 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:09:38,145 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:09:38,146 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:38,146 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:09:38,147 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:09:38,147 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:09:38,147 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:38,147 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:09:38,148 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:09:38,148 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:38,148 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:38,187 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:09:38,187 INFO L131 PetriNetUnfolder]: For 3348/3558 co-relation queries the response was YES. [2022-12-06 00:09:38,189 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3348/3558 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2986 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:09:38,192 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:38,192 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:09:38,365 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:09:38,366 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 219 [2022-12-06 00:09:38,366 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:09:38,366 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:09:38,366 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:09:38,366 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:09:38,366 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable832 [2022-12-06 00:09:38,366 INFO L420 AbstractCegarLoop]: === Iteration 834 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:09:38,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:09:38,367 INFO L85 PathProgramCache]: Analyzing trace with hash 293473467, now seen corresponding path program 1 times [2022-12-06 00:09:38,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:09:38,367 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995856511] [2022-12-06 00:09:38,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:09:38,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:09:38,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:09:38,451 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-06 00:09:38,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:09:38,451 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995856511] [2022-12-06 00:09:38,451 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1995856511] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:09:38,451 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:09:38,451 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:09:38,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658941999] [2022-12-06 00:09:38,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:09:38,452 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:09:38,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:09:38,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:09:38,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:09:38,452 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:09:38,452 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:09:38,452 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:09:38,452 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:09:38,452 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:09:38,808 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:09:38,809 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:09:38,817 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13575 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:09:38,828 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:09:38,828 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:09:38,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:09:38,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:09:38,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:09:38,829 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:09:38,829 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:09:38,829 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:09:38,877 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:09:38,879 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:38,879 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:09:38,879 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:09:38,879 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:09:38,879 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:38,880 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:09:38,880 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:09:38,880 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:38,881 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:38,913 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:09:38,913 INFO L131 PetriNetUnfolder]: For 3301/3509 co-relation queries the response was YES. [2022-12-06 00:09:38,915 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3301/3509 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2986 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:09:38,917 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:38,917 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:09:39,092 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:09:39,093 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 214 [2022-12-06 00:09:39,093 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:09:39,093 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:09:39,093 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:09:39,093 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:09:39,093 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable833 [2022-12-06 00:09:39,093 INFO L420 AbstractCegarLoop]: === Iteration 835 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:09:39,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:09:39,094 INFO L85 PathProgramCache]: Analyzing trace with hash 2036283802, now seen corresponding path program 1 times [2022-12-06 00:09:39,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:09:39,094 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353164041] [2022-12-06 00:09:39,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:09:39,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:09:39,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:09:39,169 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-06 00:09:39,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:09:39,169 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353164041] [2022-12-06 00:09:39,169 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [353164041] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:09:39,169 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:09:39,169 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:09:39,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844166754] [2022-12-06 00:09:39,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:09:39,170 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:09:39,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:09:39,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:09:39,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:09:39,170 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:09:39,170 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:09:39,170 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:09:39,170 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:09:39,170 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:09:39,532 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:09:39,532 INFO L131 PetriNetUnfolder]: For 27136/27181 co-relation queries the response was YES. [2022-12-06 00:09:39,540 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27136/27181 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13516 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:09:39,548 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:09:39,548 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:09:39,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:09:39,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:09:39,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:09:39,549 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:09:39,549 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:09:39,549 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:09:39,592 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:09:39,593 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:39,593 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:09:39,594 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:09:39,594 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:09:39,594 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:39,594 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:09:39,594 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:09:39,594 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:39,595 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:39,627 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:09:39,628 INFO L131 PetriNetUnfolder]: For 3157/3298 co-relation queries the response was YES. [2022-12-06 00:09:39,629 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3157/3298 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 3013 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:09:39,632 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:39,632 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:09:39,807 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:09:39,808 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 214 [2022-12-06 00:09:39,808 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:09:39,808 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:09:39,808 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:09:39,808 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:09:39,808 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable834 [2022-12-06 00:09:39,808 INFO L420 AbstractCegarLoop]: === Iteration 836 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:09:39,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:09:39,809 INFO L85 PathProgramCache]: Analyzing trace with hash -515873159, now seen corresponding path program 1 times [2022-12-06 00:09:39,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:09:39,809 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752979145] [2022-12-06 00:09:39,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:09:39,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:09:39,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:09:39,890 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-06 00:09:39,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:09:39,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752979145] [2022-12-06 00:09:39,891 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [752979145] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:09:39,891 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:09:39,891 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:09:39,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098411807] [2022-12-06 00:09:39,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:09:39,891 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:09:39,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:09:39,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:09:39,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:09:39,892 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:09:39,892 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:09:39,892 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:09:39,892 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:09:39,892 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:09:40,247 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:09:40,248 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:09:40,255 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13567 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:09:40,266 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:09:40,267 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:09:40,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:09:40,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:09:40,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:09:40,267 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:09:40,267 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:09:40,267 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:09:40,320 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:09:40,322 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:40,322 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:09:40,322 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:09:40,322 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:09:40,322 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:40,323 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:09:40,323 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:09:40,323 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:40,324 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:40,359 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:09:40,359 INFO L131 PetriNetUnfolder]: For 3318/3528 co-relation queries the response was YES. [2022-12-06 00:09:40,361 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3318/3528 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2981 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:09:40,364 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:40,364 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:09:40,556 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:09:40,556 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 234 [2022-12-06 00:09:40,556 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:09:40,557 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:09:40,557 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:09:40,557 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:09:40,557 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable835 [2022-12-06 00:09:40,557 INFO L420 AbstractCegarLoop]: === Iteration 837 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:09:40,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:09:40,557 INFO L85 PathProgramCache]: Analyzing trace with hash 1226937176, now seen corresponding path program 1 times [2022-12-06 00:09:40,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:09:40,557 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091049643] [2022-12-06 00:09:40,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:09:40,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:09:40,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:09:40,649 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-06 00:09:40,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:09:40,649 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091049643] [2022-12-06 00:09:40,649 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2091049643] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:09:40,649 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:09:40,649 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:09:40,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2964476] [2022-12-06 00:09:40,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:09:40,649 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:09:40,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:09:40,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:09:40,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:09:40,650 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:09:40,650 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:09:40,650 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:09:40,650 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:09:40,650 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:09:41,011 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:09:41,011 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:09:41,017 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13571 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:09:41,026 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:09:41,026 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:09:41,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:09:41,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:09:41,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:09:41,027 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:09:41,027 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:09:41,027 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:09:41,078 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:09:41,079 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:41,079 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:09:41,079 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:09:41,079 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:09:41,079 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:41,080 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:09:41,080 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:09:41,080 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:41,081 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:41,115 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:09:41,115 INFO L131 PetriNetUnfolder]: For 3338/3547 co-relation queries the response was YES. [2022-12-06 00:09:41,117 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3338/3547 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2967 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:09:41,119 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:41,119 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:09:41,295 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:09:41,295 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 216 [2022-12-06 00:09:41,296 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:09:41,296 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:09:41,296 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:09:41,296 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:09:41,296 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable836 [2022-12-06 00:09:41,296 INFO L420 AbstractCegarLoop]: === Iteration 838 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:09:41,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:09:41,296 INFO L85 PathProgramCache]: Analyzing trace with hash -1325219785, now seen corresponding path program 1 times [2022-12-06 00:09:41,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:09:41,296 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043307954] [2022-12-06 00:09:41,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:09:41,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:09:41,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:09:41,373 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-06 00:09:41,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:09:41,374 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043307954] [2022-12-06 00:09:41,374 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2043307954] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:09:41,374 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:09:41,374 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:09:41,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434365758] [2022-12-06 00:09:41,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:09:41,374 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:09:41,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:09:41,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:09:41,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:09:41,375 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:09:41,375 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:09:41,375 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:09:41,375 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:09:41,375 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:09:41,765 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:09:41,766 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:09:41,773 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13563 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:09:41,783 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:09:41,783 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:09:41,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:09:41,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:09:41,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:09:41,784 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:09:41,784 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:09:41,784 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:09:41,830 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:09:41,832 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:41,832 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:09:41,832 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:09:41,832 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:09:41,832 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:41,833 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:09:41,833 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:09:41,833 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:41,833 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:41,865 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:09:41,865 INFO L131 PetriNetUnfolder]: For 3299/3508 co-relation queries the response was YES. [2022-12-06 00:09:41,867 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3299/3508 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2986 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:09:41,869 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:41,869 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:09:42,052 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:09:42,052 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 220 [2022-12-06 00:09:42,052 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:09:42,052 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:09:42,052 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:09:42,052 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:09:42,052 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable837 [2022-12-06 00:09:42,052 INFO L420 AbstractCegarLoop]: === Iteration 839 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:09:42,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:09:42,053 INFO L85 PathProgramCache]: Analyzing trace with hash 417590550, now seen corresponding path program 1 times [2022-12-06 00:09:42,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:09:42,053 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533268218] [2022-12-06 00:09:42,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:09:42,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:09:42,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:09:42,135 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:09:42,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:09:42,135 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533268218] [2022-12-06 00:09:42,135 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [533268218] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:09:42,135 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:09:42,135 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:09:42,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614145485] [2022-12-06 00:09:42,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:09:42,136 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:09:42,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:09:42,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:09:42,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:09:42,136 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:09:42,136 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:09:42,136 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:09:42,136 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:09:42,136 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:09:42,505 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:09:42,506 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:09:42,515 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13560 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:09:42,527 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:09:42,527 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:09:42,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:09:42,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:09:42,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:09:42,528 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:09:42,528 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:09:42,528 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:09:42,575 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:09:42,577 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:42,577 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:09:42,577 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:09:42,577 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:09:42,577 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:42,578 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:09:42,578 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:09:42,578 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:42,579 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:42,610 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:09:42,611 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 00:09:42,612 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3312/3520 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2975 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:09:42,615 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:42,615 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:09:42,868 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:09:42,868 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 291 [2022-12-06 00:09:42,868 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:09:42,868 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:09:42,868 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:09:42,868 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:09:42,869 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable838 [2022-12-06 00:09:42,869 INFO L420 AbstractCegarLoop]: === Iteration 840 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:09:42,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:09:42,869 INFO L85 PathProgramCache]: Analyzing trace with hash -2134566411, now seen corresponding path program 1 times [2022-12-06 00:09:42,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:09:42,869 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363353343] [2022-12-06 00:09:42,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:09:42,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:09:42,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:09:42,957 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-06 00:09:42,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:09:42,958 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363353343] [2022-12-06 00:09:42,958 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1363353343] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:09:42,958 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:09:42,958 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:09:42,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733661733] [2022-12-06 00:09:42,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:09:42,958 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:09:42,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:09:42,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:09:42,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:09:42,959 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:09:42,959 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:09:42,959 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:09:42,959 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:09:42,959 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:09:43,348 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:09:43,348 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:09:43,356 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13565 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:09:43,366 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:09:43,366 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:09:43,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:09:43,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:09:43,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:09:43,367 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:09:43,367 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:09:43,367 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:09:43,417 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:09:43,418 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:43,419 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:09:43,419 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:09:43,419 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:09:43,419 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:43,419 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:09:43,420 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:09:43,420 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:43,420 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:43,454 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:09:43,454 INFO L131 PetriNetUnfolder]: For 3318/3528 co-relation queries the response was YES. [2022-12-06 00:09:43,456 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3318/3528 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2980 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:09:43,459 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:43,459 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:09:43,646 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:09:43,647 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 228 [2022-12-06 00:09:43,647 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:09:43,647 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:09:43,647 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:09:43,647 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:09:43,647 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable839 [2022-12-06 00:09:43,647 INFO L420 AbstractCegarLoop]: === Iteration 841 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:09:43,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:09:43,647 INFO L85 PathProgramCache]: Analyzing trace with hash -391756076, now seen corresponding path program 1 times [2022-12-06 00:09:43,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:09:43,647 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854250947] [2022-12-06 00:09:43,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:09:43,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:09:43,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:09:43,732 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-06 00:09:43,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:09:43,732 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854250947] [2022-12-06 00:09:43,732 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [854250947] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:09:43,732 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:09:43,733 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:09:43,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302301645] [2022-12-06 00:09:43,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:09:43,733 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:09:43,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:09:43,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:09:43,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:09:43,733 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:09:43,733 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:09:43,733 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:09:43,733 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:09:43,733 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:09:44,146 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:09:44,146 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:09:44,153 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13567 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:09:44,163 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:09:44,163 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:09:44,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:09:44,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:09:44,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:09:44,164 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:09:44,164 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:09:44,164 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:09:44,207 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:09:44,209 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:44,209 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:09:44,209 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:09:44,209 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:09:44,209 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:44,210 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:09:44,210 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:09:44,210 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:44,211 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:44,242 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:09:44,242 INFO L131 PetriNetUnfolder]: For 3327/3536 co-relation queries the response was YES. [2022-12-06 00:09:44,243 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3327/3536 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2985 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:09:44,246 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:44,246 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:09:44,426 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:09:44,426 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 217 [2022-12-06 00:09:44,426 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:09:44,426 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:09:44,427 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:09:44,427 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:09:44,427 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable840 [2022-12-06 00:09:44,427 INFO L420 AbstractCegarLoop]: === Iteration 842 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:09:44,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:09:44,427 INFO L85 PathProgramCache]: Analyzing trace with hash 1351054259, now seen corresponding path program 1 times [2022-12-06 00:09:44,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:09:44,427 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146245451] [2022-12-06 00:09:44,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:09:44,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:09:44,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:09:44,517 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-06 00:09:44,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:09:44,517 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146245451] [2022-12-06 00:09:44,517 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2146245451] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:09:44,517 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:09:44,518 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:09:44,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037920008] [2022-12-06 00:09:44,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:09:44,518 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:09:44,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:09:44,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:09:44,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:09:44,518 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:09:44,518 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:09:44,519 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:09:44,519 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:09:44,519 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:09:44,885 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:09:44,885 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:09:44,893 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13554 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:09:44,904 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:09:44,905 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:09:44,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:09:44,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:09:44,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:09:44,905 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:09:44,905 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:09:44,906 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:09:44,957 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:09:44,959 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:44,959 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:09:44,959 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:09:44,959 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:09:44,959 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:44,960 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:09:44,960 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:09:44,960 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:44,961 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:44,994 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:09:44,995 INFO L131 PetriNetUnfolder]: For 3299/3508 co-relation queries the response was YES. [2022-12-06 00:09:44,996 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3299/3508 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2985 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:09:44,999 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:44,999 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:09:45,191 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:09:45,192 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 233 [2022-12-06 00:09:45,192 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:09:45,192 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:09:45,192 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:09:45,192 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:09:45,192 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable841 [2022-12-06 00:09:45,192 INFO L420 AbstractCegarLoop]: === Iteration 843 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:09:45,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:09:45,193 INFO L85 PathProgramCache]: Analyzing trace with hash -1201102702, now seen corresponding path program 1 times [2022-12-06 00:09:45,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:09:45,193 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481629575] [2022-12-06 00:09:45,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:09:45,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:09:45,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:09:45,272 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-06 00:09:45,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:09:45,272 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481629575] [2022-12-06 00:09:45,272 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481629575] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:09:45,272 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:09:45,272 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:09:45,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680008474] [2022-12-06 00:09:45,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:09:45,273 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:09:45,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:09:45,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:09:45,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:09:45,273 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:09:45,273 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:09:45,273 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:09:45,273 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:09:45,273 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:09:45,628 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:09:45,628 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 00:09:45,635 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26969/27014 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13517 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:09:45,645 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:09:45,645 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:09:45,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:09:45,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:09:45,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:09:45,646 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:09:45,646 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:09:45,646 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:09:45,698 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:09:45,699 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:45,699 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:09:45,699 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:09:45,700 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:09:45,700 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:45,700 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:09:45,700 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:09:45,700 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:45,701 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:45,750 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:09:45,750 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 00:09:45,764 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3133/3273 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2950 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:09:45,767 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:45,767 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:09:46,054 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:09:46,054 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 354 [2022-12-06 00:09:46,054 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:09:46,054 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:09:46,055 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:09:46,055 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:09:46,055 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable842 [2022-12-06 00:09:46,055 INFO L420 AbstractCegarLoop]: === Iteration 844 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:09:46,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:09:46,055 INFO L85 PathProgramCache]: Analyzing trace with hash 541707633, now seen corresponding path program 1 times [2022-12-06 00:09:46,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:09:46,055 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125558849] [2022-12-06 00:09:46,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:09:46,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:09:46,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:09:46,130 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-06 00:09:46,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:09:46,130 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125558849] [2022-12-06 00:09:46,130 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [125558849] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:09:46,131 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:09:46,131 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:09:46,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415646733] [2022-12-06 00:09:46,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:09:46,131 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:09:46,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:09:46,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:09:46,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:09:46,131 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:09:46,132 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:09:46,132 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:09:46,132 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:09:46,132 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:09:46,518 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:09:46,518 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 00:09:46,524 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26969/27014 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13525 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:09:46,533 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:09:46,533 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:09:46,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:09:46,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:09:46,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:09:46,534 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:09:46,534 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:09:46,534 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:09:46,575 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:09:46,576 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:46,576 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:09:46,577 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:09:46,577 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:09:46,577 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:46,577 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:09:46,577 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:09:46,578 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:46,578 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:46,609 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:09:46,609 INFO L131 PetriNetUnfolder]: For 3123/3264 co-relation queries the response was YES. [2022-12-06 00:09:46,611 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3123/3264 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2976 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:09:46,614 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:46,614 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:09:46,812 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:09:46,812 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 235 [2022-12-06 00:09:46,812 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:09:46,812 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:09:46,812 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:09:46,812 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:09:46,812 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable843 [2022-12-06 00:09:46,812 INFO L420 AbstractCegarLoop]: === Iteration 845 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:09:46,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:09:46,813 INFO L85 PathProgramCache]: Analyzing trace with hash -2010449328, now seen corresponding path program 1 times [2022-12-06 00:09:46,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:09:46,813 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178935956] [2022-12-06 00:09:46,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:09:46,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:09:46,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:09:46,897 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-06 00:09:46,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:09:46,898 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178935956] [2022-12-06 00:09:46,898 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1178935956] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:09:46,898 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:09:46,898 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:09:46,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287416304] [2022-12-06 00:09:46,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:09:46,898 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:09:46,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:09:46,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:09:46,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:09:46,899 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:09:46,899 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:09:46,899 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:09:46,899 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:09:46,899 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:09:47,246 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:09:47,246 INFO L131 PetriNetUnfolder]: For 26955/27000 co-relation queries the response was YES. [2022-12-06 00:09:47,253 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26955/27000 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13532 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:09:47,262 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:09:47,262 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:09:47,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:09:47,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:09:47,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:09:47,263 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:09:47,263 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:09:47,263 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:09:47,306 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:09:47,308 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:47,308 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:09:47,308 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:09:47,308 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:09:47,308 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:47,308 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:09:47,309 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:09:47,309 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:47,309 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:47,340 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:09:47,340 INFO L131 PetriNetUnfolder]: For 3146/3287 co-relation queries the response was YES. [2022-12-06 00:09:47,341 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3146/3287 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2970 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:09:47,344 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:47,344 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:09:47,531 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:09:47,531 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 223 [2022-12-06 00:09:47,531 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:09:47,532 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:09:47,532 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:09:47,532 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:09:47,532 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable844 [2022-12-06 00:09:47,532 INFO L420 AbstractCegarLoop]: === Iteration 846 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:09:47,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:09:47,532 INFO L85 PathProgramCache]: Analyzing trace with hash -267638993, now seen corresponding path program 1 times [2022-12-06 00:09:47,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:09:47,532 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709507162] [2022-12-06 00:09:47,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:09:47,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:09:47,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:09:47,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:09:47,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:09:47,605 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709507162] [2022-12-06 00:09:47,605 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [709507162] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:09:47,605 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:09:47,605 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:09:47,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162717515] [2022-12-06 00:09:47,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:09:47,605 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:09:47,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:09:47,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:09:47,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:09:47,606 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:09:47,606 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:09:47,606 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:09:47,606 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:09:47,606 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:09:47,959 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:09:47,959 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:09:47,967 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13552 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:09:47,977 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:09:47,978 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:09:47,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:09:47,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:09:47,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:09:47,978 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:09:47,979 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:09:47,979 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:09:48,032 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:09:48,033 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:48,033 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:09:48,034 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:09:48,034 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:09:48,034 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:48,034 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:09:48,034 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:09:48,034 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:48,035 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:48,070 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:09:48,070 INFO L131 PetriNetUnfolder]: For 3304/3511 co-relation queries the response was YES. [2022-12-06 00:09:48,072 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3304/3511 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2981 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:09:48,075 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:48,075 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:09:48,263 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:09:48,264 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 230 [2022-12-06 00:09:48,264 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:09:48,264 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:09:48,264 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:09:48,264 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:09:48,264 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable845 [2022-12-06 00:09:48,264 INFO L420 AbstractCegarLoop]: === Iteration 847 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:09:48,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:09:48,265 INFO L85 PathProgramCache]: Analyzing trace with hash 1475171342, now seen corresponding path program 1 times [2022-12-06 00:09:48,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:09:48,265 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561982536] [2022-12-06 00:09:48,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:09:48,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:09:48,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:09:48,351 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-06 00:09:48,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:09:48,351 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561982536] [2022-12-06 00:09:48,351 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1561982536] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:09:48,351 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:09:48,351 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:09:48,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503586436] [2022-12-06 00:09:48,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:09:48,351 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:09:48,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:09:48,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:09:48,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:09:48,352 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:09:48,352 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:09:48,352 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:09:48,352 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:09:48,352 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:09:48,734 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:09:48,735 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:09:48,740 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13555 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:09:48,748 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:09:48,748 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:09:48,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:09:48,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:09:48,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:09:48,749 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:09:48,749 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:09:48,749 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:09:48,784 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:09:48,785 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:48,785 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:09:48,785 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:09:48,785 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:09:48,785 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:48,786 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:09:48,786 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:09:48,786 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:48,786 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:48,815 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:09:48,815 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 00:09:48,817 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3321/3530 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2979 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:09:48,820 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:48,820 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:09:48,989 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:09:48,990 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 205 [2022-12-06 00:09:48,990 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:09:48,990 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:09:48,990 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:09:48,990 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:09:48,990 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable846 [2022-12-06 00:09:48,990 INFO L420 AbstractCegarLoop]: === Iteration 848 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:09:48,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:09:48,990 INFO L85 PathProgramCache]: Analyzing trace with hash -1076985619, now seen corresponding path program 1 times [2022-12-06 00:09:48,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:09:48,990 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873932510] [2022-12-06 00:09:48,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:09:48,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:09:49,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:09:49,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-06 00:09:49,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:09:49,080 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873932510] [2022-12-06 00:09:49,080 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [873932510] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:09:49,080 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:09:49,080 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:09:49,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863913706] [2022-12-06 00:09:49,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:09:49,080 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:09:49,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:09:49,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:09:49,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:09:49,081 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:09:49,081 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:09:49,081 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:09:49,081 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:09:49,081 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:09:49,433 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:09:49,433 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:09:49,441 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13581 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:09:49,451 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:09:49,451 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:09:49,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:09:49,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:09:49,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:09:49,452 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:09:49,452 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:09:49,452 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:09:49,501 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:09:49,502 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:49,502 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:09:49,503 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:09:49,503 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:09:49,503 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:49,503 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:09:49,503 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:09:49,503 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:49,504 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:49,535 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:09:49,536 INFO L131 PetriNetUnfolder]: For 3308/3518 co-relation queries the response was YES. [2022-12-06 00:09:49,537 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3308/3518 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2983 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:09:49,539 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:49,540 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:09:49,715 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:09:49,715 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 212 [2022-12-06 00:09:49,715 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:09:49,715 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:09:49,715 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:09:49,715 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:09:49,715 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable847 [2022-12-06 00:09:49,716 INFO L420 AbstractCegarLoop]: === Iteration 849 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:09:49,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:09:49,716 INFO L85 PathProgramCache]: Analyzing trace with hash 665824716, now seen corresponding path program 1 times [2022-12-06 00:09:49,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:09:49,716 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931390557] [2022-12-06 00:09:49,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:09:49,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:09:49,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:09:49,799 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-06 00:09:49,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:09:49,799 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931390557] [2022-12-06 00:09:49,800 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1931390557] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:09:49,800 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:09:49,800 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:09:49,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797363826] [2022-12-06 00:09:49,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:09:49,800 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:09:49,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:09:49,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:09:49,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:09:49,800 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:09:49,800 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:09:49,800 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:09:49,801 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:09:49,801 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:09:50,158 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:09:50,158 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:09:50,168 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13562 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:09:50,179 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:09:50,179 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:09:50,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:09:50,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:09:50,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:09:50,180 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:09:50,180 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:09:50,180 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:09:50,225 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:09:50,226 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:50,227 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:09:50,227 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:09:50,227 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:09:50,227 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:50,227 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:09:50,228 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:09:50,228 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:50,228 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:50,262 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:09:50,262 INFO L131 PetriNetUnfolder]: For 3338/3547 co-relation queries the response was YES. [2022-12-06 00:09:50,263 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3338/3547 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2984 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:09:50,265 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:50,265 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:09:50,451 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:09:50,452 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 225 [2022-12-06 00:09:50,452 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:09:50,452 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:09:50,452 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:09:50,452 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:09:50,452 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable848 [2022-12-06 00:09:50,453 INFO L420 AbstractCegarLoop]: === Iteration 850 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:09:50,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:09:50,453 INFO L85 PathProgramCache]: Analyzing trace with hash -1886332245, now seen corresponding path program 1 times [2022-12-06 00:09:50,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:09:50,453 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719823455] [2022-12-06 00:09:50,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:09:50,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:09:50,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:09:50,544 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-06 00:09:50,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:09:50,544 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719823455] [2022-12-06 00:09:50,544 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1719823455] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:09:50,545 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:09:50,545 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:09:50,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436039011] [2022-12-06 00:09:50,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:09:50,545 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:09:50,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:09:50,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:09:50,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:09:50,545 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:09:50,545 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:09:50,546 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:09:50,546 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:09:50,546 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:09:50,930 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:09:50,931 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 00:09:50,937 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26969/27014 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13545 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:09:50,946 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:09:50,946 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:09:50,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:09:50,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:09:50,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:09:50,947 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:09:50,947 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:09:50,947 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:09:50,992 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:09:50,993 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:50,994 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:09:50,994 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:09:50,994 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:09:50,994 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:50,994 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:09:50,995 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:09:50,995 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:50,995 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:51,028 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:09:51,029 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 00:09:51,030 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3133/3273 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2969 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:09:51,033 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:51,033 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:09:51,223 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:09:51,224 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 230 [2022-12-06 00:09:51,224 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:09:51,224 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:09:51,224 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:09:51,224 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:09:51,224 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable849 [2022-12-06 00:09:51,224 INFO L420 AbstractCegarLoop]: === Iteration 851 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:09:51,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:09:51,224 INFO L85 PathProgramCache]: Analyzing trace with hash -143521910, now seen corresponding path program 1 times [2022-12-06 00:09:51,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:09:51,224 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843567534] [2022-12-06 00:09:51,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:09:51,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:09:51,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:09:51,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-06 00:09:51,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:09:51,299 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843567534] [2022-12-06 00:09:51,299 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1843567534] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:09:51,299 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:09:51,299 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:09:51,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442928874] [2022-12-06 00:09:51,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:09:51,300 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:09:51,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:09:51,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:09:51,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:09:51,300 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:09:51,300 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:09:51,300 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:09:51,300 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:09:51,300 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:09:51,644 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:09:51,644 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:09:51,652 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13553 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:09:51,663 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:09:51,663 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:09:51,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:09:51,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:09:51,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:09:51,664 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:09:51,664 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:09:51,664 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:09:51,711 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:09:51,712 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:51,712 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:09:51,713 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:09:51,713 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:09:51,713 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:51,713 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:09:51,713 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:09:51,713 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:51,714 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:51,746 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:09:51,746 INFO L131 PetriNetUnfolder]: For 3318/3528 co-relation queries the response was YES. [2022-12-06 00:09:51,747 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3318/3528 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2985 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:09:51,750 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:51,750 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:09:51,915 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:09:51,915 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 202 [2022-12-06 00:09:51,915 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:09:51,915 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:09:51,915 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:09:51,915 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:09:51,915 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable850 [2022-12-06 00:09:51,916 INFO L420 AbstractCegarLoop]: === Iteration 852 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:09:51,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:09:51,916 INFO L85 PathProgramCache]: Analyzing trace with hash 1599288425, now seen corresponding path program 1 times [2022-12-06 00:09:51,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:09:51,916 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113773246] [2022-12-06 00:09:51,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:09:51,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:09:51,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:09:52,000 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-06 00:09:52,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:09:52,000 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113773246] [2022-12-06 00:09:52,000 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2113773246] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:09:52,000 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:09:52,000 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:09:52,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411881323] [2022-12-06 00:09:52,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:09:52,001 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:09:52,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:09:52,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:09:52,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:09:52,001 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:09:52,001 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:09:52,001 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:09:52,001 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:09:52,001 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:09:52,354 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:09:52,354 INFO L131 PetriNetUnfolder]: For 27150/27195 co-relation queries the response was YES. [2022-12-06 00:09:52,361 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27150/27195 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13529 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:09:52,371 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:09:52,371 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:09:52,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:09:52,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:09:52,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:09:52,372 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:09:52,372 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:09:52,372 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:09:52,418 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:09:52,420 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:52,420 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:09:52,420 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:09:52,420 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:09:52,420 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:52,421 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:09:52,421 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:09:52,421 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:52,422 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:52,453 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:09:52,453 INFO L131 PetriNetUnfolder]: For 3167/3307 co-relation queries the response was YES. [2022-12-06 00:09:52,454 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3167/3307 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2994 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:09:52,457 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:52,457 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:09:52,647 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:09:52,648 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 228 [2022-12-06 00:09:52,648 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:09:52,648 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:09:52,648 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:09:52,648 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:09:52,648 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable851 [2022-12-06 00:09:52,648 INFO L420 AbstractCegarLoop]: === Iteration 853 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:09:52,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:09:52,648 INFO L85 PathProgramCache]: Analyzing trace with hash -952868536, now seen corresponding path program 1 times [2022-12-06 00:09:52,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:09:52,649 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384996715] [2022-12-06 00:09:52,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:09:52,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:09:52,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:09:52,723 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-06 00:09:52,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:09:52,723 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384996715] [2022-12-06 00:09:52,723 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [384996715] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:09:52,723 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:09:52,724 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:09:52,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836630609] [2022-12-06 00:09:52,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:09:52,724 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:09:52,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:09:52,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:09:52,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:09:52,724 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:09:52,724 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:09:52,724 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:09:52,724 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:09:52,724 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:09:53,110 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:09:53,111 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:09:53,117 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13558 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:09:53,125 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:09:53,125 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:09:53,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:09:53,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:09:53,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:09:53,126 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:09:53,126 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:09:53,126 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:09:53,167 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:09:53,168 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:53,169 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:09:53,169 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:09:53,169 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:09:53,169 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:53,169 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:09:53,169 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:09:53,170 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:53,170 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:53,201 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:09:53,201 INFO L131 PetriNetUnfolder]: For 3348/3558 co-relation queries the response was YES. [2022-12-06 00:09:53,203 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3348/3558 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2988 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:09:53,206 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:53,206 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:09:53,384 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:09:53,384 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 215 [2022-12-06 00:09:53,384 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:09:53,384 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:09:53,385 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:09:53,385 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:09:53,385 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable852 [2022-12-06 00:09:53,385 INFO L420 AbstractCegarLoop]: === Iteration 854 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:09:53,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:09:53,385 INFO L85 PathProgramCache]: Analyzing trace with hash 789941799, now seen corresponding path program 1 times [2022-12-06 00:09:53,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:09:53,385 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126764050] [2022-12-06 00:09:53,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:09:53,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:09:53,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:09:53,454 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:09:53,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:09:53,455 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126764050] [2022-12-06 00:09:53,455 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1126764050] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:09:53,455 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:09:53,455 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:09:53,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812493229] [2022-12-06 00:09:53,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:09:53,455 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:09:53,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:09:53,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:09:53,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:09:53,455 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:09:53,456 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:09:53,456 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:09:53,456 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:09:53,456 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:09:53,811 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:09:53,811 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:09:53,819 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13557 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:09:53,829 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:09:53,829 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:09:53,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:09:53,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:09:53,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:09:53,830 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:09:53,830 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:09:53,830 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:09:53,876 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:09:53,878 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:53,878 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:09:53,878 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:09:53,878 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:09:53,878 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:53,879 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:09:53,879 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:09:53,879 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:53,880 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:53,910 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:09:53,911 INFO L131 PetriNetUnfolder]: For 3304/3511 co-relation queries the response was YES. [2022-12-06 00:09:53,912 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3304/3511 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2980 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:09:53,914 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:53,914 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:09:54,119 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:09:54,120 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 242 [2022-12-06 00:09:54,120 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:09:54,120 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:09:54,120 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:09:54,120 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:09:54,120 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable853 [2022-12-06 00:09:54,121 INFO L420 AbstractCegarLoop]: === Iteration 855 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:09:54,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:09:54,121 INFO L85 PathProgramCache]: Analyzing trace with hash -1762215162, now seen corresponding path program 1 times [2022-12-06 00:09:54,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:09:54,121 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812745852] [2022-12-06 00:09:54,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:09:54,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:09:54,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:09:54,206 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-06 00:09:54,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:09:54,206 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812745852] [2022-12-06 00:09:54,206 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [812745852] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:09:54,206 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:09:54,206 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:09:54,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505897199] [2022-12-06 00:09:54,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:09:54,207 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:09:54,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:09:54,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:09:54,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:09:54,207 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:09:54,207 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:09:54,207 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:09:54,207 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:09:54,207 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:09:54,543 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:09:54,543 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 00:09:54,551 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26965/27010 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13530 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:09:54,561 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:09:54,562 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:09:54,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:09:54,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:09:54,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:09:54,562 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:09:54,562 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:09:54,562 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:09:54,612 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:09:54,613 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:54,613 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:09:54,614 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:09:54,614 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:09:54,614 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:54,614 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:09:54,614 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:09:54,614 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:54,615 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:54,647 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:09:54,647 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 00:09:54,649 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3133/3273 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2993 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:09:54,651 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:54,651 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:09:54,832 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:09:54,832 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 218 [2022-12-06 00:09:54,832 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:09:54,832 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:09:54,832 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:09:54,833 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:09:54,833 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable854 [2022-12-06 00:09:54,833 INFO L420 AbstractCegarLoop]: === Iteration 856 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:09:54,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:09:54,833 INFO L85 PathProgramCache]: Analyzing trace with hash -19404827, now seen corresponding path program 1 times [2022-12-06 00:09:54,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:09:54,833 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102473890] [2022-12-06 00:09:54,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:09:54,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:09:54,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:09:54,909 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-06 00:09:54,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:09:54,910 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102473890] [2022-12-06 00:09:54,910 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1102473890] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:09:54,910 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:09:54,910 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:09:54,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849196171] [2022-12-06 00:09:54,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:09:54,910 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:09:54,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:09:54,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:09:54,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:09:54,910 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:09:54,911 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:09:54,911 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:09:54,911 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:09:54,911 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:09:55,305 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:09:55,305 INFO L131 PetriNetUnfolder]: For 27229/27274 co-relation queries the response was YES. [2022-12-06 00:09:55,310 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27229/27274 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13557 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:09:55,316 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:09:55,316 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:09:55,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:09:55,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:09:55,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:09:55,317 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:09:55,317 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:09:55,317 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:09:55,347 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:09:55,348 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:55,348 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:09:55,348 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:09:55,348 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:09:55,348 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:55,349 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:09:55,349 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:09:55,349 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:55,349 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:55,374 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:09:55,374 INFO L131 PetriNetUnfolder]: For 3301/3509 co-relation queries the response was YES. [2022-12-06 00:09:55,375 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3301/3509 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2975 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:09:55,377 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:55,377 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:09:55,530 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:09:55,531 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 183 [2022-12-06 00:09:55,531 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:09:55,531 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:09:55,531 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:09:55,531 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:09:55,531 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable855 [2022-12-06 00:09:55,531 INFO L420 AbstractCegarLoop]: === Iteration 857 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:09:55,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:09:55,531 INFO L85 PathProgramCache]: Analyzing trace with hash 1723405508, now seen corresponding path program 1 times [2022-12-06 00:09:55,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:09:55,532 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800843961] [2022-12-06 00:09:55,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:09:55,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:09:55,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:09:55,630 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-06 00:09:55,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:09:55,630 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800843961] [2022-12-06 00:09:55,630 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1800843961] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:09:55,630 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:09:55,631 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:09:55,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669568672] [2022-12-06 00:09:55,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:09:55,631 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:09:55,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:09:55,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:09:55,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:09:55,631 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:09:55,632 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:09:55,632 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:09:55,632 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:09:55,632 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:09:55,999 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:09:55,999 INFO L131 PetriNetUnfolder]: For 27136/27181 co-relation queries the response was YES. [2022-12-06 00:09:56,007 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27136/27181 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13523 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:09:56,017 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:09:56,017 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:09:56,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:09:56,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:09:56,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:09:56,018 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:09:56,018 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:09:56,018 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:09:56,068 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:09:56,069 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:56,069 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:09:56,070 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:09:56,070 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:09:56,070 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:56,070 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:09:56,070 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:09:56,071 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:56,071 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:56,103 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:09:56,103 INFO L131 PetriNetUnfolder]: For 3180/3321 co-relation queries the response was YES. [2022-12-06 00:09:56,104 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3180/3321 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2984 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:09:56,107 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:56,107 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:09:56,295 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:09:56,296 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 226 [2022-12-06 00:09:56,296 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:09:56,296 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:09:56,296 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:09:56,296 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:09:56,296 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable856 [2022-12-06 00:09:56,296 INFO L420 AbstractCegarLoop]: === Iteration 858 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:09:56,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:09:56,296 INFO L85 PathProgramCache]: Analyzing trace with hash -828751453, now seen corresponding path program 1 times [2022-12-06 00:09:56,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:09:56,297 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925715510] [2022-12-06 00:09:56,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:09:56,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:09:56,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:09:56,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:09:56,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:09:56,369 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925715510] [2022-12-06 00:09:56,369 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [925715510] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:09:56,369 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:09:56,369 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:09:56,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612498536] [2022-12-06 00:09:56,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:09:56,369 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:09:56,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:09:56,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:09:56,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:09:56,369 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:09:56,370 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:09:56,370 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:09:56,370 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:09:56,370 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:09:56,729 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:09:56,729 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:09:56,738 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13566 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:09:56,748 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:09:56,749 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:09:56,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:09:56,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:09:56,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:09:56,750 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:09:56,750 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:09:56,750 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:09:56,797 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:09:56,799 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:56,799 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:09:56,799 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:09:56,799 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:09:56,799 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:56,800 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:09:56,800 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:09:56,800 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:56,801 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:56,832 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:09:56,832 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 00:09:56,834 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3312/3520 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2998 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:09:56,836 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:56,837 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:09:57,032 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:09:57,032 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 233 [2022-12-06 00:09:57,032 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:09:57,032 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:09:57,032 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:09:57,032 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:09:57,032 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable857 [2022-12-06 00:09:57,033 INFO L420 AbstractCegarLoop]: === Iteration 859 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:09:57,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:09:57,033 INFO L85 PathProgramCache]: Analyzing trace with hash 914058882, now seen corresponding path program 1 times [2022-12-06 00:09:57,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:09:57,033 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853493594] [2022-12-06 00:09:57,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:09:57,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:09:57,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:09:57,116 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-06 00:09:57,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:09:57,116 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853493594] [2022-12-06 00:09:57,116 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1853493594] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:09:57,116 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:09:57,116 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:09:57,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240704385] [2022-12-06 00:09:57,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:09:57,116 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:09:57,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:09:57,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:09:57,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:09:57,117 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:09:57,117 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:09:57,117 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:09:57,117 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:09:57,117 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:09:57,521 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:09:57,521 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:09:57,527 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13569 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:09:57,535 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:09:57,535 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:09:57,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:09:57,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:09:57,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:09:57,536 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:09:57,536 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:09:57,536 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:09:57,577 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:09:57,578 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:57,578 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:09:57,578 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:09:57,578 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:09:57,578 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:57,579 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:09:57,579 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:09:57,579 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:57,580 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:57,611 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:09:57,611 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 00:09:57,613 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3312/3520 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2980 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:09:57,615 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:57,616 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:09:57,800 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:09:57,801 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 223 [2022-12-06 00:09:57,801 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:09:57,801 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:09:57,801 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:09:57,801 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:09:57,801 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable858 [2022-12-06 00:09:57,801 INFO L420 AbstractCegarLoop]: === Iteration 860 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:09:57,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:09:57,802 INFO L85 PathProgramCache]: Analyzing trace with hash -1638098079, now seen corresponding path program 1 times [2022-12-06 00:09:57,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:09:57,802 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796289155] [2022-12-06 00:09:57,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:09:57,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:09:57,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:09:57,884 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-06 00:09:57,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:09:57,884 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796289155] [2022-12-06 00:09:57,884 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1796289155] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:09:57,884 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:09:57,884 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:09:57,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296426485] [2022-12-06 00:09:57,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:09:57,885 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:09:57,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:09:57,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:09:57,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:09:57,885 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:09:57,885 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:09:57,885 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:09:57,885 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:09:57,885 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:09:58,242 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:09:58,242 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 00:09:58,250 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26965/27010 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13534 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:09:58,259 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:09:58,259 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:09:58,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:09:58,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:09:58,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:09:58,260 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:09:58,260 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:09:58,260 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:09:58,305 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:09:58,306 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:58,306 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:09:58,306 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:09:58,306 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:09:58,307 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:58,307 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:09:58,307 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:09:58,307 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:58,308 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:58,340 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:09:58,340 INFO L131 PetriNetUnfolder]: For 3122/3262 co-relation queries the response was YES. [2022-12-06 00:09:58,342 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3122/3262 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2975 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:09:58,345 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:58,345 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:09:58,522 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:09:58,522 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 216 [2022-12-06 00:09:58,522 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:09:58,523 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:09:58,523 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:09:58,523 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:09:58,523 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable859 [2022-12-06 00:09:58,523 INFO L420 AbstractCegarLoop]: === Iteration 861 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:09:58,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:09:58,523 INFO L85 PathProgramCache]: Analyzing trace with hash 104712256, now seen corresponding path program 1 times [2022-12-06 00:09:58,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:09:58,523 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359399193] [2022-12-06 00:09:58,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:09:58,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:09:58,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:09:58,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-06 00:09:58,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:09:58,610 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359399193] [2022-12-06 00:09:58,610 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1359399193] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:09:58,610 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:09:58,610 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:09:58,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221133173] [2022-12-06 00:09:58,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:09:58,611 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:09:58,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:09:58,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:09:58,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:09:58,611 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:09:58,611 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:09:58,611 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:09:58,611 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:09:58,611 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:09:58,979 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:09:58,980 INFO L131 PetriNetUnfolder]: For 26955/27000 co-relation queries the response was YES. [2022-12-06 00:09:58,988 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26955/27000 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13529 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:09:58,999 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:09:58,999 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:09:59,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:09:59,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:09:59,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:09:59,000 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:09:59,000 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:09:59,000 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:09:59,051 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:09:59,052 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:59,052 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:09:59,052 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:09:59,052 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:09:59,053 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:59,053 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:09:59,053 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:09:59,053 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:59,054 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:59,084 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:09:59,085 INFO L131 PetriNetUnfolder]: For 3141/3284 co-relation queries the response was YES. [2022-12-06 00:09:59,086 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3141/3284 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2984 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:09:59,088 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:59,089 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:09:59,264 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:09:59,265 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 213 [2022-12-06 00:09:59,265 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:09:59,265 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:09:59,265 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:09:59,265 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:09:59,265 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable860 [2022-12-06 00:09:59,265 INFO L420 AbstractCegarLoop]: === Iteration 862 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:09:59,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:09:59,265 INFO L85 PathProgramCache]: Analyzing trace with hash 1847522591, now seen corresponding path program 1 times [2022-12-06 00:09:59,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:09:59,265 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909833971] [2022-12-06 00:09:59,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:09:59,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:09:59,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:09:59,346 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-06 00:09:59,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:09:59,346 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909833971] [2022-12-06 00:09:59,346 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [909833971] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:09:59,346 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:09:59,346 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:09:59,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155569815] [2022-12-06 00:09:59,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:09:59,347 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:09:59,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:09:59,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:09:59,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:09:59,347 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:09:59,347 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:09:59,347 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:09:59,347 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:09:59,347 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:09:59,700 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:09:59,700 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 00:09:59,707 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26969/27014 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13538 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:09:59,714 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:09:59,715 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:09:59,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:09:59,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:09:59,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:09:59,715 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:09:59,716 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:09:59,716 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:09:59,760 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:09:59,761 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:59,761 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:09:59,762 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:09:59,762 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:09:59,762 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:59,762 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:09:59,762 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:09:59,762 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:59,763 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:59,793 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:09:59,793 INFO L131 PetriNetUnfolder]: For 3122/3262 co-relation queries the response was YES. [2022-12-06 00:09:59,794 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3122/3262 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2973 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:09:59,797 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:09:59,797 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:09:59,943 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:09:59,943 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 181 [2022-12-06 00:09:59,943 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:09:59,943 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:09:59,943 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:09:59,943 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:09:59,943 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable861 [2022-12-06 00:09:59,943 INFO L420 AbstractCegarLoop]: === Iteration 863 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:09:59,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:09:59,944 INFO L85 PathProgramCache]: Analyzing trace with hash -704634370, now seen corresponding path program 1 times [2022-12-06 00:09:59,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:09:59,944 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506693327] [2022-12-06 00:09:59,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:09:59,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:09:59,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:10:00,025 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-06 00:10:00,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:10:00,025 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506693327] [2022-12-06 00:10:00,025 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [506693327] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:10:00,025 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:10:00,025 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:10:00,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102175234] [2022-12-06 00:10:00,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:10:00,026 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:10:00,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:10:00,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:10:00,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:10:00,026 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:10:00,026 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:10:00,026 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:10:00,026 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:10:00,026 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:10:00,349 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:10:00,349 INFO L131 PetriNetUnfolder]: For 27136/27181 co-relation queries the response was YES. [2022-12-06 00:10:00,355 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27136/27181 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13521 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:10:00,364 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:10:00,364 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:10:00,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:10:00,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:10:00,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:10:00,365 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:10:00,365 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:10:00,365 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:10:00,402 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:10:00,403 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:00,403 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:10:00,403 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:10:00,403 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:10:00,403 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:00,404 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:10:00,404 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:10:00,404 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:00,404 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:00,430 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:10:00,430 INFO L131 PetriNetUnfolder]: For 3167/3307 co-relation queries the response was YES. [2022-12-06 00:10:00,431 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3167/3307 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2985 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:10:00,433 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:00,433 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:10:00,582 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:10:00,583 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 180 [2022-12-06 00:10:00,583 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:10:00,583 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:10:00,583 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:10:00,583 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:10:00,583 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable862 [2022-12-06 00:10:00,583 INFO L420 AbstractCegarLoop]: === Iteration 864 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:10:00,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:10:00,583 INFO L85 PathProgramCache]: Analyzing trace with hash 1038175965, now seen corresponding path program 1 times [2022-12-06 00:10:00,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:10:00,584 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822464151] [2022-12-06 00:10:00,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:10:00,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:10:00,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:10:00,648 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-06 00:10:00,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:10:00,648 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822464151] [2022-12-06 00:10:00,648 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [822464151] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:10:00,648 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:10:00,648 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:10:00,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372102920] [2022-12-06 00:10:00,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:10:00,648 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:10:00,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:10:00,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:10:00,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:10:00,649 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:10:00,649 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:10:00,649 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:10:00,649 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:10:00,649 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:10:00,956 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:10:00,956 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 00:10:00,962 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26965/27010 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13529 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:10:00,971 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:10:00,971 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:10:00,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:10:00,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:10:00,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:10:00,972 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:10:00,972 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:10:00,972 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:10:01,008 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:10:01,009 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:01,009 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:10:01,009 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:10:01,010 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:10:01,010 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:01,010 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:10:01,010 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:10:01,010 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:01,011 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:01,037 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:10:01,038 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 00:10:01,039 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3133/3273 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2976 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:10:01,041 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:01,041 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:10:01,194 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:10:01,195 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 185 [2022-12-06 00:10:01,195 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:10:01,195 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:10:01,195 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:10:01,195 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:10:01,195 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable863 [2022-12-06 00:10:01,195 INFO L420 AbstractCegarLoop]: === Iteration 865 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:10:01,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:10:01,195 INFO L85 PathProgramCache]: Analyzing trace with hash -1513980996, now seen corresponding path program 1 times [2022-12-06 00:10:01,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:10:01,195 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976543557] [2022-12-06 00:10:01,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:10:01,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:10:01,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:10:01,286 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-06 00:10:01,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:10:01,286 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976543557] [2022-12-06 00:10:01,286 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1976543557] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:10:01,286 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:10:01,286 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:10:01,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878300355] [2022-12-06 00:10:01,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:10:01,287 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:10:01,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:10:01,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:10:01,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:10:01,287 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:10:01,287 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:10:01,287 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:10:01,287 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:10:01,287 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:10:01,706 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:10:01,707 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:10:01,713 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13556 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:10:01,719 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:10:01,720 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:10:01,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:10:01,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:10:01,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:10:01,720 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:10:01,720 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:10:01,720 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:10:01,750 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:10:01,751 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:01,751 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:10:01,751 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:10:01,752 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:10:01,752 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:01,752 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:10:01,752 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:10:01,752 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:01,753 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:01,778 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:10:01,778 INFO L131 PetriNetUnfolder]: For 3338/3547 co-relation queries the response was YES. [2022-12-06 00:10:01,779 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3338/3547 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 3000 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:10:01,781 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:01,781 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:10:01,946 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:10:01,946 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 194 [2022-12-06 00:10:01,946 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:10:01,946 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:10:01,946 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:10:01,946 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:10:01,946 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable864 [2022-12-06 00:10:01,946 INFO L420 AbstractCegarLoop]: === Iteration 866 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:10:01,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:10:01,947 INFO L85 PathProgramCache]: Analyzing trace with hash 228829339, now seen corresponding path program 1 times [2022-12-06 00:10:01,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:10:01,947 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406292242] [2022-12-06 00:10:01,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:10:01,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:10:01,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:10:02,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-06 00:10:02,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:10:02,006 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406292242] [2022-12-06 00:10:02,007 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [406292242] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:10:02,007 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:10:02,007 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:10:02,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897814771] [2022-12-06 00:10:02,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:10:02,007 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:10:02,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:10:02,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:10:02,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:10:02,008 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:10:02,008 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:10:02,008 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:10:02,008 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:10:02,008 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:10:02,295 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:10:02,295 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 00:10:02,301 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26969/27014 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13535 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:10:02,309 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:10:02,309 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:10:02,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:10:02,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:10:02,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:10:02,310 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:10:02,310 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:10:02,310 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:10:02,343 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:10:02,344 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:02,344 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:10:02,344 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:10:02,344 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:10:02,344 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:02,345 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:10:02,345 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:10:02,345 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:02,345 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:02,371 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:10:02,371 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 00:10:02,372 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3133/3273 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2974 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:10:02,374 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:02,374 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:10:02,531 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:10:02,532 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 188 [2022-12-06 00:10:02,532 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:10:02,532 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:10:02,532 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:10:02,532 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:10:02,532 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable865 [2022-12-06 00:10:02,532 INFO L420 AbstractCegarLoop]: === Iteration 867 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:10:02,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:10:02,532 INFO L85 PathProgramCache]: Analyzing trace with hash 1971639674, now seen corresponding path program 1 times [2022-12-06 00:10:02,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:10:02,532 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057761639] [2022-12-06 00:10:02,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:10:02,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:10:02,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:10:02,602 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-06 00:10:02,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:10:02,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057761639] [2022-12-06 00:10:02,602 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1057761639] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:10:02,602 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:10:02,602 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:10:02,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563000238] [2022-12-06 00:10:02,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:10:02,602 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:10:02,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:10:02,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:10:02,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:10:02,603 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:10:02,603 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:10:02,603 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:10:02,603 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:10:02,603 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:10:02,907 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:10:02,907 INFO L131 PetriNetUnfolder]: For 27150/27195 co-relation queries the response was YES. [2022-12-06 00:10:02,913 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27150/27195 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13519 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:10:02,921 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:10:02,921 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:10:02,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:10:02,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:10:02,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:10:02,922 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:10:02,922 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:10:02,922 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:10:02,956 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:10:02,957 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:02,957 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:10:02,957 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:10:02,957 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:10:02,957 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:02,958 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:10:02,958 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:10:02,958 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:02,958 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:02,983 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:10:02,984 INFO L131 PetriNetUnfolder]: For 3167/3307 co-relation queries the response was YES. [2022-12-06 00:10:02,985 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3167/3307 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 3007 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:10:02,987 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:02,987 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:10:03,133 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:10:03,134 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 177 [2022-12-06 00:10:03,134 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:10:03,134 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:10:03,134 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:10:03,134 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:10:03,134 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable866 [2022-12-06 00:10:03,134 INFO L420 AbstractCegarLoop]: === Iteration 868 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:10:03,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:10:03,134 INFO L85 PathProgramCache]: Analyzing trace with hash -580517287, now seen corresponding path program 1 times [2022-12-06 00:10:03,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:10:03,135 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679564404] [2022-12-06 00:10:03,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:10:03,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:10:03,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:10:03,196 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-06 00:10:03,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:10:03,196 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679564404] [2022-12-06 00:10:03,196 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1679564404] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:10:03,196 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:10:03,196 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:10:03,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691595831] [2022-12-06 00:10:03,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:10:03,196 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:10:03,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:10:03,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:10:03,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:10:03,197 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:10:03,197 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:10:03,197 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:10:03,197 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:10:03,197 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:10:03,514 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:10:03,514 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 00:10:03,519 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26965/27010 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13558 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:10:03,525 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:10:03,525 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:10:03,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:10:03,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:10:03,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:10:03,526 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:10:03,526 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:10:03,526 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:10:03,558 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:10:03,559 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:03,559 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:10:03,559 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:10:03,559 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:10:03,559 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:03,560 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:10:03,560 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:10:03,560 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:03,560 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:03,585 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:10:03,585 INFO L131 PetriNetUnfolder]: For 3122/3262 co-relation queries the response was YES. [2022-12-06 00:10:03,586 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3122/3262 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2966 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:10:03,588 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:03,588 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:10:03,759 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:10:03,760 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 201 [2022-12-06 00:10:03,760 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:10:03,760 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:10:03,760 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:10:03,760 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:10:03,760 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable867 [2022-12-06 00:10:03,760 INFO L420 AbstractCegarLoop]: === Iteration 869 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:10:03,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:10:03,761 INFO L85 PathProgramCache]: Analyzing trace with hash 1162293048, now seen corresponding path program 1 times [2022-12-06 00:10:03,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:10:03,761 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158743814] [2022-12-06 00:10:03,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:10:03,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:10:03,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:10:03,836 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-06 00:10:03,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:10:03,837 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158743814] [2022-12-06 00:10:03,837 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1158743814] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:10:03,837 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:10:03,837 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:10:03,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51987682] [2022-12-06 00:10:03,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:10:03,837 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:10:03,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:10:03,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:10:03,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:10:03,838 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:10:03,838 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:10:03,838 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:10:03,838 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:10:03,838 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:10:04,114 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:10:04,114 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 00:10:04,119 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26969/27014 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13526 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:10:04,126 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:10:04,126 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:10:04,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:10:04,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:10:04,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:10:04,127 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:10:04,127 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:10:04,127 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:10:04,161 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:10:04,162 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:04,162 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:10:04,162 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:10:04,162 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:10:04,162 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:04,163 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:10:04,163 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:10:04,163 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:04,163 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:04,187 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:10:04,188 INFO L131 PetriNetUnfolder]: For 3146/3287 co-relation queries the response was YES. [2022-12-06 00:10:04,189 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3146/3287 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2967 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:10:04,190 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:04,191 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:10:04,344 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:10:04,344 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 182 [2022-12-06 00:10:04,344 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:10:04,344 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:10:04,344 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:10:04,344 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:10:04,344 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable868 [2022-12-06 00:10:04,345 INFO L420 AbstractCegarLoop]: === Iteration 870 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:10:04,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:10:04,345 INFO L85 PathProgramCache]: Analyzing trace with hash -1389863913, now seen corresponding path program 1 times [2022-12-06 00:10:04,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:10:04,345 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75405496] [2022-12-06 00:10:04,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:10:04,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:10:04,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:10:04,434 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-06 00:10:04,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:10:04,434 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75405496] [2022-12-06 00:10:04,434 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [75405496] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:10:04,435 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:10:04,435 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:10:04,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338352183] [2022-12-06 00:10:04,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:10:04,435 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:10:04,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:10:04,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:10:04,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:10:04,435 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:10:04,436 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:10:04,436 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:10:04,436 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:10:04,436 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:10:04,713 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:10:04,713 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:10:04,719 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13548 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:10:04,726 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:10:04,726 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:10:04,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:10:04,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:10:04,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:10:04,727 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:10:04,727 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:10:04,727 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:10:04,765 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:10:04,766 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:04,766 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:10:04,766 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:10:04,766 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:10:04,766 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:04,767 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:10:04,767 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:10:04,767 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:04,767 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:04,793 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:10:04,793 INFO L131 PetriNetUnfolder]: For 3309/3518 co-relation queries the response was YES. [2022-12-06 00:10:04,794 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3309/3518 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2979 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:10:04,796 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:04,796 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:10:04,944 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:10:04,944 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 178 [2022-12-06 00:10:04,944 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:10:04,945 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:10:04,945 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:10:04,945 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:10:04,945 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable869 [2022-12-06 00:10:04,945 INFO L420 AbstractCegarLoop]: === Iteration 871 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:10:04,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:10:04,945 INFO L85 PathProgramCache]: Analyzing trace with hash 352946422, now seen corresponding path program 1 times [2022-12-06 00:10:04,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:10:04,945 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193981270] [2022-12-06 00:10:04,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:10:04,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:10:04,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:10:05,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-06 00:10:05,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:10:05,007 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193981270] [2022-12-06 00:10:05,007 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [193981270] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:10:05,007 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:10:05,007 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:10:05,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316426208] [2022-12-06 00:10:05,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:10:05,007 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:10:05,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:10:05,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:10:05,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:10:05,008 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:10:05,008 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:10:05,008 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:10:05,008 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:10:05,008 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:10:05,326 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:10:05,326 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:10:05,332 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13543 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:10:05,340 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:10:05,340 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:10:05,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:10:05,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:10:05,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:10:05,348 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:10:05,348 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:10:05,348 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:10:05,388 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:10:05,389 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:05,389 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:10:05,389 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:10:05,389 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:10:05,389 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:05,390 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:10:05,390 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:10:05,390 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:05,390 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:05,417 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:10:05,417 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 00:10:05,418 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3312/3520 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2988 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:10:05,420 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:05,420 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:10:05,564 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:10:05,565 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 176 [2022-12-06 00:10:05,565 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:10:05,565 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:10:05,565 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:10:05,565 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:10:05,565 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable870 [2022-12-06 00:10:05,565 INFO L420 AbstractCegarLoop]: === Iteration 872 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:10:05,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:10:05,565 INFO L85 PathProgramCache]: Analyzing trace with hash 2095756757, now seen corresponding path program 1 times [2022-12-06 00:10:05,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:10:05,566 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312243183] [2022-12-06 00:10:05,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:10:05,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:10:05,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:10:05,640 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-06 00:10:05,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:10:05,640 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312243183] [2022-12-06 00:10:05,640 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1312243183] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:10:05,640 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:10:05,640 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:10:05,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133092985] [2022-12-06 00:10:05,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:10:05,640 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:10:05,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:10:05,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:10:05,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:10:05,641 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:10:05,641 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:10:05,641 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:10:05,641 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:10:05,641 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:10:05,940 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:10:05,940 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:10:05,946 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13562 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:10:05,957 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:10:05,957 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:10:05,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:10:05,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:10:05,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:10:05,958 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:10:05,958 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:10:05,958 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:10:06,000 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:10:06,001 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:06,002 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:10:06,002 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:10:06,002 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:10:06,002 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:06,002 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:10:06,002 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:10:06,002 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:06,003 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:06,033 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:10:06,034 INFO L131 PetriNetUnfolder]: For 3301/3509 co-relation queries the response was YES. [2022-12-06 00:10:06,035 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3301/3509 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2986 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:10:06,037 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:06,038 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:10:06,228 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:10:06,229 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 227 [2022-12-06 00:10:06,229 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:10:06,229 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:10:06,229 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:10:06,229 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:10:06,229 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable871 [2022-12-06 00:10:06,229 INFO L420 AbstractCegarLoop]: === Iteration 873 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:10:06,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:10:06,230 INFO L85 PathProgramCache]: Analyzing trace with hash -456400204, now seen corresponding path program 1 times [2022-12-06 00:10:06,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:10:06,230 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401209245] [2022-12-06 00:10:06,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:10:06,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:10:06,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:10:06,315 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-06 00:10:06,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:10:06,316 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401209245] [2022-12-06 00:10:06,316 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [401209245] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:10:06,316 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:10:06,316 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:10:06,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710627948] [2022-12-06 00:10:06,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:10:06,316 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:10:06,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:10:06,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:10:06,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:10:06,317 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:10:06,317 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:10:06,317 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:10:06,317 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:10:06,317 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:10:06,677 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:10:06,677 INFO L131 PetriNetUnfolder]: For 26955/27000 co-relation queries the response was YES. [2022-12-06 00:10:06,684 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26955/27000 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13525 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:10:06,694 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:10:06,694 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:10:06,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:10:06,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:10:06,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:10:06,695 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:10:06,695 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:10:06,695 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:10:06,739 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:10:06,740 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:06,740 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:10:06,740 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:10:06,740 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:10:06,740 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:06,741 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:10:06,741 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:10:06,741 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:06,742 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:06,772 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:10:06,772 INFO L131 PetriNetUnfolder]: For 3146/3287 co-relation queries the response was YES. [2022-12-06 00:10:06,774 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3146/3287 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2983 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:10:06,777 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:06,777 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:10:06,946 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:10:06,946 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 206 [2022-12-06 00:10:06,946 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:10:06,946 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:10:06,946 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:10:06,946 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:10:06,947 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable872 [2022-12-06 00:10:06,947 INFO L420 AbstractCegarLoop]: === Iteration 874 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:10:06,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:10:06,947 INFO L85 PathProgramCache]: Analyzing trace with hash 1286410131, now seen corresponding path program 1 times [2022-12-06 00:10:06,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:10:06,947 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652621978] [2022-12-06 00:10:06,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:10:06,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:10:06,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:10:07,030 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-06 00:10:07,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:10:07,031 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652621978] [2022-12-06 00:10:07,031 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1652621978] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:10:07,031 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:10:07,031 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:10:07,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520200572] [2022-12-06 00:10:07,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:10:07,031 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:10:07,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:10:07,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:10:07,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:10:07,032 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:10:07,032 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:10:07,032 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:10:07,032 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:10:07,032 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:10:07,368 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:10:07,368 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:10:07,374 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13537 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:10:07,382 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:10:07,383 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:10:07,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:10:07,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:10:07,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:10:07,387 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:10:07,388 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:10:07,388 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:10:07,428 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:10:07,429 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:07,429 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:10:07,429 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:10:07,430 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:10:07,430 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:07,430 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:10:07,430 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:10:07,430 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:07,431 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:07,463 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:10:07,463 INFO L131 PetriNetUnfolder]: For 3304/3511 co-relation queries the response was YES. [2022-12-06 00:10:07,464 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3304/3511 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2991 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:10:07,466 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:07,466 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:10:07,625 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:10:07,625 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 195 [2022-12-06 00:10:07,625 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:10:07,625 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:10:07,625 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:10:07,625 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:10:07,625 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable873 [2022-12-06 00:10:07,625 INFO L420 AbstractCegarLoop]: === Iteration 875 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:10:07,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:10:07,626 INFO L85 PathProgramCache]: Analyzing trace with hash -1265746830, now seen corresponding path program 1 times [2022-12-06 00:10:07,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:10:07,626 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165762324] [2022-12-06 00:10:07,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:10:07,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:10:07,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:10:07,698 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-06 00:10:07,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:10:07,698 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165762324] [2022-12-06 00:10:07,698 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [165762324] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:10:07,698 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:10:07,698 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:10:07,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119574526] [2022-12-06 00:10:07,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:10:07,699 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:10:07,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:10:07,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:10:07,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:10:07,699 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:10:07,699 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:10:07,699 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:10:07,699 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:10:07,699 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:10:08,057 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:10:08,058 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:10:08,066 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13571 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:10:08,076 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:10:08,077 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:10:08,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:10:08,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:10:08,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:10:08,078 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:10:08,078 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:10:08,078 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:10:08,128 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:10:08,129 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:08,129 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:10:08,130 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:10:08,130 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:10:08,130 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:08,130 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:10:08,130 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:10:08,130 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:08,131 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:08,163 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:10:08,163 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 00:10:08,165 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3321/3530 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2978 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:10:08,168 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:08,168 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:10:08,352 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:10:08,353 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 223 [2022-12-06 00:10:08,353 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:10:08,353 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:10:08,353 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:10:08,353 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:10:08,353 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable874 [2022-12-06 00:10:08,353 INFO L420 AbstractCegarLoop]: === Iteration 876 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:10:08,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:10:08,353 INFO L85 PathProgramCache]: Analyzing trace with hash 477063505, now seen corresponding path program 1 times [2022-12-06 00:10:08,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:10:08,353 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498000935] [2022-12-06 00:10:08,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:10:08,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:10:08,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:10:08,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-06 00:10:08,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:10:08,444 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498000935] [2022-12-06 00:10:08,444 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1498000935] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:10:08,444 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:10:08,444 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:10:08,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878845704] [2022-12-06 00:10:08,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:10:08,444 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:10:08,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:10:08,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:10:08,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:10:08,445 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:10:08,445 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:10:08,445 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:10:08,445 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:10:08,445 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:10:08,749 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:10:08,749 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:10:08,755 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13548 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:10:08,763 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:10:08,763 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:10:08,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:10:08,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:10:08,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:10:08,763 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:10:08,764 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:10:08,764 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:10:08,799 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:10:08,800 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:08,800 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:10:08,800 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:10:08,800 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:10:08,800 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:08,801 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:10:08,801 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:10:08,801 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:08,801 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:08,826 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:10:08,826 INFO L131 PetriNetUnfolder]: For 3318/3528 co-relation queries the response was YES. [2022-12-06 00:10:08,827 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3318/3528 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2973 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:10:08,829 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:08,829 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:10:08,981 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:10:08,982 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 182 [2022-12-06 00:10:08,982 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:10:08,982 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:10:08,982 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:10:08,982 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:10:08,982 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable875 [2022-12-06 00:10:08,982 INFO L420 AbstractCegarLoop]: === Iteration 877 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:10:08,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:10:08,982 INFO L85 PathProgramCache]: Analyzing trace with hash -2075093456, now seen corresponding path program 1 times [2022-12-06 00:10:08,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:10:08,983 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091383863] [2022-12-06 00:10:08,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:10:08,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:10:08,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:10:09,043 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-06 00:10:09,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:10:09,043 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091383863] [2022-12-06 00:10:09,043 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1091383863] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:10:09,043 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:10:09,043 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:10:09,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823511525] [2022-12-06 00:10:09,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:10:09,043 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:10:09,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:10:09,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:10:09,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:10:09,044 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:10:09,044 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:10:09,044 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:10:09,044 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:10:09,044 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:10:09,357 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:10:09,357 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 00:10:09,361 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26965/27010 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13534 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:10:09,368 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:10:09,368 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:10:09,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:10:09,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:10:09,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:10:09,368 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:10:09,369 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:10:09,369 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:10:09,401 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:10:09,402 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:09,402 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:10:09,402 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:10:09,402 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:10:09,402 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:09,403 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:10:09,403 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:10:09,403 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:09,403 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:09,427 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:10:09,428 INFO L131 PetriNetUnfolder]: For 3135/3276 co-relation queries the response was YES. [2022-12-06 00:10:09,429 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3135/3276 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2968 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:10:09,430 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:09,431 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:10:09,590 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:10:09,590 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 188 [2022-12-06 00:10:09,590 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:10:09,590 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:10:09,590 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:10:09,590 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:10:09,590 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable876 [2022-12-06 00:10:09,590 INFO L420 AbstractCegarLoop]: === Iteration 878 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:10:09,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:10:09,591 INFO L85 PathProgramCache]: Analyzing trace with hash -332283121, now seen corresponding path program 1 times [2022-12-06 00:10:09,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:10:09,591 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287024984] [2022-12-06 00:10:09,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:10:09,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:10:09,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:10:09,664 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-06 00:10:09,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:10:09,664 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287024984] [2022-12-06 00:10:09,664 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [287024984] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:10:09,664 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:10:09,664 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:10:09,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473436068] [2022-12-06 00:10:09,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:10:09,665 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:10:09,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:10:09,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:10:09,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:10:09,665 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:10:09,665 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:10:09,665 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:10:09,665 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:10:09,665 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:10:09,953 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:10:09,953 INFO L131 PetriNetUnfolder]: For 27136/27181 co-relation queries the response was YES. [2022-12-06 00:10:09,959 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27136/27181 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13523 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:10:09,967 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:10:09,968 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:10:09,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:10:09,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:10:09,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:10:09,968 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:10:09,969 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:10:09,969 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:10:10,009 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:10:10,010 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:10,010 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:10:10,011 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:10:10,011 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:10:10,011 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:10,011 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:10:10,011 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:10:10,012 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:10,012 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:10,049 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:10:10,050 INFO L131 PetriNetUnfolder]: For 3167/3307 co-relation queries the response was YES. [2022-12-06 00:10:10,051 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3167/3307 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 3001 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:10:10,054 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:10,054 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:10:10,216 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:10:10,217 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 206 [2022-12-06 00:10:10,217 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:10:10,217 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:10:10,217 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:10:10,217 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:10:10,217 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable877 [2022-12-06 00:10:10,217 INFO L420 AbstractCegarLoop]: === Iteration 879 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:10:10,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:10:10,217 INFO L85 PathProgramCache]: Analyzing trace with hash 1410527214, now seen corresponding path program 1 times [2022-12-06 00:10:10,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:10:10,217 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699588636] [2022-12-06 00:10:10,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:10:10,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:10:10,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:10:10,292 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-06 00:10:10,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:10:10,292 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699588636] [2022-12-06 00:10:10,292 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1699588636] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:10:10,292 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:10:10,292 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:10:10,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029917806] [2022-12-06 00:10:10,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:10:10,292 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:10:10,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:10:10,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:10:10,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:10:10,293 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:10:10,293 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:10:10,293 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:10:10,293 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:10:10,293 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:10:10,585 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:10:10,585 INFO L131 PetriNetUnfolder]: For 27146/27191 co-relation queries the response was YES. [2022-12-06 00:10:10,591 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27146/27191 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13523 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:10:10,599 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:10:10,599 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:10:10,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:10:10,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:10:10,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:10:10,600 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:10:10,600 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:10:10,600 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:10:10,635 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:10:10,636 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:10,636 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:10:10,636 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:10:10,636 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:10:10,636 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:10,637 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:10:10,637 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:10:10,637 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:10,638 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:10,665 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:10:10,666 INFO L131 PetriNetUnfolder]: For 3156/3296 co-relation queries the response was YES. [2022-12-06 00:10:10,667 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3156/3296 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2998 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:10:10,669 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:10,669 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:10:10,836 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:10:10,837 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 201 [2022-12-06 00:10:10,837 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:10:10,837 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:10:10,837 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:10:10,837 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:10:10,837 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable878 [2022-12-06 00:10:10,837 INFO L420 AbstractCegarLoop]: === Iteration 880 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:10:10,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:10:10,837 INFO L85 PathProgramCache]: Analyzing trace with hash -1141629747, now seen corresponding path program 1 times [2022-12-06 00:10:10,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:10:10,837 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369491830] [2022-12-06 00:10:10,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:10:10,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:10:10,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:10:10,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-06 00:10:10,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:10:10,912 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369491830] [2022-12-06 00:10:10,912 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [369491830] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:10:10,912 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:10:10,912 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:10:10,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047539993] [2022-12-06 00:10:10,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:10:10,912 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:10:10,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:10:10,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:10:10,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:10:10,912 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:10:10,912 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:10:10,912 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:10:10,912 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:10:10,912 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:10:11,233 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:10:11,233 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 00:10:11,238 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13571 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:10:11,243 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:10:11,243 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:10:11,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:10:11,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:10:11,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:10:11,244 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:10:11,244 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:10:11,244 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:10:11,275 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:10:11,277 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:11,277 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:10:11,277 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:10:11,277 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:10:11,277 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:11,277 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:10:11,277 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:10:11,278 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:11,278 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:11,303 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:10:11,303 INFO L131 PetriNetUnfolder]: For 3318/3528 co-relation queries the response was YES. [2022-12-06 00:10:11,304 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3318/3528 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2980 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:10:11,306 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:11,306 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:10:11,461 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:10:11,461 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 184 [2022-12-06 00:10:11,461 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:10:11,462 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:10:11,462 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:10:11,462 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:10:11,462 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable879 [2022-12-06 00:10:11,462 INFO L420 AbstractCegarLoop]: === Iteration 881 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:10:11,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:10:11,462 INFO L85 PathProgramCache]: Analyzing trace with hash 601180588, now seen corresponding path program 1 times [2022-12-06 00:10:11,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:10:11,462 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913915452] [2022-12-06 00:10:11,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:10:11,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:10:11,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:10:11,555 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-06 00:10:11,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:10:11,556 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913915452] [2022-12-06 00:10:11,556 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [913915452] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:10:11,556 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:10:11,556 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:10:11,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730356678] [2022-12-06 00:10:11,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:10:11,556 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:10:11,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:10:11,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:10:11,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:10:11,557 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:10:11,557 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:10:11,557 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:10:11,557 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:10:11,557 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:10:11,855 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:10:11,855 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:10:11,861 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13556 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:10:11,869 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:10:11,870 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:10:11,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:10:11,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:10:11,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:10:11,870 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:10:11,870 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:10:11,870 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:10:11,905 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:10:11,907 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:11,907 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:10:11,907 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:10:11,907 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:10:11,907 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:11,907 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:10:11,907 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:10:11,907 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:11,908 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:11,932 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:10:11,933 INFO L131 PetriNetUnfolder]: For 3338/3547 co-relation queries the response was YES. [2022-12-06 00:10:11,934 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3338/3547 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2985 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:10:11,936 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:11,936 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:10:12,095 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:10:12,095 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 188 [2022-12-06 00:10:12,095 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:10:12,095 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:10:12,095 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:10:12,095 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:10:12,095 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable880 [2022-12-06 00:10:12,095 INFO L420 AbstractCegarLoop]: === Iteration 882 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:10:12,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:10:12,096 INFO L85 PathProgramCache]: Analyzing trace with hash -1950976373, now seen corresponding path program 1 times [2022-12-06 00:10:12,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:10:12,096 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603475131] [2022-12-06 00:10:12,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:10:12,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:10:12,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:10:12,151 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-06 00:10:12,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:10:12,152 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603475131] [2022-12-06 00:10:12,152 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1603475131] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:10:12,152 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:10:12,152 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:10:12,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732673151] [2022-12-06 00:10:12,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:10:12,152 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:10:12,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:10:12,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:10:12,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:10:12,152 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:10:12,153 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:10:12,153 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:10:12,153 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:10:12,153 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:10:12,435 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:10:12,435 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 00:10:12,442 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26969/27014 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13516 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:10:12,450 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:10:12,450 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:10:12,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:10:12,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:10:12,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:10:12,451 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:10:12,451 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:10:12,451 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:10:12,490 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:10:12,491 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:12,491 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:10:12,491 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:10:12,492 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:10:12,492 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:12,492 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:10:12,492 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:10:12,492 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:12,493 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:12,517 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:10:12,517 INFO L131 PetriNetUnfolder]: For 3122/3262 co-relation queries the response was YES. [2022-12-06 00:10:12,518 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3122/3262 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2982 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:10:12,520 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:12,520 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:10:12,666 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:10:12,667 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 175 [2022-12-06 00:10:12,667 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:10:12,667 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:10:12,667 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:10:12,667 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:10:12,667 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable881 [2022-12-06 00:10:12,667 INFO L420 AbstractCegarLoop]: === Iteration 883 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:10:12,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:10:12,667 INFO L85 PathProgramCache]: Analyzing trace with hash -208166038, now seen corresponding path program 1 times [2022-12-06 00:10:12,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:10:12,668 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52105455] [2022-12-06 00:10:12,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:10:12,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:10:12,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:10:12,730 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-06 00:10:12,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:10:12,730 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52105455] [2022-12-06 00:10:12,730 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [52105455] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:10:12,730 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:10:12,730 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:10:12,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389617334] [2022-12-06 00:10:12,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:10:12,731 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:10:12,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:10:12,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:10:12,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:10:12,731 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:10:12,731 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:10:12,731 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:10:12,731 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:10:12,731 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:10:13,066 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:10:13,066 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 00:10:13,071 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13577 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:10:13,077 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:10:13,077 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:10:13,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:10:13,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:10:13,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:10:13,078 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:10:13,078 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:10:13,078 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:10:13,109 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:10:13,110 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:13,110 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:10:13,111 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:10:13,111 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:10:13,111 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:13,111 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:10:13,111 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:10:13,111 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:13,112 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:13,137 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:10:13,138 INFO L131 PetriNetUnfolder]: For 3301/3509 co-relation queries the response was YES. [2022-12-06 00:10:13,138 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3301/3509 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2988 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:10:13,140 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:13,140 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:10:13,285 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:10:13,285 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 174 [2022-12-06 00:10:13,285 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:10:13,285 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:10:13,285 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:10:13,285 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:10:13,285 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable882 [2022-12-06 00:10:13,285 INFO L420 AbstractCegarLoop]: === Iteration 884 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:10:13,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:10:13,286 INFO L85 PathProgramCache]: Analyzing trace with hash 1534644297, now seen corresponding path program 1 times [2022-12-06 00:10:13,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:10:13,286 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585937860] [2022-12-06 00:10:13,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:10:13,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:10:13,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:10:13,357 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-06 00:10:13,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:10:13,357 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585937860] [2022-12-06 00:10:13,357 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [585937860] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:10:13,357 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:10:13,357 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:10:13,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049745000] [2022-12-06 00:10:13,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:10:13,357 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:10:13,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:10:13,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:10:13,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:10:13,358 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:10:13,358 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:10:13,358 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:10:13,358 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:10:13,358 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:10:13,643 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:10:13,643 INFO L131 PetriNetUnfolder]: For 26955/27000 co-relation queries the response was YES. [2022-12-06 00:10:13,649 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26955/27000 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13534 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:10:13,656 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:10:13,656 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:10:13,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:10:13,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:10:13,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:10:13,657 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:10:13,657 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:10:13,657 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:10:13,693 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:10:13,694 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:13,694 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:10:13,694 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:10:13,694 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:10:13,694 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:13,695 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:10:13,695 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:10:13,695 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:13,695 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:13,719 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:10:13,719 INFO L131 PetriNetUnfolder]: For 3122/3262 co-relation queries the response was YES. [2022-12-06 00:10:13,720 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3122/3262 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2967 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:10:13,722 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:13,722 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:10:13,899 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:10:13,899 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 205 [2022-12-06 00:10:13,900 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:10:13,900 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:10:13,900 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:10:13,900 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:10:13,900 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable883 [2022-12-06 00:10:13,900 INFO L420 AbstractCegarLoop]: === Iteration 885 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:10:13,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:10:13,900 INFO L85 PathProgramCache]: Analyzing trace with hash -1017512664, now seen corresponding path program 1 times [2022-12-06 00:10:13,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:10:13,900 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23060275] [2022-12-06 00:10:13,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:10:13,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:10:13,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:10:13,968 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-06 00:10:13,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:10:13,969 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23060275] [2022-12-06 00:10:13,969 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [23060275] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:10:13,969 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:10:13,969 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:10:13,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907533482] [2022-12-06 00:10:13,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:10:13,969 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:10:13,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:10:13,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:10:13,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:10:13,970 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:10:13,970 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:10:13,970 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:10:13,970 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:10:13,970 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:10:14,303 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:10:14,303 INFO L131 PetriNetUnfolder]: For 27136/27181 co-relation queries the response was YES. [2022-12-06 00:10:14,314 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27136/27181 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13529 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:10:14,325 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:10:14,325 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:10:14,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:10:14,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:10:14,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:10:14,328 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:10:14,328 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:10:14,328 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:10:14,375 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:10:14,377 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:14,377 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:10:14,377 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:10:14,377 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:10:14,377 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:14,378 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:10:14,378 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:10:14,378 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:14,379 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:14,408 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:10:14,408 INFO L131 PetriNetUnfolder]: For 3174/3317 co-relation queries the response was YES. [2022-12-06 00:10:14,409 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3174/3317 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2997 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:10:14,411 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:14,411 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:10:14,561 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:10:14,561 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 184 [2022-12-06 00:10:14,561 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:10:14,561 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:10:14,561 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:10:14,561 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:10:14,561 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable884 [2022-12-06 00:10:14,562 INFO L420 AbstractCegarLoop]: === Iteration 886 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:10:14,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:10:14,562 INFO L85 PathProgramCache]: Analyzing trace with hash 725297671, now seen corresponding path program 1 times [2022-12-06 00:10:14,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:10:14,562 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237722294] [2022-12-06 00:10:14,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:10:14,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:10:14,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:10:14,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-06 00:10:14,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:10:14,637 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237722294] [2022-12-06 00:10:14,637 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [237722294] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:10:14,637 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:10:14,637 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:10:14,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503320310] [2022-12-06 00:10:14,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:10:14,637 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:10:14,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:10:14,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:10:14,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:10:14,638 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:10:14,638 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:10:14,638 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:10:14,638 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:10:14,638 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:10:14,963 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:10:14,964 INFO L131 PetriNetUnfolder]: For 26955/27000 co-relation queries the response was YES. [2022-12-06 00:10:14,968 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26955/27000 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13503 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:10:14,973 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:10:14,973 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:10:14,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:10:14,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:10:14,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:10:14,974 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:10:14,974 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:10:14,974 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:10:15,005 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:10:15,006 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:15,006 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:10:15,006 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:10:15,006 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:10:15,006 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:15,007 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:10:15,007 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:10:15,007 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:15,008 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:15,032 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:10:15,032 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 00:10:15,033 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3133/3273 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2979 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:10:15,035 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:15,035 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:10:15,189 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:10:15,189 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 183 [2022-12-06 00:10:15,189 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:10:15,189 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:10:15,189 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:10:15,189 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:10:15,189 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable885 [2022-12-06 00:10:15,189 INFO L420 AbstractCegarLoop]: === Iteration 887 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:10:15,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:10:15,190 INFO L85 PathProgramCache]: Analyzing trace with hash -1826859290, now seen corresponding path program 1 times [2022-12-06 00:10:15,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:10:15,190 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676459135] [2022-12-06 00:10:15,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:10:15,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:10:15,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:10:15,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-06 00:10:15,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:10:15,258 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676459135] [2022-12-06 00:10:15,258 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [676459135] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:10:15,258 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:10:15,258 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:10:15,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246468986] [2022-12-06 00:10:15,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:10:15,258 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:10:15,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:10:15,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:10:15,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:10:15,258 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:10:15,258 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:10:15,258 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:10:15,259 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:10:15,259 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:10:15,552 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:10:15,553 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:10:15,558 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13565 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:10:15,565 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:10:15,566 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:10:15,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:10:15,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:10:15,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:10:15,566 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:10:15,566 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:10:15,566 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:10:15,599 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:10:15,600 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:15,600 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:10:15,600 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:10:15,600 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:10:15,601 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:15,601 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:10:15,601 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:10:15,601 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:15,602 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:15,627 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:10:15,627 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 00:10:15,628 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3321/3530 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2983 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:10:15,630 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:15,630 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:10:15,776 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:10:15,776 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 176 [2022-12-06 00:10:15,776 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:10:15,776 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:10:15,776 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:10:15,776 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:10:15,776 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable886 [2022-12-06 00:10:15,776 INFO L420 AbstractCegarLoop]: === Iteration 888 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:10:15,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:10:15,777 INFO L85 PathProgramCache]: Analyzing trace with hash -84048955, now seen corresponding path program 1 times [2022-12-06 00:10:15,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:10:15,777 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343662675] [2022-12-06 00:10:15,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:10:15,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:10:15,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:10:15,846 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-06 00:10:15,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:10:15,846 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343662675] [2022-12-06 00:10:15,846 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [343662675] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:10:15,846 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:10:15,846 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:10:15,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171417348] [2022-12-06 00:10:15,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:10:15,847 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:10:15,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:10:15,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:10:15,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:10:15,847 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:10:15,847 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:10:15,847 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:10:15,847 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:10:15,847 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:10:16,122 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:10:16,123 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 00:10:16,128 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26969/27014 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13558 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:10:16,135 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:10:16,135 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:10:16,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:10:16,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:10:16,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:10:16,136 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:10:16,136 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:10:16,136 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:10:16,169 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:10:16,171 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:16,171 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:10:16,171 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:10:16,171 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:10:16,171 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:16,171 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:10:16,171 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:10:16,171 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:16,172 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:16,196 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:10:16,196 INFO L131 PetriNetUnfolder]: For 3112/3253 co-relation queries the response was YES. [2022-12-06 00:10:16,197 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3112/3253 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2978 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:10:16,199 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:16,199 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:10:16,344 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:10:16,345 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 174 [2022-12-06 00:10:16,345 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:10:16,345 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:10:16,345 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:10:16,345 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:10:16,345 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable887 [2022-12-06 00:10:16,345 INFO L420 AbstractCegarLoop]: === Iteration 889 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:10:16,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:10:16,345 INFO L85 PathProgramCache]: Analyzing trace with hash 1658761380, now seen corresponding path program 1 times [2022-12-06 00:10:16,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:10:16,345 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466446068] [2022-12-06 00:10:16,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:10:16,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:10:16,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:10:16,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-06 00:10:16,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:10:16,406 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466446068] [2022-12-06 00:10:16,406 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1466446068] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:10:16,406 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:10:16,406 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:10:16,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944784380] [2022-12-06 00:10:16,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:10:16,406 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:10:16,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:10:16,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:10:16,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:10:16,407 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:10:16,407 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:10:16,407 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:10:16,407 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:10:16,407 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:10:16,708 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:10:16,708 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 00:10:16,713 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13569 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:10:16,720 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:10:16,720 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:10:16,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:10:16,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:10:16,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:10:16,721 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:10:16,721 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:10:16,721 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:10:16,759 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:10:16,761 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:16,761 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:10:16,761 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:10:16,761 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:10:16,761 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:16,761 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:10:16,761 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:10:16,761 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:16,762 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:16,789 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:10:16,789 INFO L131 PetriNetUnfolder]: For 3348/3558 co-relation queries the response was YES. [2022-12-06 00:10:16,790 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3348/3558 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2986 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:10:16,792 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:16,792 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:10:16,938 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:10:16,938 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 177 [2022-12-06 00:10:16,938 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:10:16,938 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:10:16,938 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:10:16,938 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:10:16,938 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable888 [2022-12-06 00:10:16,938 INFO L420 AbstractCegarLoop]: === Iteration 890 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:10:16,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:10:16,939 INFO L85 PathProgramCache]: Analyzing trace with hash -893395581, now seen corresponding path program 1 times [2022-12-06 00:10:16,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:10:16,939 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811528968] [2022-12-06 00:10:16,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:10:16,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:10:16,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:10:17,008 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-06 00:10:17,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:10:17,008 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811528968] [2022-12-06 00:10:17,008 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1811528968] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:10:17,008 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:10:17,008 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:10:17,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811277243] [2022-12-06 00:10:17,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:10:17,009 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:10:17,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:10:17,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:10:17,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:10:17,009 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:10:17,009 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:10:17,009 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:10:17,009 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:10:17,009 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:10:17,287 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:10:17,287 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:10:17,292 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13557 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:10:17,300 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:10:17,300 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:10:17,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:10:17,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:10:17,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:10:17,301 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:10:17,301 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:10:17,301 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:10:17,337 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:10:17,338 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:17,338 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:10:17,338 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:10:17,338 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:10:17,338 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:17,339 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:10:17,339 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:10:17,339 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:17,339 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:17,363 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:10:17,363 INFO L131 PetriNetUnfolder]: For 3309/3518 co-relation queries the response was YES. [2022-12-06 00:10:17,364 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3309/3518 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2985 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:10:17,366 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:17,366 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:10:17,515 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:10:17,516 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 178 [2022-12-06 00:10:17,516 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:10:17,516 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:10:17,516 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:10:17,516 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:10:17,516 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable889 [2022-12-06 00:10:17,516 INFO L420 AbstractCegarLoop]: === Iteration 891 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:10:17,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:10:17,516 INFO L85 PathProgramCache]: Analyzing trace with hash 849414754, now seen corresponding path program 1 times [2022-12-06 00:10:17,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:10:17,516 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531643154] [2022-12-06 00:10:17,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:10:17,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:10:17,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:10:17,577 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-06 00:10:17,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:10:17,578 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531643154] [2022-12-06 00:10:17,578 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1531643154] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:10:17,578 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:10:17,578 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:10:17,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552454238] [2022-12-06 00:10:17,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:10:17,578 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:10:17,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:10:17,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:10:17,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:10:17,579 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:10:17,579 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:10:17,579 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:10:17,579 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:10:17,579 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:10:17,863 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:10:17,863 INFO L131 PetriNetUnfolder]: For 27229/27274 co-relation queries the response was YES. [2022-12-06 00:10:17,869 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27229/27274 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13566 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:10:17,875 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:10:17,875 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:10:17,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:10:17,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:10:17,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:10:17,876 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:10:17,876 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:10:17,876 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:10:17,910 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:10:17,911 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:17,911 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:10:17,911 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:10:17,912 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:10:17,912 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:17,912 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:10:17,912 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:10:17,912 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:17,913 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:17,937 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:10:17,937 INFO L131 PetriNetUnfolder]: For 3301/3509 co-relation queries the response was YES. [2022-12-06 00:10:17,938 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3301/3509 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2989 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:10:17,940 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:17,940 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:10:18,089 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:10:18,089 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 177 [2022-12-06 00:10:18,089 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:10:18,089 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:10:18,089 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:10:18,089 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:10:18,089 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable890 [2022-12-06 00:10:18,089 INFO L420 AbstractCegarLoop]: === Iteration 892 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:10:18,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:10:18,090 INFO L85 PathProgramCache]: Analyzing trace with hash -1702742207, now seen corresponding path program 1 times [2022-12-06 00:10:18,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:10:18,090 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45374413] [2022-12-06 00:10:18,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:10:18,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:10:18,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:10:18,157 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-06 00:10:18,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:10:18,157 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45374413] [2022-12-06 00:10:18,157 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [45374413] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:10:18,157 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:10:18,157 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:10:18,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677718433] [2022-12-06 00:10:18,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:10:18,158 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:10:18,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:10:18,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:10:18,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:10:18,158 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:10:18,158 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:10:18,158 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:10:18,158 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:10:18,158 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:10:18,457 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:10:18,457 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 00:10:18,462 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26969/27014 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13543 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:10:18,468 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:10:18,468 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:10:18,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:10:18,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:10:18,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:10:18,469 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:10:18,469 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:10:18,469 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:10:18,498 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:10:18,499 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:18,499 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:10:18,499 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:10:18,500 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:10:18,500 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:18,500 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:10:18,500 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:10:18,500 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:18,501 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:18,525 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:10:18,525 INFO L131 PetriNetUnfolder]: For 3122/3262 co-relation queries the response was YES. [2022-12-06 00:10:18,526 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3122/3262 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2969 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:10:18,528 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:18,528 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:10:18,677 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:10:18,678 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 178 [2022-12-06 00:10:18,678 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:10:18,678 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:10:18,678 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:10:18,678 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:10:18,678 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable891 [2022-12-06 00:10:18,678 INFO L420 AbstractCegarLoop]: === Iteration 893 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:10:18,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:10:18,678 INFO L85 PathProgramCache]: Analyzing trace with hash 40068128, now seen corresponding path program 1 times [2022-12-06 00:10:18,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:10:18,679 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68515119] [2022-12-06 00:10:18,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:10:18,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:10:18,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:10:18,742 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-06 00:10:18,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:10:18,743 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68515119] [2022-12-06 00:10:18,743 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [68515119] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:10:18,743 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:10:18,743 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:10:18,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837379391] [2022-12-06 00:10:18,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:10:18,743 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:10:18,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:10:18,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:10:18,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:10:18,744 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:10:18,744 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:10:18,744 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:10:18,744 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:10:18,744 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:10:19,020 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:10:19,021 INFO L131 PetriNetUnfolder]: For 27136/27181 co-relation queries the response was YES. [2022-12-06 00:10:19,026 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27136/27181 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13533 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:10:19,033 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:10:19,034 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:10:19,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:10:19,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:10:19,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:10:19,034 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:10:19,034 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:10:19,034 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:10:19,067 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:10:19,069 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:19,069 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:10:19,069 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:10:19,069 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:10:19,069 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:19,069 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:10:19,069 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:10:19,069 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:19,070 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:19,094 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:10:19,094 INFO L131 PetriNetUnfolder]: For 3180/3321 co-relation queries the response was YES. [2022-12-06 00:10:19,095 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3180/3321 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2996 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:10:19,096 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:19,097 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:10:19,241 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:10:19,242 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 173 [2022-12-06 00:10:19,242 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:10:19,242 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:10:19,242 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:10:19,242 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:10:19,242 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable892 [2022-12-06 00:10:19,242 INFO L420 AbstractCegarLoop]: === Iteration 894 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:10:19,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:10:19,242 INFO L85 PathProgramCache]: Analyzing trace with hash 1782878463, now seen corresponding path program 1 times [2022-12-06 00:10:19,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:10:19,242 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546983165] [2022-12-06 00:10:19,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:10:19,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:10:19,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:10:19,297 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-06 00:10:19,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:10:19,297 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546983165] [2022-12-06 00:10:19,298 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1546983165] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:10:19,298 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:10:19,298 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:10:19,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880144921] [2022-12-06 00:10:19,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:10:19,298 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:10:19,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:10:19,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:10:19,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:10:19,298 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:10:19,298 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:10:19,298 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:10:19,298 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:10:19,298 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:10:19,563 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:10:19,564 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:10:19,569 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13563 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:10:19,576 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:10:19,576 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:10:19,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:10:19,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:10:19,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:10:19,576 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:10:19,576 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:10:19,576 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:10:19,612 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:10:19,613 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:19,613 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:10:19,613 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:10:19,613 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:10:19,613 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:19,613 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:10:19,613 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:10:19,614 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:19,614 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:19,638 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:10:19,638 INFO L131 PetriNetUnfolder]: For 3309/3518 co-relation queries the response was YES. [2022-12-06 00:10:19,639 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3309/3518 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2983 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:10:19,640 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:19,641 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:10:19,785 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:10:19,785 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 172 [2022-12-06 00:10:19,785 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:10:19,785 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:10:19,785 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:10:19,786 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:10:19,786 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable893 [2022-12-06 00:10:19,786 INFO L420 AbstractCegarLoop]: === Iteration 895 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:10:19,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:10:19,786 INFO L85 PathProgramCache]: Analyzing trace with hash -769278498, now seen corresponding path program 1 times [2022-12-06 00:10:19,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:10:19,786 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783794624] [2022-12-06 00:10:19,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:10:19,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:10:19,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:10:19,846 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-06 00:10:19,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:10:19,847 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783794624] [2022-12-06 00:10:19,847 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1783794624] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:10:19,847 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:10:19,847 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:10:19,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22256964] [2022-12-06 00:10:19,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:10:19,847 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:10:19,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:10:19,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:10:19,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:10:19,847 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:10:19,847 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:10:19,847 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:10:19,848 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:10:19,848 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:10:20,113 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:10:20,113 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:10:20,118 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13564 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:10:20,153 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:10:20,154 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:10:20,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:10:20,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:10:20,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:10:20,154 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:10:20,154 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:10:20,154 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:10:20,184 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:10:20,185 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:20,185 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:10:20,185 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:10:20,185 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:10:20,185 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:20,185 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:10:20,186 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:10:20,186 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:20,186 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:20,212 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:10:20,212 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 00:10:20,213 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3321/3530 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2987 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:10:20,215 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:20,215 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:10:20,356 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:10:20,356 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 171 [2022-12-06 00:10:20,356 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:10:20,356 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:10:20,357 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:10:20,357 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:10:20,357 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable894 [2022-12-06 00:10:20,357 INFO L420 AbstractCegarLoop]: === Iteration 896 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:10:20,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:10:20,357 INFO L85 PathProgramCache]: Analyzing trace with hash 973531837, now seen corresponding path program 1 times [2022-12-06 00:10:20,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:10:20,357 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308217283] [2022-12-06 00:10:20,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:10:20,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:10:20,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:10:20,420 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-06 00:10:20,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:10:20,420 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308217283] [2022-12-06 00:10:20,420 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [308217283] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:10:20,420 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:10:20,420 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:10:20,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528528018] [2022-12-06 00:10:20,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:10:20,421 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:10:20,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:10:20,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:10:20,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:10:20,421 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:10:20,421 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:10:20,421 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:10:20,421 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:10:20,421 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:10:20,695 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:10:20,695 INFO L131 PetriNetUnfolder]: For 27146/27191 co-relation queries the response was YES. [2022-12-06 00:10:20,701 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27146/27191 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13556 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:10:20,709 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:10:20,709 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:10:20,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:10:20,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:10:20,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:10:20,709 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:10:20,709 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:10:20,710 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:10:20,743 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:10:20,744 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:20,744 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:10:20,744 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:10:20,744 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:10:20,744 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:20,745 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:10:20,745 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:10:20,745 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:20,745 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:20,769 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:10:20,770 INFO L131 PetriNetUnfolder]: For 3157/3298 co-relation queries the response was YES. [2022-12-06 00:10:20,771 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3157/3298 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 3006 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:10:20,772 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:20,773 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:10:20,925 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:10:20,925 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 181 [2022-12-06 00:10:20,925 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:10:20,925 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:10:20,925 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:10:20,925 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:10:20,925 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable895 [2022-12-06 00:10:20,925 INFO L420 AbstractCegarLoop]: === Iteration 897 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:10:20,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:10:20,926 INFO L85 PathProgramCache]: Analyzing trace with hash -1578625124, now seen corresponding path program 1 times [2022-12-06 00:10:20,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:10:20,926 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963623965] [2022-12-06 00:10:20,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:10:20,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:10:20,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:10:20,996 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-06 00:10:20,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:10:20,996 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963623965] [2022-12-06 00:10:20,996 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [963623965] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:10:20,996 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:10:20,996 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:10:20,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461574679] [2022-12-06 00:10:20,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:10:20,997 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:10:20,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:10:20,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:10:20,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:10:20,997 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:10:20,997 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:10:20,997 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:10:20,997 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:10:20,997 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:10:21,300 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:10:21,301 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 00:10:21,308 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13558 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:10:21,318 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:10:21,318 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:10:21,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:10:21,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:10:21,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:10:21,319 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:10:21,319 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:10:21,320 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:10:21,360 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:10:21,361 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:21,361 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:10:21,361 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:10:21,361 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:10:21,361 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:21,362 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:10:21,362 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:10:21,362 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:21,362 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:21,387 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:10:21,387 INFO L131 PetriNetUnfolder]: For 3338/3547 co-relation queries the response was YES. [2022-12-06 00:10:21,388 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3338/3547 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2981 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:10:21,390 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:21,390 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:10:21,534 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:10:21,534 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 173 [2022-12-06 00:10:21,534 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:10:21,534 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:10:21,534 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:10:21,534 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:10:21,534 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable896 [2022-12-06 00:10:21,535 INFO L420 AbstractCegarLoop]: === Iteration 898 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:10:21,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:10:21,535 INFO L85 PathProgramCache]: Analyzing trace with hash 164185211, now seen corresponding path program 1 times [2022-12-06 00:10:21,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:10:21,535 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195381374] [2022-12-06 00:10:21,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:10:21,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:10:21,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:10:21,606 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-06 00:10:21,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:10:21,606 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195381374] [2022-12-06 00:10:21,606 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [195381374] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:10:21,606 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:10:21,606 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:10:21,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745081904] [2022-12-06 00:10:21,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:10:21,607 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:10:21,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:10:21,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:10:21,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:10:21,607 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:10:21,607 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:10:21,607 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:10:21,607 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:10:21,607 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:10:21,894 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:10:21,894 INFO L131 PetriNetUnfolder]: For 27150/27195 co-relation queries the response was YES. [2022-12-06 00:10:21,929 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27150/27195 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13523 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:10:21,935 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:10:21,935 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:10:21,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:10:21,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:10:21,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:10:21,936 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:10:21,936 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:10:21,936 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:10:21,964 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:10:21,965 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:21,965 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:10:21,965 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:10:21,965 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:10:21,965 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:21,965 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:10:21,965 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:10:21,966 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:21,966 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:21,990 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:10:21,990 INFO L131 PetriNetUnfolder]: For 3156/3296 co-relation queries the response was YES. [2022-12-06 00:10:21,991 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3156/3296 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2987 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:10:21,993 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:21,993 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:10:22,132 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:10:22,133 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 168 [2022-12-06 00:10:22,133 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:10:22,133 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:10:22,133 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:10:22,133 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:10:22,133 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable897 [2022-12-06 00:10:22,133 INFO L420 AbstractCegarLoop]: === Iteration 899 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:10:22,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:10:22,133 INFO L85 PathProgramCache]: Analyzing trace with hash 1906995546, now seen corresponding path program 1 times [2022-12-06 00:10:22,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:10:22,133 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296463707] [2022-12-06 00:10:22,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:10:22,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:10:22,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:10:22,193 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-06 00:10:22,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:10:22,193 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296463707] [2022-12-06 00:10:22,193 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [296463707] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:10:22,193 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:10:22,193 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:10:22,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965274458] [2022-12-06 00:10:22,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:10:22,194 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:10:22,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:10:22,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:10:22,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:10:22,194 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:10:22,194 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:10:22,194 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:10:22,194 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:10:22,194 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:10:22,472 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:10:22,472 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 00:10:22,479 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13547 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:10:22,489 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:10:22,489 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:10:22,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:10:22,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:10:22,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:10:22,490 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:10:22,490 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:10:22,490 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:10:22,525 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:10:22,526 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:22,526 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:10:22,526 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:10:22,526 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:10:22,527 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:22,527 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:10:22,527 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:10:22,527 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:22,528 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:22,552 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:10:22,553 INFO L131 PetriNetUnfolder]: For 3310/3519 co-relation queries the response was YES. [2022-12-06 00:10:22,553 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3310/3519 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 3002 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:10:22,555 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:22,556 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:10:22,700 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:10:22,701 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 175 [2022-12-06 00:10:22,701 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:10:22,701 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:10:22,701 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:10:22,701 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:10:22,701 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable898 [2022-12-06 00:10:22,701 INFO L420 AbstractCegarLoop]: === Iteration 900 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:10:22,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:10:22,701 INFO L85 PathProgramCache]: Analyzing trace with hash -645161415, now seen corresponding path program 1 times [2022-12-06 00:10:22,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:10:22,702 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309448183] [2022-12-06 00:10:22,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:10:22,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:10:22,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:10:22,775 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-06 00:10:22,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:10:22,776 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309448183] [2022-12-06 00:10:22,776 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [309448183] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:10:22,776 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:10:22,776 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:10:22,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828995794] [2022-12-06 00:10:22,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:10:22,776 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:10:22,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:10:22,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:10:22,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:10:22,776 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:10:22,776 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:10:22,776 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:10:22,777 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:10:22,777 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:10:23,069 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:10:23,069 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 00:10:23,075 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13554 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:10:23,083 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:10:23,083 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:10:23,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:10:23,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:10:23,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:10:23,083 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:10:23,083 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:10:23,083 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:10:23,118 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:10:23,119 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:23,119 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:10:23,119 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:10:23,119 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:10:23,119 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:23,120 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:10:23,120 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:10:23,120 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:23,120 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:23,144 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:10:23,145 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 00:10:23,146 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3321/3530 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2986 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:10:23,148 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:23,148 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:10:23,303 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:10:23,303 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 184 [2022-12-06 00:10:23,303 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:10:23,304 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:10:23,304 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:10:23,304 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:10:23,304 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable899 [2022-12-06 00:10:23,304 INFO L420 AbstractCegarLoop]: === Iteration 901 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:10:23,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:10:23,304 INFO L85 PathProgramCache]: Analyzing trace with hash 1097648920, now seen corresponding path program 1 times [2022-12-06 00:10:23,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:10:23,304 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164341639] [2022-12-06 00:10:23,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:10:23,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:10:23,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:10:23,374 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-06 00:10:23,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:10:23,374 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164341639] [2022-12-06 00:10:23,374 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [164341639] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:10:23,374 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:10:23,374 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:10:23,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173424960] [2022-12-06 00:10:23,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:10:23,375 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:10:23,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:10:23,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:10:23,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:10:23,375 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:10:23,375 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:10:23,375 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:10:23,375 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:10:23,375 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:10:23,680 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:10:23,680 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 00:10:23,684 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26965/27010 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13533 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:10:23,690 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:10:23,690 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:10:23,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:10:23,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:10:23,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:10:23,691 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:10:23,691 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:10:23,691 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:10:23,721 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:10:23,722 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:23,722 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:10:23,722 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:10:23,722 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:10:23,722 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:23,722 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:10:23,722 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:10:23,723 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:23,723 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:23,747 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:10:23,747 INFO L131 PetriNetUnfolder]: For 3135/3276 co-relation queries the response was YES. [2022-12-06 00:10:23,748 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3135/3276 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2965 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:10:23,750 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:23,750 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:10:23,911 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:10:23,912 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 190 [2022-12-06 00:10:23,912 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:10:23,912 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:10:23,912 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:10:23,912 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:10:23,912 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable900 [2022-12-06 00:10:23,912 INFO L420 AbstractCegarLoop]: === Iteration 902 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:10:23,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:10:23,912 INFO L85 PathProgramCache]: Analyzing trace with hash -1454508041, now seen corresponding path program 1 times [2022-12-06 00:10:23,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:10:23,912 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917593660] [2022-12-06 00:10:23,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:10:23,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:10:23,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:10:23,987 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-06 00:10:23,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:10:23,987 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917593660] [2022-12-06 00:10:23,987 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [917593660] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:10:23,987 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:10:23,987 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:10:23,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808513590] [2022-12-06 00:10:23,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:10:23,988 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:10:23,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:10:23,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:10:23,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:10:23,988 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:10:23,988 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:10:23,988 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:10:23,988 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:10:23,988 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:10:24,260 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:10:24,261 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:10:24,266 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13559 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:10:24,273 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:10:24,273 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:10:24,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:10:24,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:10:24,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:10:24,274 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:10:24,274 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:10:24,274 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:10:24,309 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:10:24,311 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:24,311 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:10:24,311 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:10:24,311 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:10:24,311 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:24,311 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:10:24,311 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:10:24,312 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:24,312 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:24,336 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:10:24,337 INFO L131 PetriNetUnfolder]: For 3304/3511 co-relation queries the response was YES. [2022-12-06 00:10:24,337 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3304/3511 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2978 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:10:24,339 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:24,340 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:10:24,493 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:10:24,494 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 183 [2022-12-06 00:10:24,494 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:10:24,494 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:10:24,494 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:10:24,494 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:10:24,494 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable901 [2022-12-06 00:10:24,494 INFO L420 AbstractCegarLoop]: === Iteration 903 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:10:24,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:10:24,494 INFO L85 PathProgramCache]: Analyzing trace with hash 288302294, now seen corresponding path program 1 times [2022-12-06 00:10:24,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:10:24,494 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993292648] [2022-12-06 00:10:24,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:10:24,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:10:24,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:10:24,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-06 00:10:24,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:10:24,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993292648] [2022-12-06 00:10:24,561 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [993292648] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:10:24,561 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:10:24,561 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:10:24,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629535840] [2022-12-06 00:10:24,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:10:24,561 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:10:24,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:10:24,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:10:24,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:10:24,562 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:10:24,562 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:10:24,562 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:10:24,562 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:10:24,562 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:10:24,835 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:10:24,835 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:10:24,841 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13549 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:10:24,848 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:10:24,849 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:10:24,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:10:24,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:10:24,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:10:24,849 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:10:24,849 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:10:24,849 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:10:24,883 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:10:24,885 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:24,885 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:10:24,885 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:10:24,885 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:10:24,885 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:24,886 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:10:24,886 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:10:24,886 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:24,886 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:24,911 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:10:24,911 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 00:10:24,912 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3321/3530 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 3004 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:10:24,913 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:24,913 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:10:25,065 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:10:25,065 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 180 [2022-12-06 00:10:25,065 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:10:25,065 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:10:25,066 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:10:25,066 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:10:25,066 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable902 [2022-12-06 00:10:25,066 INFO L420 AbstractCegarLoop]: === Iteration 904 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:10:25,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:10:25,066 INFO L85 PathProgramCache]: Analyzing trace with hash 2031112629, now seen corresponding path program 1 times [2022-12-06 00:10:25,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:10:25,066 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344795773] [2022-12-06 00:10:25,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:10:25,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:10:25,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:10:25,125 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-06 00:10:25,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:10:25,126 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344795773] [2022-12-06 00:10:25,126 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1344795773] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:10:25,126 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:10:25,126 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:10:25,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624640805] [2022-12-06 00:10:25,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:10:25,126 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:10:25,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:10:25,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:10:25,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:10:25,126 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:10:25,126 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:10:25,126 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:10:25,126 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:10:25,126 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:10:25,438 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:10:25,438 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:10:25,443 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13569 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:10:25,448 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:10:25,448 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:10:25,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:10:25,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:10:25,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:10:25,449 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:10:25,449 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:10:25,449 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:10:25,479 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:10:25,480 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:25,480 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:10:25,480 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:10:25,480 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:10:25,480 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:25,481 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:10:25,481 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:10:25,481 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:25,481 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:25,505 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:10:25,505 INFO L131 PetriNetUnfolder]: For 3308/3518 co-relation queries the response was YES. [2022-12-06 00:10:25,506 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3308/3518 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2992 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:10:25,508 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:25,508 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:10:25,649 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:10:25,650 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 170 [2022-12-06 00:10:25,650 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:10:25,650 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:10:25,650 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:10:25,650 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:10:25,650 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable903 [2022-12-06 00:10:25,650 INFO L420 AbstractCegarLoop]: === Iteration 905 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:10:25,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:10:25,650 INFO L85 PathProgramCache]: Analyzing trace with hash -521044332, now seen corresponding path program 1 times [2022-12-06 00:10:25,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:10:25,650 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311992797] [2022-12-06 00:10:25,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:10:25,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:10:25,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:10:25,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-06 00:10:25,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:10:25,718 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311992797] [2022-12-06 00:10:25,718 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [311992797] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:10:25,718 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:10:25,718 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:10:25,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416036223] [2022-12-06 00:10:25,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:10:25,719 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:10:25,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:10:25,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:10:25,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:10:25,719 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:10:25,719 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:10:25,719 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:10:25,719 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:10:25,719 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:10:26,005 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:10:26,005 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 00:10:26,011 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26965/27010 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13528 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:10:26,018 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:10:26,018 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:10:26,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:10:26,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:10:26,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:10:26,018 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:10:26,018 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:10:26,018 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:10:26,054 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:10:26,056 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:26,056 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:10:26,056 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:10:26,056 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:10:26,056 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:26,056 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:10:26,056 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:10:26,056 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:26,057 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:26,083 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:10:26,083 INFO L131 PetriNetUnfolder]: For 3146/3287 co-relation queries the response was YES. [2022-12-06 00:10:26,084 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3146/3287 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2974 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:10:26,086 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:26,086 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:10:26,241 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:10:26,241 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 185 [2022-12-06 00:10:26,241 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:10:26,241 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:10:26,241 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:10:26,241 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:10:26,241 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable904 [2022-12-06 00:10:26,241 INFO L420 AbstractCegarLoop]: === Iteration 906 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:10:26,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:10:26,242 INFO L85 PathProgramCache]: Analyzing trace with hash 1221766003, now seen corresponding path program 1 times [2022-12-06 00:10:26,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:10:26,242 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713035694] [2022-12-06 00:10:26,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:10:26,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:10:26,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:10:26,309 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-06 00:10:26,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:10:26,310 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713035694] [2022-12-06 00:10:26,310 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [713035694] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:10:26,310 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:10:26,310 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:10:26,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550921126] [2022-12-06 00:10:26,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:10:26,310 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:10:26,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:10:26,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:10:26,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:10:26,310 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:10:26,310 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:10:26,310 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:10:26,310 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:10:26,310 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:10:26,600 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:10:26,601 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:10:26,607 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13572 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:10:26,616 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:10:26,616 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:10:26,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:10:26,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:10:26,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:10:26,617 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:10:26,617 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:10:26,617 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:10:26,660 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:10:26,661 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:26,661 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:10:26,661 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:10:26,661 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:10:26,662 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:26,662 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:10:26,662 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:10:26,662 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:26,663 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:26,696 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:10:26,696 INFO L131 PetriNetUnfolder]: For 3304/3511 co-relation queries the response was YES. [2022-12-06 00:10:26,698 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3304/3511 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2982 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:10:26,700 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:26,701 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:10:26,856 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:10:26,856 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 195 [2022-12-06 00:10:26,856 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:10:26,856 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:10:26,856 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:10:26,856 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:10:26,857 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable905 [2022-12-06 00:10:26,857 INFO L420 AbstractCegarLoop]: === Iteration 907 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:10:26,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:10:26,857 INFO L85 PathProgramCache]: Analyzing trace with hash -1330390958, now seen corresponding path program 1 times [2022-12-06 00:10:26,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:10:26,857 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954081837] [2022-12-06 00:10:26,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:10:26,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:10:26,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:10:26,918 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-06 00:10:26,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:10:26,919 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954081837] [2022-12-06 00:10:26,919 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [954081837] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:10:26,919 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:10:26,919 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:10:26,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925819424] [2022-12-06 00:10:26,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:10:26,919 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:10:26,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:10:26,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:10:26,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:10:26,919 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:10:26,919 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:10:26,919 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:10:26,920 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:10:26,920 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:10:27,231 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:10:27,231 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 00:10:27,236 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26969/27014 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13520 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:10:27,241 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:10:27,242 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:10:27,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:10:27,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:10:27,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:10:27,242 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:10:27,242 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:10:27,242 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:10:27,271 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:10:27,272 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:27,272 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:10:27,273 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:10:27,273 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:10:27,273 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:27,273 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:10:27,273 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:10:27,273 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:27,274 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:27,298 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:10:27,298 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 00:10:27,299 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3133/3273 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2968 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:10:27,301 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:27,301 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:10:27,449 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:10:27,449 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 176 [2022-12-06 00:10:27,449 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:10:27,449 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:10:27,449 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:10:27,449 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:10:27,449 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable906 [2022-12-06 00:10:27,449 INFO L420 AbstractCegarLoop]: === Iteration 908 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:10:27,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:10:27,450 INFO L85 PathProgramCache]: Analyzing trace with hash 412419377, now seen corresponding path program 1 times [2022-12-06 00:10:27,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:10:27,450 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366156710] [2022-12-06 00:10:27,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:10:27,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:10:27,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:10:27,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:10:27,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:10:27,516 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366156710] [2022-12-06 00:10:27,516 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1366156710] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:10:27,516 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:10:27,516 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:10:27,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008627177] [2022-12-06 00:10:27,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:10:27,516 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:10:27,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:10:27,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:10:27,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:10:27,517 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:10:27,517 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:10:27,517 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:10:27,517 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:10:27,517 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:10:27,789 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:10:27,789 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 00:10:27,795 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26969/27014 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13523 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:10:27,802 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:10:27,802 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:10:27,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:10:27,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:10:27,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:10:27,803 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:10:27,803 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:10:27,803 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:10:27,837 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:10:27,838 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:27,838 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:10:27,838 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:10:27,838 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:10:27,838 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:27,839 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:10:27,839 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:10:27,839 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:27,839 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:27,863 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:10:27,863 INFO L131 PetriNetUnfolder]: For 3123/3264 co-relation queries the response was YES. [2022-12-06 00:10:27,864 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3123/3264 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2972 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:10:27,865 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:27,866 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:10:28,023 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:10:28,024 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 186 [2022-12-06 00:10:28,024 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:10:28,024 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:10:28,024 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:10:28,024 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:10:28,024 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable907 [2022-12-06 00:10:28,024 INFO L420 AbstractCegarLoop]: === Iteration 909 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:10:28,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:10:28,024 INFO L85 PathProgramCache]: Analyzing trace with hash -2139737584, now seen corresponding path program 1 times [2022-12-06 00:10:28,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:10:28,024 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884207481] [2022-12-06 00:10:28,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:10:28,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:10:28,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:10:28,092 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-06 00:10:28,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:10:28,092 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884207481] [2022-12-06 00:10:28,092 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1884207481] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:10:28,093 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:10:28,093 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:10:28,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871379994] [2022-12-06 00:10:28,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:10:28,093 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:10:28,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:10:28,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:10:28,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:10:28,093 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:10:28,093 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:10:28,093 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:10:28,093 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:10:28,093 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:10:28,377 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:10:28,378 INFO L131 PetriNetUnfolder]: For 26955/27000 co-relation queries the response was YES. [2022-12-06 00:10:28,383 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26955/27000 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13522 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:10:28,390 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:10:28,390 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:10:28,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:10:28,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:10:28,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:10:28,391 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:10:28,391 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:10:28,391 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:10:28,425 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:10:28,426 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:28,426 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:10:28,426 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:10:28,426 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:10:28,426 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:28,427 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:10:28,427 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:10:28,427 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:28,427 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:28,453 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:10:28,453 INFO L131 PetriNetUnfolder]: For 3135/3276 co-relation queries the response was YES. [2022-12-06 00:10:28,454 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3135/3276 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2982 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:10:28,457 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:28,457 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:10:28,603 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:10:28,604 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 178 [2022-12-06 00:10:28,604 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:10:28,604 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:10:28,604 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:10:28,604 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:10:28,604 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable908 [2022-12-06 00:10:28,604 INFO L420 AbstractCegarLoop]: === Iteration 910 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:10:28,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:10:28,604 INFO L85 PathProgramCache]: Analyzing trace with hash -396927249, now seen corresponding path program 1 times [2022-12-06 00:10:28,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:10:28,605 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992891364] [2022-12-06 00:10:28,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:10:28,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:10:28,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:10:28,664 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-06 00:10:28,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:10:28,664 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992891364] [2022-12-06 00:10:28,664 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [992891364] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:10:28,664 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:10:28,664 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:10:28,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263509574] [2022-12-06 00:10:28,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:10:28,664 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:10:28,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:10:28,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:10:28,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:10:28,665 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:10:28,665 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:10:28,665 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:10:28,665 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:10:28,665 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:10:28,948 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:10:28,948 INFO L131 PetriNetUnfolder]: For 26955/27000 co-relation queries the response was YES. [2022-12-06 00:10:28,953 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26955/27000 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13527 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:10:28,988 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:10:28,988 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:10:28,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:10:28,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:10:28,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:10:28,989 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:10:28,989 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:10:28,989 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:10:29,020 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:10:29,021 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:29,021 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:10:29,021 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:10:29,021 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:10:29,021 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:29,022 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:10:29,022 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:10:29,022 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:29,022 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:29,046 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:10:29,046 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 00:10:29,047 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3133/3273 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2979 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:10:29,049 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:29,049 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:10:29,196 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:10:29,197 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 176 [2022-12-06 00:10:29,197 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:10:29,197 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:10:29,197 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:10:29,197 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:10:29,197 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable909 [2022-12-06 00:10:29,197 INFO L420 AbstractCegarLoop]: === Iteration 911 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:10:29,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:10:29,197 INFO L85 PathProgramCache]: Analyzing trace with hash 1345883086, now seen corresponding path program 1 times [2022-12-06 00:10:29,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:10:29,197 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160076051] [2022-12-06 00:10:29,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:10:29,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:10:29,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:10:29,268 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-06 00:10:29,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:10:29,269 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160076051] [2022-12-06 00:10:29,269 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [160076051] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:10:29,269 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:10:29,269 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:10:29,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861936094] [2022-12-06 00:10:29,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:10:29,269 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:10:29,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:10:29,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:10:29,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:10:29,269 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:10:29,269 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:10:29,269 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:10:29,269 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:10:29,270 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:10:29,551 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:10:29,551 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:10:29,556 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13556 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:10:29,563 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:10:29,564 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:10:29,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:10:29,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:10:29,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:10:29,564 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:10:29,564 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:10:29,564 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:10:29,599 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:10:29,600 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:29,600 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:10:29,600 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:10:29,600 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:10:29,601 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:29,601 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:10:29,601 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:10:29,601 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:29,602 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:29,625 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:10:29,625 INFO L131 PetriNetUnfolder]: For 3301/3509 co-relation queries the response was YES. [2022-12-06 00:10:29,626 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3301/3509 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2987 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:10:29,628 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:29,628 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:10:29,780 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:10:29,781 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 181 [2022-12-06 00:10:29,781 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:10:29,781 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:10:29,781 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:10:29,781 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:10:29,781 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable910 [2022-12-06 00:10:29,781 INFO L420 AbstractCegarLoop]: === Iteration 912 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:10:29,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:10:29,781 INFO L85 PathProgramCache]: Analyzing trace with hash -1206273875, now seen corresponding path program 1 times [2022-12-06 00:10:29,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:10:29,781 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663234293] [2022-12-06 00:10:29,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:10:29,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:10:29,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:10:29,842 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-06 00:10:29,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:10:29,842 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663234293] [2022-12-06 00:10:29,842 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [663234293] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:10:29,842 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:10:29,842 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:10:29,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81433556] [2022-12-06 00:10:29,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:10:29,842 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:10:29,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:10:29,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:10:29,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:10:29,843 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:10:29,843 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:10:29,843 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:10:29,843 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:10:29,843 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:10:30,140 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:10:30,140 INFO L131 PetriNetUnfolder]: For 27136/27181 co-relation queries the response was YES. [2022-12-06 00:10:30,146 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27136/27181 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13525 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:10:30,153 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:10:30,153 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:10:30,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:10:30,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:10:30,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:10:30,154 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:10:30,154 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:10:30,154 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:10:30,187 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:10:30,188 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:30,188 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:10:30,188 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:10:30,188 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:10:30,188 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:30,189 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:10:30,189 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:10:30,189 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:30,189 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:30,213 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:10:30,213 INFO L131 PetriNetUnfolder]: For 3167/3307 co-relation queries the response was YES. [2022-12-06 00:10:30,214 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3167/3307 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2998 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:10:30,216 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:30,216 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:10:30,359 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:10:30,359 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 171 [2022-12-06 00:10:30,360 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:10:30,360 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:10:30,360 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:10:30,360 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:10:30,360 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable911 [2022-12-06 00:10:30,360 INFO L420 AbstractCegarLoop]: === Iteration 913 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:10:30,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:10:30,360 INFO L85 PathProgramCache]: Analyzing trace with hash 536536460, now seen corresponding path program 1 times [2022-12-06 00:10:30,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:10:30,360 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004728523] [2022-12-06 00:10:30,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:10:30,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:10:30,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:10:30,422 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-06 00:10:30,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:10:30,422 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004728523] [2022-12-06 00:10:30,422 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2004728523] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:10:30,422 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:10:30,422 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:10:30,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812026260] [2022-12-06 00:10:30,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:10:30,423 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:10:30,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:10:30,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:10:30,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:10:30,423 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:10:30,423 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:10:30,423 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:10:30,423 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:10:30,423 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:10:30,682 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:10:30,683 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:10:30,687 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13535 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:10:30,722 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:10:30,722 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:10:30,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:10:30,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:10:30,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:10:30,723 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:10:30,723 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:10:30,723 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:10:30,752 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:10:30,753 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:30,753 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:10:30,754 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:10:30,754 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:10:30,754 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:30,754 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:10:30,754 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:10:30,754 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:30,755 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:30,779 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:10:30,779 INFO L131 PetriNetUnfolder]: For 3338/3547 co-relation queries the response was YES. [2022-12-06 00:10:30,780 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3338/3547 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2985 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:10:30,781 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:30,782 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:10:30,940 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:10:30,940 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 186 [2022-12-06 00:10:30,940 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:10:30,940 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:10:30,940 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:10:30,940 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:10:30,940 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable912 [2022-12-06 00:10:30,940 INFO L420 AbstractCegarLoop]: === Iteration 914 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:10:30,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:10:30,941 INFO L85 PathProgramCache]: Analyzing trace with hash -2015620501, now seen corresponding path program 1 times [2022-12-06 00:10:30,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:10:30,941 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223458846] [2022-12-06 00:10:30,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:10:30,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:10:30,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:10:31,017 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-06 00:10:31,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:10:31,017 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223458846] [2022-12-06 00:10:31,017 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [223458846] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:10:31,017 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:10:31,017 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:10:31,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774586718] [2022-12-06 00:10:31,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:10:31,018 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:10:31,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:10:31,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:10:31,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:10:31,018 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:10:31,018 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:10:31,018 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:10:31,018 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:10:31,018 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:10:31,293 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:10:31,293 INFO L131 PetriNetUnfolder]: For 27150/27195 co-relation queries the response was YES. [2022-12-06 00:10:31,299 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27150/27195 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13528 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:10:31,305 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:10:31,305 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:10:31,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:10:31,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:10:31,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:10:31,306 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:10:31,306 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:10:31,306 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:10:31,338 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:10:31,339 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:31,340 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:10:31,340 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:10:31,340 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:10:31,340 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:31,340 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:10:31,340 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:10:31,340 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:31,341 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:31,364 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:10:31,364 INFO L131 PetriNetUnfolder]: For 3167/3307 co-relation queries the response was YES. [2022-12-06 00:10:31,365 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3167/3307 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2997 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:10:31,367 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:31,367 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:10:31,509 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:10:31,510 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 170 [2022-12-06 00:10:31,510 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:10:31,510 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:10:31,510 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:10:31,510 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:10:31,510 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable913 [2022-12-06 00:10:31,510 INFO L420 AbstractCegarLoop]: === Iteration 915 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:10:31,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:10:31,510 INFO L85 PathProgramCache]: Analyzing trace with hash -272810166, now seen corresponding path program 1 times [2022-12-06 00:10:31,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:10:31,510 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563755158] [2022-12-06 00:10:31,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:10:31,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:10:31,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:10:31,580 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-06 00:10:31,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:10:31,580 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563755158] [2022-12-06 00:10:31,580 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1563755158] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:10:31,580 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:10:31,580 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:10:31,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5551786] [2022-12-06 00:10:31,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:10:31,580 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:10:31,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:10:31,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:10:31,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:10:31,581 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:10:31,581 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:10:31,581 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:10:31,581 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:10:31,581 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:10:31,856 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:10:31,857 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:10:31,861 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13545 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:10:31,868 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:10:31,868 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:10:31,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:10:31,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:10:31,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:10:31,869 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:10:31,869 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:10:31,869 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:10:31,903 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:10:31,904 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:31,904 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:10:31,904 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:10:31,904 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:10:31,904 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:31,904 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:10:31,904 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:10:31,904 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:31,905 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:31,928 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:10:31,929 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 00:10:31,929 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3312/3520 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2977 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:10:31,931 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:31,931 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:10:32,072 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:10:32,072 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 168 [2022-12-06 00:10:32,072 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:10:32,072 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:10:32,072 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:10:32,072 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:10:32,072 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable914 [2022-12-06 00:10:32,072 INFO L420 AbstractCegarLoop]: === Iteration 916 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:10:32,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:10:32,073 INFO L85 PathProgramCache]: Analyzing trace with hash 1470000169, now seen corresponding path program 1 times [2022-12-06 00:10:32,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:10:32,073 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678750309] [2022-12-06 00:10:32,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:10:32,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:10:32,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:10:32,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-06 00:10:32,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:10:32,142 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678750309] [2022-12-06 00:10:32,142 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1678750309] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:10:32,142 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:10:32,142 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:10:32,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266586040] [2022-12-06 00:10:32,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:10:32,143 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:10:32,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:10:32,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:10:32,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:10:32,143 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:10:32,143 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:10:32,144 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:10:32,144 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:10:32,144 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:10:32,445 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:10:32,445 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 00:10:32,449 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26969/27014 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13502 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:10:32,455 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:10:32,455 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:10:32,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:10:32,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:10:32,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:10:32,455 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:10:32,456 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:10:32,456 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:10:32,487 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:10:32,488 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:32,488 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:10:32,488 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:10:32,488 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:10:32,488 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:32,488 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:10:32,489 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:10:32,489 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:32,489 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:32,513 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:10:32,513 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 00:10:32,513 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3133/3273 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2986 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:10:32,515 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:32,515 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:10:32,668 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:10:32,669 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 181 [2022-12-06 00:10:32,669 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:10:32,669 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:10:32,669 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:10:32,669 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:10:32,669 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable915 [2022-12-06 00:10:32,669 INFO L420 AbstractCegarLoop]: === Iteration 917 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:10:32,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:10:32,669 INFO L85 PathProgramCache]: Analyzing trace with hash -1082156792, now seen corresponding path program 1 times [2022-12-06 00:10:32,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:10:32,669 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139219169] [2022-12-06 00:10:32,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:10:32,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:10:32,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:10:32,742 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-06 00:10:32,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:10:32,743 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139219169] [2022-12-06 00:10:32,743 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1139219169] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:10:32,743 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:10:32,743 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:10:32,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492850976] [2022-12-06 00:10:32,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:10:32,743 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:10:32,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:10:32,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:10:32,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:10:32,744 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:10:32,744 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:10:32,744 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:10:32,744 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:10:32,744 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:10:33,019 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:10:33,020 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:10:33,024 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13569 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:10:33,031 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:10:33,031 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:10:33,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:10:33,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:10:33,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:10:33,032 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:10:33,032 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:10:33,032 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:10:33,064 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:10:33,065 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:33,066 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:10:33,066 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:10:33,066 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:10:33,066 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:33,066 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:10:33,066 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:10:33,066 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:33,067 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:33,090 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:10:33,091 INFO L131 PetriNetUnfolder]: For 3349/3561 co-relation queries the response was YES. [2022-12-06 00:10:33,091 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3349/3561 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2986 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:10:33,093 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:33,093 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:10:33,234 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:10:33,235 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 169 [2022-12-06 00:10:33,235 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:10:33,235 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:10:33,235 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:10:33,235 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:10:33,235 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable916 [2022-12-06 00:10:33,235 INFO L420 AbstractCegarLoop]: === Iteration 918 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:10:33,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:10:33,235 INFO L85 PathProgramCache]: Analyzing trace with hash 660653543, now seen corresponding path program 1 times [2022-12-06 00:10:33,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:10:33,235 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785428260] [2022-12-06 00:10:33,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:10:33,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:10:33,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:10:33,296 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-06 00:10:33,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:10:33,296 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785428260] [2022-12-06 00:10:33,296 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1785428260] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:10:33,296 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:10:33,296 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:10:33,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465068708] [2022-12-06 00:10:33,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:10:33,296 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:10:33,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:10:33,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:10:33,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:10:33,297 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:10:33,297 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:10:33,297 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:10:33,297 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:10:33,297 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:10:33,565 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:10:33,566 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 00:10:33,571 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26965/27010 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13512 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:10:33,577 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:10:33,577 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:10:33,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:10:33,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:10:33,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:10:33,578 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:10:33,578 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:10:33,578 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:10:33,611 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:10:33,612 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:33,612 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:10:33,612 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:10:33,612 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:10:33,612 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:33,613 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:10:33,613 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:10:33,613 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:33,613 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:33,637 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:10:33,637 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 00:10:33,638 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3133/3273 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2979 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:10:33,639 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:33,639 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:10:33,789 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:10:33,790 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 178 [2022-12-06 00:10:33,790 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:10:33,790 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:10:33,790 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:10:33,790 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:10:33,790 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable917 [2022-12-06 00:10:33,790 INFO L420 AbstractCegarLoop]: === Iteration 919 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:10:33,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:10:33,790 INFO L85 PathProgramCache]: Analyzing trace with hash -1891503418, now seen corresponding path program 1 times [2022-12-06 00:10:33,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:10:33,790 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884743057] [2022-12-06 00:10:33,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:10:33,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:10:33,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:10:33,858 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-06 00:10:33,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:10:33,858 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884743057] [2022-12-06 00:10:33,858 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1884743057] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:10:33,858 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:10:33,858 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:10:33,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434908756] [2022-12-06 00:10:33,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:10:33,859 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:10:33,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:10:33,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:10:33,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:10:33,859 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:10:33,859 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:10:33,859 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:10:33,859 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:10:33,859 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:10:34,164 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:10:34,164 INFO L131 PetriNetUnfolder]: For 27229/27274 co-relation queries the response was YES. [2022-12-06 00:10:34,169 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27229/27274 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13564 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:10:34,174 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:10:34,174 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:10:34,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:10:34,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:10:34,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:10:34,175 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:10:34,175 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:10:34,175 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:10:34,208 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:10:34,209 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:34,209 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:10:34,209 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:10:34,209 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:10:34,209 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:34,210 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:10:34,210 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:10:34,210 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:34,210 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:34,239 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:10:34,239 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 00:10:34,240 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3321/3530 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2984 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:10:34,242 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:34,242 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:10:34,401 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:10:34,402 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 193 [2022-12-06 00:10:34,402 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:10:34,402 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:10:34,402 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:10:34,402 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:10:34,402 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable918 [2022-12-06 00:10:34,402 INFO L420 AbstractCegarLoop]: === Iteration 920 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:10:34,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:10:34,402 INFO L85 PathProgramCache]: Analyzing trace with hash -148693083, now seen corresponding path program 1 times [2022-12-06 00:10:34,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:10:34,402 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579828099] [2022-12-06 00:10:34,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:10:34,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:10:34,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:10:34,462 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-06 00:10:34,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:10:34,463 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579828099] [2022-12-06 00:10:34,463 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1579828099] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:10:34,463 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:10:34,463 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:10:34,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692652448] [2022-12-06 00:10:34,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:10:34,463 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:10:34,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:10:34,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:10:34,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:10:34,463 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:10:34,463 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:10:34,463 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:10:34,464 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:10:34,464 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:10:34,756 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:10:34,756 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 00:10:34,761 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26969/27014 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13517 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:10:34,768 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:10:34,769 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:10:34,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:10:34,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:10:34,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:10:34,769 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:10:34,769 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:10:34,769 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:10:34,804 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:10:34,806 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:34,806 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:10:34,806 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:10:34,806 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:10:34,806 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:34,806 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:10:34,806 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:10:34,806 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:34,807 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:34,833 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:10:34,833 INFO L131 PetriNetUnfolder]: For 3122/3262 co-relation queries the response was YES. [2022-12-06 00:10:34,834 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3122/3262 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2967 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:10:34,835 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:34,835 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:10:34,996 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:10:34,996 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 190 [2022-12-06 00:10:34,996 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:10:34,996 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:10:34,996 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:10:34,996 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:10:34,996 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable919 [2022-12-06 00:10:34,996 INFO L420 AbstractCegarLoop]: === Iteration 921 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:10:34,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:10:34,997 INFO L85 PathProgramCache]: Analyzing trace with hash 1594117252, now seen corresponding path program 1 times [2022-12-06 00:10:34,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:10:34,997 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422103803] [2022-12-06 00:10:34,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:10:34,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:10:35,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:10:35,072 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-06 00:10:35,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:10:35,072 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422103803] [2022-12-06 00:10:35,072 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [422103803] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:10:35,072 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:10:35,072 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:10:35,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948706616] [2022-12-06 00:10:35,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:10:35,073 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:10:35,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:10:35,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:10:35,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:10:35,073 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:10:35,073 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:10:35,073 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:10:35,073 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:10:35,073 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:10:35,360 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:10:35,360 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:10:35,366 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13561 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:10:35,374 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:10:35,374 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:10:35,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:10:35,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:10:35,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:10:35,376 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:10:35,376 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:10:35,376 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:10:35,414 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:10:35,416 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:35,416 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:10:35,416 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:10:35,416 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:10:35,416 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:35,416 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:10:35,416 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:10:35,417 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:35,417 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:35,445 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:10:35,445 INFO L131 PetriNetUnfolder]: For 3338/3547 co-relation queries the response was YES. [2022-12-06 00:10:35,446 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3338/3547 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2977 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:10:35,448 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:35,448 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:10:35,611 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:10:35,611 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 195 [2022-12-06 00:10:35,611 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:10:35,611 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:10:35,611 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:10:35,611 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:10:35,611 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable920 [2022-12-06 00:10:35,611 INFO L420 AbstractCegarLoop]: === Iteration 922 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:10:35,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:10:35,612 INFO L85 PathProgramCache]: Analyzing trace with hash -958039709, now seen corresponding path program 1 times [2022-12-06 00:10:35,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:10:35,612 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334917810] [2022-12-06 00:10:35,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:10:35,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:10:35,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:10:35,680 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-06 00:10:35,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:10:35,680 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334917810] [2022-12-06 00:10:35,680 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1334917810] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:10:35,680 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:10:35,680 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:10:35,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747675465] [2022-12-06 00:10:35,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:10:35,680 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:10:35,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:10:35,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:10:35,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:10:35,681 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:10:35,681 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:10:35,681 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:10:35,681 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:10:35,681 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:10:35,991 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:10:35,991 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:10:35,996 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13540 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:10:36,001 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:10:36,001 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:10:36,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:10:36,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:10:36,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:10:36,002 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:10:36,002 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:10:36,002 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:10:36,034 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:10:36,035 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:36,035 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:10:36,035 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:10:36,035 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:10:36,036 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:36,036 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:10:36,036 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:10:36,036 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:36,037 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:36,062 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:10:36,063 INFO L131 PetriNetUnfolder]: For 3293/3500 co-relation queries the response was YES. [2022-12-06 00:10:36,063 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3293/3500 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2998 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:10:36,065 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:36,065 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:10:36,221 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:10:36,221 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 186 [2022-12-06 00:10:36,222 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:10:36,222 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:10:36,222 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:10:36,222 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:10:36,222 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable921 [2022-12-06 00:10:36,222 INFO L420 AbstractCegarLoop]: === Iteration 923 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:10:36,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:10:36,222 INFO L85 PathProgramCache]: Analyzing trace with hash 784770626, now seen corresponding path program 1 times [2022-12-06 00:10:36,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:10:36,222 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962314086] [2022-12-06 00:10:36,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:10:36,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:10:36,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:10:36,305 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-06 00:10:36,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:10:36,305 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962314086] [2022-12-06 00:10:36,305 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1962314086] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:10:36,305 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:10:36,305 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:10:36,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942051625] [2022-12-06 00:10:36,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:10:36,306 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:10:36,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:10:36,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:10:36,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:10:36,306 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:10:36,306 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:10:36,306 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:10:36,306 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:10:36,306 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:10:36,579 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:10:36,579 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 00:10:36,584 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13569 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:10:36,591 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:10:36,591 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:10:36,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:10:36,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:10:36,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:10:36,592 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:10:36,592 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:10:36,592 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:10:36,626 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:10:36,627 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:36,627 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:10:36,627 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:10:36,627 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:10:36,627 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:36,627 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:10:36,627 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:10:36,627 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:36,628 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:36,652 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:10:36,653 INFO L131 PetriNetUnfolder]: For 3318/3528 co-relation queries the response was YES. [2022-12-06 00:10:36,653 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3318/3528 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2988 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:10:36,655 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:36,655 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:10:36,808 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:10:36,809 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 182 [2022-12-06 00:10:36,809 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:10:36,809 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:10:36,809 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:10:36,809 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:10:36,809 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable922 [2022-12-06 00:10:36,809 INFO L420 AbstractCegarLoop]: === Iteration 924 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:10:36,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:10:36,809 INFO L85 PathProgramCache]: Analyzing trace with hash -1767386335, now seen corresponding path program 1 times [2022-12-06 00:10:36,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:10:36,809 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449868608] [2022-12-06 00:10:36,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:10:36,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:10:36,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:10:36,894 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-06 00:10:36,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:10:36,894 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449868608] [2022-12-06 00:10:36,894 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1449868608] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:10:36,894 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:10:36,894 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:10:36,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092940438] [2022-12-06 00:10:36,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:10:36,894 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:10:36,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:10:36,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:10:36,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:10:36,895 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:10:36,895 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:10:36,895 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:10:36,895 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:10:36,895 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:10:37,186 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:10:37,187 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 00:10:37,192 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26969/27014 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13528 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:10:37,199 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:10:37,199 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:10:37,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:10:37,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:10:37,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:10:37,200 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:10:37,200 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:10:37,200 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:10:37,236 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:10:37,237 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:37,237 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:10:37,237 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:10:37,237 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:10:37,237 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:37,238 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:10:37,238 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:10:37,238 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:37,238 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:37,262 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:10:37,262 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 00:10:37,263 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3133/3273 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2978 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:10:37,264 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:37,265 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:10:37,413 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:10:37,413 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 176 [2022-12-06 00:10:37,413 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:10:37,413 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:10:37,413 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:10:37,413 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:10:37,413 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable923 [2022-12-06 00:10:37,413 INFO L420 AbstractCegarLoop]: === Iteration 925 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:10:37,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:10:37,414 INFO L85 PathProgramCache]: Analyzing trace with hash -24576000, now seen corresponding path program 1 times [2022-12-06 00:10:37,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:10:37,414 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992503609] [2022-12-06 00:10:37,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:10:37,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:10:37,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:10:37,470 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-06 00:10:37,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:10:37,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992503609] [2022-12-06 00:10:37,471 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [992503609] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:10:37,471 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:10:37,471 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:10:37,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917384692] [2022-12-06 00:10:37,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:10:37,471 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:10:37,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:10:37,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:10:37,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:10:37,471 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:10:37,471 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:10:37,471 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:10:37,472 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:10:37,472 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:10:37,769 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:10:37,769 INFO L131 PetriNetUnfolder]: For 27229/27274 co-relation queries the response was YES. [2022-12-06 00:10:37,773 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27229/27274 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13570 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:10:37,779 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:10:37,779 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:10:37,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:10:37,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:10:37,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:10:37,779 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:10:37,780 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:10:37,780 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:10:37,808 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:10:37,809 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:37,809 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:10:37,809 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:10:37,809 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:10:37,809 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:37,810 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:10:37,810 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:10:37,810 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:37,810 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:37,834 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:10:37,834 INFO L131 PetriNetUnfolder]: For 3348/3558 co-relation queries the response was YES. [2022-12-06 00:10:37,835 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3348/3558 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2982 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:10:37,837 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:37,837 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:10:37,988 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:10:37,988 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 179 [2022-12-06 00:10:37,988 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:10:37,988 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:10:37,988 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:10:37,989 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:10:37,989 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable924 [2022-12-06 00:10:37,989 INFO L420 AbstractCegarLoop]: === Iteration 926 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:10:37,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:10:37,989 INFO L85 PathProgramCache]: Analyzing trace with hash 1718234335, now seen corresponding path program 1 times [2022-12-06 00:10:37,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:10:37,989 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829371416] [2022-12-06 00:10:37,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:10:37,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:10:38,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:10:38,056 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-06 00:10:38,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:10:38,056 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829371416] [2022-12-06 00:10:38,056 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [829371416] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:10:38,057 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:10:38,057 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:10:38,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532223691] [2022-12-06 00:10:38,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:10:38,057 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:10:38,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:10:38,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:10:38,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:10:38,057 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:10:38,057 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:10:38,057 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:10:38,057 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:10:38,057 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:10:38,327 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:10:38,327 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:10:38,333 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13543 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:10:38,340 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:10:38,340 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:10:38,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:10:38,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:10:38,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:10:38,341 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:10:38,341 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:10:38,341 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:10:38,374 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:10:38,375 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:38,375 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:10:38,375 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:10:38,375 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:10:38,375 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:38,376 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:10:38,376 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:10:38,376 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:38,376 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:38,402 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:10:38,402 INFO L131 PetriNetUnfolder]: For 3304/3511 co-relation queries the response was YES. [2022-12-06 00:10:38,402 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3304/3511 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2989 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:10:38,404 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:38,404 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:10:38,560 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:10:38,560 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 185 [2022-12-06 00:10:38,561 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:10:38,561 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:10:38,561 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:10:38,561 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:10:38,561 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable925 [2022-12-06 00:10:38,561 INFO L420 AbstractCegarLoop]: === Iteration 927 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:10:38,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:10:38,561 INFO L85 PathProgramCache]: Analyzing trace with hash -833922626, now seen corresponding path program 1 times [2022-12-06 00:10:38,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:10:38,561 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497484131] [2022-12-06 00:10:38,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:10:38,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:10:38,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:10:38,631 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-06 00:10:38,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:10:38,632 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497484131] [2022-12-06 00:10:38,632 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1497484131] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:10:38,632 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:10:38,632 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:10:38,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431458219] [2022-12-06 00:10:38,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:10:38,632 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:10:38,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:10:38,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:10:38,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:10:38,632 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:10:38,632 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:10:38,633 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:10:38,633 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:10:38,633 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:10:38,909 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:10:38,909 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:10:38,914 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13570 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:10:38,921 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:10:38,921 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:10:38,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:10:38,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:10:38,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:10:38,921 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:10:38,921 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:10:38,922 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:10:38,954 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:10:38,955 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:38,955 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:10:38,955 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:10:38,956 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:10:38,956 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:38,956 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:10:38,956 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:10:38,956 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:38,957 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:38,980 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:10:38,980 INFO L131 PetriNetUnfolder]: For 3301/3509 co-relation queries the response was YES. [2022-12-06 00:10:38,981 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3301/3509 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2993 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:10:38,983 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:38,983 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:10:39,142 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:10:39,142 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 186 [2022-12-06 00:10:39,142 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:10:39,142 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:10:39,142 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:10:39,143 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:10:39,143 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable926 [2022-12-06 00:10:39,143 INFO L420 AbstractCegarLoop]: === Iteration 928 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:10:39,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:10:39,143 INFO L85 PathProgramCache]: Analyzing trace with hash 908887709, now seen corresponding path program 1 times [2022-12-06 00:10:39,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:10:39,143 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341697605] [2022-12-06 00:10:39,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:10:39,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:10:39,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:10:39,216 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-06 00:10:39,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:10:39,216 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341697605] [2022-12-06 00:10:39,216 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [341697605] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:10:39,216 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:10:39,216 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:10:39,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446028517] [2022-12-06 00:10:39,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:10:39,216 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:10:39,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:10:39,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:10:39,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:10:39,217 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:10:39,217 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:10:39,217 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:10:39,217 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:10:39,217 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:10:39,513 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:10:39,514 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 00:10:39,518 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13551 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:10:39,523 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:10:39,523 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:10:39,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:10:39,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:10:39,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:10:39,524 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:10:39,524 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:10:39,524 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:10:39,553 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:10:39,554 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:39,554 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:10:39,554 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:10:39,554 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:10:39,555 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:39,555 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:10:39,555 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:10:39,555 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:39,556 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:39,579 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:10:39,579 INFO L131 PetriNetUnfolder]: For 3307/3517 co-relation queries the response was YES. [2022-12-06 00:10:39,580 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3307/3517 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2976 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:10:39,582 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:39,582 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:10:39,733 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:10:39,733 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 179 [2022-12-06 00:10:39,733 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:10:39,733 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:10:39,733 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:10:39,733 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:10:39,733 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable927 [2022-12-06 00:10:39,733 INFO L420 AbstractCegarLoop]: === Iteration 929 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:10:39,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:10:39,734 INFO L85 PathProgramCache]: Analyzing trace with hash -1643269252, now seen corresponding path program 1 times [2022-12-06 00:10:39,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:10:39,734 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321439726] [2022-12-06 00:10:39,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:10:39,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:10:39,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:10:39,794 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-06 00:10:39,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:10:39,794 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321439726] [2022-12-06 00:10:39,794 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [321439726] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:10:39,795 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:10:39,795 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:10:39,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710614062] [2022-12-06 00:10:39,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:10:39,795 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:10:39,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:10:39,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:10:39,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:10:39,795 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:10:39,795 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:10:39,795 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:10:39,795 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:10:39,795 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:10:40,083 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:10:40,084 INFO L131 PetriNetUnfolder]: For 27136/27181 co-relation queries the response was YES. [2022-12-06 00:10:40,089 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27136/27181 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13509 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:10:40,096 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:10:40,096 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:10:40,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:10:40,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:10:40,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:10:40,097 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:10:40,097 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:10:40,097 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:10:40,128 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:10:40,129 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:40,129 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:10:40,129 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:10:40,129 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:10:40,129 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:40,129 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:10:40,130 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:10:40,130 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:40,130 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:40,153 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:10:40,154 INFO L131 PetriNetUnfolder]: For 3169/3310 co-relation queries the response was YES. [2022-12-06 00:10:40,154 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3169/3310 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2974 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:10:40,156 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:40,156 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:10:40,293 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:10:40,294 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 165 [2022-12-06 00:10:40,294 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:10:40,294 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:10:40,294 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:10:40,294 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:10:40,294 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable928 [2022-12-06 00:10:40,294 INFO L420 AbstractCegarLoop]: === Iteration 930 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:10:40,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:10:40,294 INFO L85 PathProgramCache]: Analyzing trace with hash 99541083, now seen corresponding path program 1 times [2022-12-06 00:10:40,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:10:40,294 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974445317] [2022-12-06 00:10:40,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:10:40,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:10:40,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:10:40,364 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-06 00:10:40,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:10:40,365 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974445317] [2022-12-06 00:10:40,365 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [974445317] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:10:40,365 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:10:40,365 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:10:40,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548730814] [2022-12-06 00:10:40,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:10:40,365 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:10:40,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:10:40,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:10:40,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:10:40,365 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:10:40,365 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:10:40,365 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:10:40,365 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:10:40,365 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:10:40,630 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:10:40,630 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 00:10:40,635 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13564 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:10:40,642 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:10:40,642 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:10:40,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:10:40,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:10:40,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:10:40,643 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:10:40,643 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:10:40,643 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:10:40,678 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:10:40,679 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:40,679 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:10:40,679 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:10:40,679 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:10:40,679 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:40,680 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:10:40,680 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:10:40,680 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:40,680 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:40,704 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:10:40,704 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 00:10:40,705 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3312/3520 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2989 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:10:40,707 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:40,707 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:10:40,853 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:10:40,853 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 174 [2022-12-06 00:10:40,853 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:10:40,853 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:10:40,853 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:10:40,853 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:10:40,853 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable929 [2022-12-06 00:10:40,853 INFO L420 AbstractCegarLoop]: === Iteration 931 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:10:40,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:10:40,853 INFO L85 PathProgramCache]: Analyzing trace with hash 1842351418, now seen corresponding path program 1 times [2022-12-06 00:10:40,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:10:40,854 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990597733] [2022-12-06 00:10:40,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:10:40,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:10:40,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:10:40,915 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-06 00:10:40,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:10:40,915 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990597733] [2022-12-06 00:10:40,915 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [990597733] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:10:40,915 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:10:40,915 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:10:40,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161529250] [2022-12-06 00:10:40,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:10:40,916 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:10:40,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:10:40,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:10:40,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:10:40,916 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:10:40,916 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:10:40,916 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:10:40,916 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:10:40,916 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:10:41,220 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:10:41,220 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:10:41,224 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13553 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:10:41,230 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:10:41,230 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:10:41,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:10:41,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:10:41,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:10:41,231 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:10:41,231 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:10:41,231 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:10:41,260 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:10:41,261 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:41,261 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:10:41,262 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:10:41,262 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:10:41,262 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:41,262 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:10:41,262 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:10:41,262 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:41,263 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:41,287 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:10:41,287 INFO L131 PetriNetUnfolder]: For 3307/3517 co-relation queries the response was YES. [2022-12-06 00:10:41,288 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3307/3517 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2987 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:10:41,290 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:41,290 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:10:41,441 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:10:41,441 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 179 [2022-12-06 00:10:41,441 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:10:41,441 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:10:41,441 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:10:41,441 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:10:41,442 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable930 [2022-12-06 00:10:41,442 INFO L420 AbstractCegarLoop]: === Iteration 932 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:10:41,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:10:41,442 INFO L85 PathProgramCache]: Analyzing trace with hash -709805543, now seen corresponding path program 1 times [2022-12-06 00:10:41,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:10:41,442 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308534895] [2022-12-06 00:10:41,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:10:41,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:10:41,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:10:41,512 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-06 00:10:41,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:10:41,512 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308534895] [2022-12-06 00:10:41,512 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1308534895] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:10:41,512 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:10:41,512 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:10:41,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601897383] [2022-12-06 00:10:41,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:10:41,512 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:10:41,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:10:41,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:10:41,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:10:41,513 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:10:41,513 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:10:41,513 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:10:41,513 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:10:41,513 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:10:41,799 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:10:41,799 INFO L131 PetriNetUnfolder]: For 27136/27181 co-relation queries the response was YES. [2022-12-06 00:10:41,804 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27136/27181 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13515 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:10:41,811 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:10:41,811 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:10:41,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:10:41,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:10:41,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:10:41,812 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:10:41,812 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:10:41,812 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:10:41,848 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:10:41,849 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:41,850 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:10:41,850 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:10:41,850 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:10:41,850 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:41,850 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:10:41,850 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:10:41,850 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:41,851 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:41,877 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:10:41,878 INFO L131 PetriNetUnfolder]: For 3167/3307 co-relation queries the response was YES. [2022-12-06 00:10:41,878 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3167/3307 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2978 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:10:41,881 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:41,881 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:10:42,025 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:10:42,025 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 175 [2022-12-06 00:10:42,025 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:10:42,025 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:10:42,025 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:10:42,026 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:10:42,026 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable931 [2022-12-06 00:10:42,026 INFO L420 AbstractCegarLoop]: === Iteration 933 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:10:42,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:10:42,026 INFO L85 PathProgramCache]: Analyzing trace with hash 1033004792, now seen corresponding path program 1 times [2022-12-06 00:10:42,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:10:42,026 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666135000] [2022-12-06 00:10:42,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:10:42,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:10:42,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:10:42,097 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-06 00:10:42,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:10:42,097 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666135000] [2022-12-06 00:10:42,097 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [666135000] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:10:42,097 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:10:42,097 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:10:42,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973892351] [2022-12-06 00:10:42,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:10:42,097 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:10:42,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:10:42,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:10:42,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:10:42,097 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:10:42,098 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:10:42,098 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:10:42,098 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:10:42,098 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:10:42,371 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:10:42,371 INFO L131 PetriNetUnfolder]: For 27146/27191 co-relation queries the response was YES. [2022-12-06 00:10:42,376 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27146/27191 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13526 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:10:42,383 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:10:42,383 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:10:42,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:10:42,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:10:42,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:10:42,384 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:10:42,384 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:10:42,384 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:10:42,415 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:10:42,416 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:42,416 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:10:42,416 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:10:42,416 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:10:42,416 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:42,417 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:10:42,417 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:10:42,417 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:42,417 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:42,441 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:10:42,441 INFO L131 PetriNetUnfolder]: For 3180/3321 co-relation queries the response was YES. [2022-12-06 00:10:42,442 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3180/3321 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 3006 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:10:42,444 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:42,444 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:10:42,604 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:10:42,605 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 189 [2022-12-06 00:10:42,605 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:10:42,605 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:10:42,605 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:10:42,605 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:10:42,605 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable932 [2022-12-06 00:10:42,605 INFO L420 AbstractCegarLoop]: === Iteration 934 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:10:42,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:10:42,606 INFO L85 PathProgramCache]: Analyzing trace with hash -1519152169, now seen corresponding path program 1 times [2022-12-06 00:10:42,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:10:42,606 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125876515] [2022-12-06 00:10:42,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:10:42,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:10:42,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:10:42,673 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-06 00:10:42,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:10:42,673 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125876515] [2022-12-06 00:10:42,673 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1125876515] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:10:42,673 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:10:42,673 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:10:42,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181707239] [2022-12-06 00:10:42,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:10:42,673 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:10:42,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:10:42,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:10:42,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:10:42,674 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:10:42,674 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:10:42,674 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:10:42,674 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:10:42,674 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:10:42,979 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:10:42,979 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:10:42,983 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13553 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:10:42,989 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:10:42,989 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:10:42,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:10:42,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:10:42,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:10:42,990 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:10:42,990 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:10:42,990 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:10:43,021 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:10:43,023 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:43,023 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:10:43,023 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:10:43,023 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:10:43,023 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:43,023 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:10:43,023 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:10:43,024 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:43,024 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:43,048 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:10:43,048 INFO L131 PetriNetUnfolder]: For 3301/3509 co-relation queries the response was YES. [2022-12-06 00:10:43,049 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3301/3509 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2982 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:10:43,051 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:43,051 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:10:43,211 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:10:43,212 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 189 [2022-12-06 00:10:43,212 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:10:43,212 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:10:43,212 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:10:43,212 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:10:43,212 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable933 [2022-12-06 00:10:43,212 INFO L420 AbstractCegarLoop]: === Iteration 935 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:10:43,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:10:43,212 INFO L85 PathProgramCache]: Analyzing trace with hash 223658166, now seen corresponding path program 1 times [2022-12-06 00:10:43,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:10:43,212 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426497788] [2022-12-06 00:10:43,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:10:43,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:10:43,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:10:43,274 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-06 00:10:43,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:10:43,274 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426497788] [2022-12-06 00:10:43,274 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1426497788] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:10:43,274 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:10:43,274 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:10:43,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721675598] [2022-12-06 00:10:43,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:10:43,274 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:10:43,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:10:43,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:10:43,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:10:43,275 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:10:43,275 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:10:43,275 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:10:43,275 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:10:43,275 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:10:43,547 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:10:43,547 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 00:10:43,552 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13563 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:10:43,559 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:10:43,559 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:10:43,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:10:43,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:10:43,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:10:43,560 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:10:43,560 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:10:43,560 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:10:43,593 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:10:43,594 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:43,594 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:10:43,594 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:10:43,594 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:10:43,594 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:43,594 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:10:43,594 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:10:43,595 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:43,595 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:43,618 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:10:43,618 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 00:10:43,619 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3312/3520 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2981 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:10:43,621 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:43,621 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:10:43,766 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:10:43,766 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 172 [2022-12-06 00:10:43,766 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:10:43,766 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:10:43,766 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:10:43,766 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:10:43,766 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable934 [2022-12-06 00:10:43,767 INFO L420 AbstractCegarLoop]: === Iteration 936 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:10:43,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:10:43,767 INFO L85 PathProgramCache]: Analyzing trace with hash 1966468501, now seen corresponding path program 1 times [2022-12-06 00:10:43,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:10:43,767 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957764483] [2022-12-06 00:10:43,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:10:43,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:10:43,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:10:43,821 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-06 00:10:43,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:10:43,821 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957764483] [2022-12-06 00:10:43,821 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1957764483] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:10:43,821 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:10:43,821 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:10:43,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49641290] [2022-12-06 00:10:43,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:10:43,821 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:10:43,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:10:43,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:10:43,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:10:43,822 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:10:43,822 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:10:43,822 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:10:43,822 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:10:43,822 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:10:44,099 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:10:44,099 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 00:10:44,105 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26969/27014 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13528 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:10:44,112 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:10:44,112 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:10:44,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:10:44,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:10:44,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:10:44,113 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:10:44,113 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:10:44,113 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:10:44,147 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:10:44,148 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:44,148 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:10:44,148 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:10:44,148 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:10:44,148 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:44,148 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:10:44,149 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:10:44,149 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:44,149 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:44,173 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:10:44,173 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 00:10:44,174 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3133/3273 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2979 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:10:44,176 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:44,176 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:10:44,339 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:10:44,339 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 191 [2022-12-06 00:10:44,340 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:10:44,340 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:10:44,340 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:10:44,340 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:10:44,340 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable935 [2022-12-06 00:10:44,340 INFO L420 AbstractCegarLoop]: === Iteration 937 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:10:44,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:10:44,340 INFO L85 PathProgramCache]: Analyzing trace with hash -585688460, now seen corresponding path program 1 times [2022-12-06 00:10:44,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:10:44,340 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134472590] [2022-12-06 00:10:44,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:10:44,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:10:44,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:10:44,407 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-06 00:10:44,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:10:44,407 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134472590] [2022-12-06 00:10:44,407 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2134472590] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:10:44,407 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:10:44,407 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:10:44,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54762149] [2022-12-06 00:10:44,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:10:44,408 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:10:44,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:10:44,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:10:44,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:10:44,408 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:10:44,408 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:10:44,408 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:10:44,408 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:10:44,408 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:10:44,708 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:10:44,709 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 00:10:44,713 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26965/27010 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13521 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:10:44,718 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:10:44,718 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:10:44,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:10:44,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:10:44,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:10:44,719 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:10:44,719 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:10:44,719 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:10:44,748 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:10:44,749 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:44,749 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:10:44,749 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:10:44,749 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:10:44,749 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:44,749 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:10:44,749 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:10:44,749 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:44,750 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:44,773 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:10:44,773 INFO L131 PetriNetUnfolder]: For 3135/3276 co-relation queries the response was YES. [2022-12-06 00:10:44,774 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3135/3276 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2967 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:10:44,776 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:44,776 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:10:44,935 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:10:44,935 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 186 [2022-12-06 00:10:44,935 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:10:44,935 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:10:44,935 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:10:44,935 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:10:44,935 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable936 [2022-12-06 00:10:44,935 INFO L420 AbstractCegarLoop]: === Iteration 938 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:10:44,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:10:44,936 INFO L85 PathProgramCache]: Analyzing trace with hash 1157121875, now seen corresponding path program 1 times [2022-12-06 00:10:44,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:10:44,936 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782301026] [2022-12-06 00:10:44,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:10:44,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:10:44,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:10:44,991 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-06 00:10:44,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:10:44,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782301026] [2022-12-06 00:10:44,991 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [782301026] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:10:44,991 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:10:44,991 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:10:44,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127897241] [2022-12-06 00:10:44,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:10:44,992 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:10:44,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:10:44,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:10:44,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:10:44,992 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:10:44,992 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:10:44,992 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:10:44,992 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:10:44,992 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:10:45,267 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:10:45,267 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 00:10:45,272 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13567 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:10:45,278 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:10:45,278 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:10:45,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:10:45,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:10:45,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:10:45,279 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:10:45,279 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:10:45,279 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:10:45,311 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:10:45,312 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:45,312 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:10:45,312 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:10:45,312 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:10:45,313 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:45,313 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:10:45,313 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:10:45,313 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:45,314 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:45,337 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:10:45,338 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 00:10:45,338 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3312/3520 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2995 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:10:45,340 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:45,340 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:10:45,479 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:10:45,480 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 168 [2022-12-06 00:10:45,480 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:10:45,480 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:10:45,480 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:10:45,480 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:10:45,480 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable937 [2022-12-06 00:10:45,480 INFO L420 AbstractCegarLoop]: === Iteration 939 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:10:45,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:10:45,480 INFO L85 PathProgramCache]: Analyzing trace with hash -1395035086, now seen corresponding path program 1 times [2022-12-06 00:10:45,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:10:45,480 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734766029] [2022-12-06 00:10:45,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:10:45,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:10:45,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:10:45,549 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-06 00:10:45,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:10:45,550 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734766029] [2022-12-06 00:10:45,550 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [734766029] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:10:45,550 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:10:45,550 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:10:45,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708226018] [2022-12-06 00:10:45,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:10:45,550 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:10:45,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:10:45,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:10:45,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:10:45,550 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:10:45,550 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:10:45,550 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:10:45,550 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:10:45,550 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:10:45,822 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:10:45,823 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 00:10:45,827 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26965/27010 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13535 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:10:45,833 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:10:45,834 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:10:45,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:10:45,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:10:45,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:10:45,834 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:10:45,834 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:10:45,834 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:10:45,868 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:10:45,869 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:45,869 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:10:45,870 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:10:45,870 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:10:45,870 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:45,870 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:10:45,870 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:10:45,870 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:45,871 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:45,894 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:10:45,894 INFO L131 PetriNetUnfolder]: For 3122/3262 co-relation queries the response was YES. [2022-12-06 00:10:45,895 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3122/3262 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2964 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:10:45,896 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:45,896 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:10:46,040 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:10:46,041 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 171 [2022-12-06 00:10:46,041 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:10:46,041 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:10:46,041 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:10:46,041 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:10:46,041 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable938 [2022-12-06 00:10:46,041 INFO L420 AbstractCegarLoop]: === Iteration 940 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:10:46,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:10:46,041 INFO L85 PathProgramCache]: Analyzing trace with hash 347775249, now seen corresponding path program 1 times [2022-12-06 00:10:46,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:10:46,041 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027826717] [2022-12-06 00:10:46,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:10:46,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:10:46,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:10:46,111 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-06 00:10:46,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:10:46,111 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027826717] [2022-12-06 00:10:46,111 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2027826717] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:10:46,111 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:10:46,111 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:10:46,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699480795] [2022-12-06 00:10:46,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:10:46,111 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:10:46,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:10:46,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:10:46,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:10:46,111 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:10:46,112 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:10:46,112 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:10:46,112 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:10:46,112 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:10:46,406 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:10:46,406 INFO L131 PetriNetUnfolder]: For 26955/27000 co-relation queries the response was YES. [2022-12-06 00:10:46,410 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26955/27000 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13529 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:10:46,415 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:10:46,415 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:10:46,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:10:46,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:10:46,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:10:46,416 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:10:46,416 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:10:46,416 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:10:46,446 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:10:46,447 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:46,447 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:10:46,447 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:10:46,447 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:10:46,447 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:46,447 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:10:46,447 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:10:46,447 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:46,448 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:46,472 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:10:46,472 INFO L131 PetriNetUnfolder]: For 3122/3262 co-relation queries the response was YES. [2022-12-06 00:10:46,473 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3122/3262 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2971 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:10:46,474 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:46,475 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:10:46,625 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:10:46,626 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 179 [2022-12-06 00:10:46,626 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:10:46,626 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:10:46,626 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:10:46,626 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:10:46,626 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable939 [2022-12-06 00:10:46,626 INFO L420 AbstractCegarLoop]: === Iteration 941 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:10:46,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:10:46,626 INFO L85 PathProgramCache]: Analyzing trace with hash 2090585584, now seen corresponding path program 1 times [2022-12-06 00:10:46,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:10:46,627 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603666097] [2022-12-06 00:10:46,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:10:46,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:10:46,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:10:46,686 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-06 00:10:46,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:10:46,686 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603666097] [2022-12-06 00:10:46,686 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [603666097] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:10:46,687 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:10:46,687 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:10:46,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405309694] [2022-12-06 00:10:46,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:10:46,687 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:10:46,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:10:46,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:10:46,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:10:46,687 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:10:46,687 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:10:46,687 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:10:46,687 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:10:46,687 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:10:46,948 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:10:46,949 INFO L131 PetriNetUnfolder]: For 27136/27181 co-relation queries the response was YES. [2022-12-06 00:10:46,953 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27136/27181 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13516 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:10:46,960 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:10:46,960 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:10:46,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:10:46,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:10:46,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:10:46,961 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:10:46,961 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:10:46,961 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:10:46,993 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:10:46,994 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:46,994 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:10:46,994 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:10:46,994 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:10:46,994 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:46,994 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:10:46,994 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:10:46,994 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:46,995 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:47,019 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:10:47,019 INFO L131 PetriNetUnfolder]: For 3169/3310 co-relation queries the response was YES. [2022-12-06 00:10:47,020 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3169/3310 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 3004 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:10:47,021 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:47,021 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:10:47,163 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:10:47,163 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 169 [2022-12-06 00:10:47,163 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:10:47,163 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:10:47,163 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:10:47,163 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:10:47,163 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable940 [2022-12-06 00:10:47,163 INFO L420 AbstractCegarLoop]: === Iteration 942 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:10:47,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:10:47,164 INFO L85 PathProgramCache]: Analyzing trace with hash -461571377, now seen corresponding path program 1 times [2022-12-06 00:10:47,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:10:47,164 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374652579] [2022-12-06 00:10:47,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:10:47,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:10:47,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:10:47,223 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:10:47,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:10:47,224 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374652579] [2022-12-06 00:10:47,224 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [374652579] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:10:47,224 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:10:47,224 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:10:47,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120772425] [2022-12-06 00:10:47,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:10:47,224 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:10:47,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:10:47,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:10:47,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:10:47,224 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:10:47,224 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:10:47,224 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:10:47,225 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:10:47,225 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:10:47,497 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:10:47,497 INFO L131 PetriNetUnfolder]: For 27136/27181 co-relation queries the response was YES. [2022-12-06 00:10:47,503 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27136/27181 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13522 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:10:47,509 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:10:47,509 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:10:47,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:10:47,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:10:47,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:10:47,510 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:10:47,510 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:10:47,510 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:10:47,542 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:10:47,543 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:47,543 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:10:47,543 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:10:47,543 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:10:47,543 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:47,544 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:10:47,544 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:10:47,544 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:47,544 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:47,568 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:10:47,568 INFO L131 PetriNetUnfolder]: For 3157/3298 co-relation queries the response was YES. [2022-12-06 00:10:47,569 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3157/3298 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2983 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:10:47,571 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:47,571 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:10:47,716 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:10:47,716 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 173 [2022-12-06 00:10:47,716 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:10:47,716 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:10:47,716 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:10:47,716 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:10:47,716 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable941 [2022-12-06 00:10:47,716 INFO L420 AbstractCegarLoop]: === Iteration 943 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:10:47,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:10:47,716 INFO L85 PathProgramCache]: Analyzing trace with hash 1281238958, now seen corresponding path program 1 times [2022-12-06 00:10:47,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:10:47,717 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355274839] [2022-12-06 00:10:47,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:10:47,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:10:47,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:10:47,785 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-06 00:10:47,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:10:47,786 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355274839] [2022-12-06 00:10:47,786 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [355274839] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:10:47,786 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:10:47,786 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:10:47,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034357087] [2022-12-06 00:10:47,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:10:47,786 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:10:47,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:10:47,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:10:47,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:10:47,786 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:10:47,787 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:10:47,787 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:10:47,787 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:10:47,787 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:10:48,086 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:10:48,086 INFO L131 PetriNetUnfolder]: For 27136/27181 co-relation queries the response was YES. [2022-12-06 00:10:48,090 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27136/27181 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13520 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:10:48,096 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:10:48,096 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:10:48,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:10:48,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:10:48,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:10:48,097 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:10:48,097 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:10:48,097 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:10:48,128 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:10:48,129 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:48,129 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:10:48,129 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:10:48,129 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:10:48,129 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:48,130 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:10:48,130 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:10:48,130 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:48,130 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:48,155 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:10:48,155 INFO L131 PetriNetUnfolder]: For 3156/3296 co-relation queries the response was YES. [2022-12-06 00:10:48,156 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3156/3296 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 3005 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:10:48,157 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:48,157 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:10:48,301 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:10:48,302 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 173 [2022-12-06 00:10:48,302 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:10:48,302 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:10:48,302 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:10:48,302 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:10:48,302 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable942 [2022-12-06 00:10:48,302 INFO L420 AbstractCegarLoop]: === Iteration 944 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:10:48,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:10:48,302 INFO L85 PathProgramCache]: Analyzing trace with hash -1270918003, now seen corresponding path program 1 times [2022-12-06 00:10:48,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:10:48,302 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369082242] [2022-12-06 00:10:48,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:10:48,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:10:48,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:10:48,371 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-06 00:10:48,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:10:48,371 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369082242] [2022-12-06 00:10:48,371 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1369082242] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:10:48,371 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:10:48,371 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:10:48,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52147809] [2022-12-06 00:10:48,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:10:48,371 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:10:48,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:10:48,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:10:48,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:10:48,372 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:10:48,372 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:10:48,372 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:10:48,372 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:10:48,372 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:10:48,652 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:10:48,652 INFO L131 PetriNetUnfolder]: For 26955/27000 co-relation queries the response was YES. [2022-12-06 00:10:48,659 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26955/27000 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13540 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:10:48,667 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:10:48,667 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:10:48,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:10:48,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:10:48,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:10:48,668 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:10:48,668 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:10:48,668 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:10:48,705 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:10:48,706 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:48,706 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:10:48,706 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:10:48,706 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:10:48,706 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:48,707 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:10:48,707 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:10:48,707 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:48,707 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:48,731 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:10:48,732 INFO L131 PetriNetUnfolder]: For 3122/3262 co-relation queries the response was YES. [2022-12-06 00:10:48,732 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3122/3262 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2981 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:10:48,734 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:48,734 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:10:48,882 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:10:48,882 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 176 [2022-12-06 00:10:48,882 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:10:48,883 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:10:48,883 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:10:48,883 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:10:48,883 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable943 [2022-12-06 00:10:48,883 INFO L420 AbstractCegarLoop]: === Iteration 945 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:10:48,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:10:48,883 INFO L85 PathProgramCache]: Analyzing trace with hash 471892332, now seen corresponding path program 1 times [2022-12-06 00:10:48,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:10:48,883 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889781588] [2022-12-06 00:10:48,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:10:48,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:10:48,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:10:48,952 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-06 00:10:48,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:10:48,952 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889781588] [2022-12-06 00:10:48,953 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [889781588] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:10:48,953 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:10:48,953 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:10:48,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319713283] [2022-12-06 00:10:48,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:10:48,953 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:10:48,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:10:48,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:10:48,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:10:48,953 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:10:48,953 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:10:48,953 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:10:48,953 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:10:48,953 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:10:49,215 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:10:49,216 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:10:49,220 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13577 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:10:49,227 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:10:49,227 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:10:49,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:10:49,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:10:49,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:10:49,227 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:10:49,227 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:10:49,228 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:10:49,259 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:10:49,260 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:49,260 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:10:49,261 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:10:49,261 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:10:49,261 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:49,261 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:10:49,261 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:10:49,261 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:49,262 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:49,285 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:10:49,285 INFO L131 PetriNetUnfolder]: For 3349/3561 co-relation queries the response was YES. [2022-12-06 00:10:49,286 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3349/3561 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2997 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:10:49,288 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:49,288 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:10:49,432 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:10:49,433 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 172 [2022-12-06 00:10:49,433 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:10:49,433 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:10:49,433 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:10:49,433 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:10:49,433 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable944 [2022-12-06 00:10:49,433 INFO L420 AbstractCegarLoop]: === Iteration 946 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:10:49,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:10:49,433 INFO L85 PathProgramCache]: Analyzing trace with hash -2080264629, now seen corresponding path program 1 times [2022-12-06 00:10:49,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:10:49,434 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288716814] [2022-12-06 00:10:49,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:10:49,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:10:49,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:10:49,503 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-06 00:10:49,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:10:49,504 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288716814] [2022-12-06 00:10:49,504 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [288716814] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:10:49,504 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:10:49,504 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:10:49,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609631469] [2022-12-06 00:10:49,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:10:49,504 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:10:49,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:10:49,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:10:49,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:10:49,504 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:10:49,504 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:10:49,504 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:10:49,504 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:10:49,504 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:10:49,803 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:10:49,803 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 00:10:49,807 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26965/27010 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13529 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:10:49,813 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:10:49,813 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:10:49,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:10:49,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:10:49,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:10:49,814 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:10:49,814 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:10:49,814 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:10:49,843 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:10:49,844 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:49,844 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:10:49,844 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:10:49,844 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:10:49,844 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:49,845 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:10:49,845 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:10:49,845 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:49,845 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:49,869 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:10:49,869 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 00:10:49,869 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3133/3273 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2973 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:10:49,871 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:49,871 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:10:50,020 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:10:50,020 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 176 [2022-12-06 00:10:50,020 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:10:50,020 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:10:50,020 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:10:50,021 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:10:50,021 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable945 [2022-12-06 00:10:50,021 INFO L420 AbstractCegarLoop]: === Iteration 947 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:10:50,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:10:50,021 INFO L85 PathProgramCache]: Analyzing trace with hash -337454294, now seen corresponding path program 1 times [2022-12-06 00:10:50,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:10:50,021 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797952436] [2022-12-06 00:10:50,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:10:50,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:10:50,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:10:50,090 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-06 00:10:50,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:10:50,091 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797952436] [2022-12-06 00:10:50,091 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [797952436] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:10:50,091 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:10:50,091 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:10:50,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001471587] [2022-12-06 00:10:50,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:10:50,091 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:10:50,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:10:50,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:10:50,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:10:50,091 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:10:50,091 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:10:50,091 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:10:50,091 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:10:50,092 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:10:50,360 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:10:50,361 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:10:50,366 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13555 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:10:50,373 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:10:50,373 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:10:50,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:10:50,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:10:50,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:10:50,373 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:10:50,374 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:10:50,374 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:10:50,410 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:10:50,411 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:50,412 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:10:50,412 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:10:50,412 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:10:50,412 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:50,412 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:10:50,412 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:10:50,412 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:50,413 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:50,437 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:10:50,438 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 00:10:50,438 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3312/3520 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2977 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:10:50,440 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:50,440 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:10:50,581 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:10:50,582 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 170 [2022-12-06 00:10:50,582 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:10:50,582 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:10:50,582 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:10:50,582 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:10:50,582 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable946 [2022-12-06 00:10:50,582 INFO L420 AbstractCegarLoop]: === Iteration 948 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:10:50,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:10:50,582 INFO L85 PathProgramCache]: Analyzing trace with hash 1405356041, now seen corresponding path program 1 times [2022-12-06 00:10:50,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:10:50,582 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251675414] [2022-12-06 00:10:50,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:10:50,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:10:50,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:10:50,651 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-06 00:10:50,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:10:50,651 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251675414] [2022-12-06 00:10:50,651 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [251675414] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:10:50,651 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:10:50,651 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:10:50,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931017065] [2022-12-06 00:10:50,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:10:50,651 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:10:50,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:10:50,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:10:50,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:10:50,652 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:10:50,652 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:10:50,652 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:10:50,652 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:10:50,652 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:10:50,939 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:10:50,939 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 00:10:50,945 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26965/27010 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13530 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:10:50,953 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:10:50,953 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:10:50,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:10:50,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:10:50,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:10:50,954 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:10:50,954 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:10:50,954 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:10:50,999 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:10:51,000 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:51,000 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:10:51,001 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:10:51,001 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:10:51,001 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:51,001 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:10:51,001 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:10:51,001 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:51,002 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:51,027 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:10:51,027 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 00:10:51,028 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3133/3273 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2992 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:10:51,030 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:51,030 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:10:51,190 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:10:51,190 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 189 [2022-12-06 00:10:51,190 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:10:51,190 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:10:51,190 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:10:51,190 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:10:51,191 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable947 [2022-12-06 00:10:51,191 INFO L420 AbstractCegarLoop]: === Iteration 949 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:10:51,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:10:51,191 INFO L85 PathProgramCache]: Analyzing trace with hash -1146800920, now seen corresponding path program 1 times [2022-12-06 00:10:51,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:10:51,191 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836937972] [2022-12-06 00:10:51,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:10:51,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:10:51,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:10:51,259 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-06 00:10:51,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:10:51,259 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836937972] [2022-12-06 00:10:51,259 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [836937972] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:10:51,259 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:10:51,259 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:10:51,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235898187] [2022-12-06 00:10:51,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:10:51,259 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:10:51,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:10:51,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:10:51,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:10:51,260 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:10:51,260 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:10:51,260 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:10:51,260 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:10:51,260 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:10:51,552 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:10:51,552 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:10:51,556 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13567 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:10:51,562 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:10:51,562 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:10:51,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:10:51,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:10:51,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:10:51,563 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:10:51,563 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:10:51,563 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:10:51,593 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:10:51,594 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:51,594 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:10:51,594 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:10:51,594 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:10:51,594 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:51,595 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:10:51,595 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:10:51,595 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:51,595 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:51,619 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:10:51,619 INFO L131 PetriNetUnfolder]: For 3338/3547 co-relation queries the response was YES. [2022-12-06 00:10:51,620 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3338/3547 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2980 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:10:51,622 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:51,622 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:10:51,767 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:10:51,767 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 173 [2022-12-06 00:10:51,767 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:10:51,767 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:10:51,767 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:10:51,767 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:10:51,768 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable948 [2022-12-06 00:10:51,768 INFO L420 AbstractCegarLoop]: === Iteration 950 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:10:51,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:10:51,768 INFO L85 PathProgramCache]: Analyzing trace with hash 596009415, now seen corresponding path program 1 times [2022-12-06 00:10:51,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:10:51,768 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645716344] [2022-12-06 00:10:51,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:10:51,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:10:51,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:10:51,837 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-06 00:10:51,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:10:51,838 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645716344] [2022-12-06 00:10:51,838 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1645716344] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:10:51,838 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:10:51,838 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:10:51,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938159598] [2022-12-06 00:10:51,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:10:51,838 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:10:51,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:10:51,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:10:51,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:10:51,838 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:10:51,838 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:10:51,839 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:10:51,839 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:10:51,839 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:10:52,117 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:10:52,117 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:10:52,122 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13585 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:10:52,130 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:10:52,131 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:10:52,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:10:52,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:10:52,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:10:52,131 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:10:52,131 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:10:52,131 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:10:52,166 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:10:52,167 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:52,167 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:10:52,167 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:10:52,167 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:10:52,167 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:52,168 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:10:52,168 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:10:52,168 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:52,168 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:52,193 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:10:52,193 INFO L131 PetriNetUnfolder]: For 3304/3511 co-relation queries the response was YES. [2022-12-06 00:10:52,194 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3304/3511 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2980 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:10:52,196 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:52,196 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:10:52,340 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:10:52,341 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 174 [2022-12-06 00:10:52,341 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:10:52,341 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:10:52,341 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:10:52,341 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:10:52,341 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable949 [2022-12-06 00:10:52,341 INFO L420 AbstractCegarLoop]: === Iteration 951 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:10:52,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:10:52,341 INFO L85 PathProgramCache]: Analyzing trace with hash -1956147546, now seen corresponding path program 1 times [2022-12-06 00:10:52,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:10:52,341 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726179676] [2022-12-06 00:10:52,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:10:52,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:10:52,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:10:52,425 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-06 00:10:52,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:10:52,426 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726179676] [2022-12-06 00:10:52,426 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1726179676] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:10:52,426 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:10:52,426 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:10:52,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247103185] [2022-12-06 00:10:52,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:10:52,426 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:10:52,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:10:52,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:10:52,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:10:52,426 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:10:52,427 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:10:52,427 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:10:52,427 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:10:52,427 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:10:52,704 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:10:52,705 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:10:52,710 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13557 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:10:52,717 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:10:52,717 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:10:52,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:10:52,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:10:52,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:10:52,717 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:10:52,718 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:10:52,718 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:10:52,752 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:10:52,753 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:52,753 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:10:52,753 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:10:52,753 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:10:52,754 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:52,754 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:10:52,754 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:10:52,754 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:52,755 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:52,780 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:10:52,780 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 00:10:52,781 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3321/3530 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2992 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:10:52,783 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:52,783 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:10:52,948 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:10:52,948 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 195 [2022-12-06 00:10:52,948 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:10:52,948 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:10:52,948 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:10:52,948 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:10:52,949 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable950 [2022-12-06 00:10:52,949 INFO L420 AbstractCegarLoop]: === Iteration 952 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:10:52,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:10:52,949 INFO L85 PathProgramCache]: Analyzing trace with hash -213337211, now seen corresponding path program 1 times [2022-12-06 00:10:52,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:10:52,949 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73335742] [2022-12-06 00:10:52,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:10:52,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:10:52,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:10:53,007 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-06 00:10:53,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:10:53,008 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73335742] [2022-12-06 00:10:53,008 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [73335742] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:10:53,008 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:10:53,008 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:10:53,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847281339] [2022-12-06 00:10:53,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:10:53,008 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:10:53,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:10:53,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:10:53,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:10:53,008 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:10:53,009 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:10:53,009 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:10:53,009 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:10:53,009 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:10:53,312 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:10:53,312 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:10:53,316 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13548 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:10:53,322 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:10:53,322 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:10:53,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:10:53,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:10:53,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:10:53,323 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:10:53,323 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:10:53,323 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:10:53,354 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:10:53,355 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:53,355 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:10:53,355 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:10:53,355 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:10:53,355 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:53,355 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:10:53,355 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:10:53,355 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:53,356 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:53,381 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:10:53,381 INFO L131 PetriNetUnfolder]: For 3310/3519 co-relation queries the response was YES. [2022-12-06 00:10:53,381 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3310/3519 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2995 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:10:53,383 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:53,383 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:10:53,528 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:10:53,528 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 173 [2022-12-06 00:10:53,529 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:10:53,529 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:10:53,529 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:10:53,529 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:10:53,529 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable951 [2022-12-06 00:10:53,529 INFO L420 AbstractCegarLoop]: === Iteration 953 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:10:53,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:10:53,529 INFO L85 PathProgramCache]: Analyzing trace with hash 1529473124, now seen corresponding path program 1 times [2022-12-06 00:10:53,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:10:53,529 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93054866] [2022-12-06 00:10:53,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:10:53,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:10:53,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:10:53,600 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-06 00:10:53,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:10:53,600 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93054866] [2022-12-06 00:10:53,600 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [93054866] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:10:53,600 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:10:53,600 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:10:53,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116844467] [2022-12-06 00:10:53,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:10:53,600 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:10:53,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:10:53,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:10:53,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:10:53,601 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:10:53,601 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:10:53,601 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:10:53,601 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:10:53,601 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:10:53,892 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:10:53,892 INFO L131 PetriNetUnfolder]: For 26955/27000 co-relation queries the response was YES. [2022-12-06 00:10:53,898 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26955/27000 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13507 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:10:53,906 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:10:53,906 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:10:53,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:10:53,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:10:53,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:10:53,907 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:10:53,907 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:10:53,907 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:10:53,946 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:10:53,947 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:53,947 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:10:53,948 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:10:53,948 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:10:53,948 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:53,948 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:10:53,948 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:10:53,948 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:53,949 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:53,980 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:10:53,980 INFO L131 PetriNetUnfolder]: For 3151/3294 co-relation queries the response was YES. [2022-12-06 00:10:53,981 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3151/3294 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2970 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:10:53,983 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:53,983 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:10:54,146 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:10:54,146 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 198 [2022-12-06 00:10:54,146 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:10:54,146 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:10:54,146 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:10:54,146 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:10:54,146 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable952 [2022-12-06 00:10:54,146 INFO L420 AbstractCegarLoop]: === Iteration 954 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:10:54,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:10:54,147 INFO L85 PathProgramCache]: Analyzing trace with hash -1022683837, now seen corresponding path program 1 times [2022-12-06 00:10:54,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:10:54,147 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308033641] [2022-12-06 00:10:54,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:10:54,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:10:54,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:10:54,216 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-06 00:10:54,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:10:54,216 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308033641] [2022-12-06 00:10:54,216 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [308033641] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:10:54,216 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:10:54,216 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:10:54,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024124475] [2022-12-06 00:10:54,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:10:54,216 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:10:54,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:10:54,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:10:54,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:10:54,217 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:10:54,217 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:10:54,217 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:10:54,217 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:10:54,217 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:10:54,507 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:10:54,507 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 00:10:54,512 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26969/27014 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13529 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:10:54,519 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:10:54,519 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:10:54,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:10:54,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:10:54,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:10:54,520 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:10:54,520 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:10:54,520 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:10:54,554 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:10:54,555 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:54,556 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:10:54,556 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:10:54,556 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:10:54,556 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:54,556 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:10:54,556 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:10:54,556 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:54,557 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:54,580 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:10:54,580 INFO L131 PetriNetUnfolder]: For 3123/3264 co-relation queries the response was YES. [2022-12-06 00:10:54,581 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3123/3264 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2972 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:10:54,583 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:54,583 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:10:54,734 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:10:54,734 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 178 [2022-12-06 00:10:54,734 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:10:54,734 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:10:54,734 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:10:54,734 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:10:54,734 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable953 [2022-12-06 00:10:54,735 INFO L420 AbstractCegarLoop]: === Iteration 955 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:10:54,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:10:54,735 INFO L85 PathProgramCache]: Analyzing trace with hash 720126498, now seen corresponding path program 1 times [2022-12-06 00:10:54,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:10:54,735 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486070226] [2022-12-06 00:10:54,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:10:54,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:10:54,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:10:54,804 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-06 00:10:54,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:10:54,804 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486070226] [2022-12-06 00:10:54,804 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1486070226] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:10:54,804 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:10:54,805 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:10:54,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458120346] [2022-12-06 00:10:54,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:10:54,805 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:10:54,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:10:54,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:10:54,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:10:54,805 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:10:54,805 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:10:54,805 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:10:54,805 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:10:54,805 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:10:55,100 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:10:55,100 INFO L131 PetriNetUnfolder]: For 27136/27181 co-relation queries the response was YES. [2022-12-06 00:10:55,105 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27136/27181 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13522 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:10:55,111 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:10:55,111 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:10:55,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:10:55,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:10:55,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:10:55,111 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:10:55,111 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:10:55,111 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:10:55,140 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:10:55,141 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:55,142 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:10:55,142 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:10:55,142 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:10:55,142 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:55,142 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:10:55,142 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:10:55,142 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:55,143 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:55,166 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:10:55,166 INFO L131 PetriNetUnfolder]: For 3167/3307 co-relation queries the response was YES. [2022-12-06 00:10:55,167 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3167/3307 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 3005 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:10:55,169 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:55,169 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:10:55,316 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:10:55,316 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 174 [2022-12-06 00:10:55,316 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:10:55,316 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:10:55,316 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:10:55,316 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:10:55,316 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable954 [2022-12-06 00:10:55,317 INFO L420 AbstractCegarLoop]: === Iteration 956 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:10:55,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:10:55,317 INFO L85 PathProgramCache]: Analyzing trace with hash -1832030463, now seen corresponding path program 1 times [2022-12-06 00:10:55,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:10:55,317 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593006736] [2022-12-06 00:10:55,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:10:55,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:10:55,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:10:55,375 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-06 00:10:55,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:10:55,375 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593006736] [2022-12-06 00:10:55,375 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1593006736] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:10:55,375 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:10:55,375 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:10:55,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552192267] [2022-12-06 00:10:55,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:10:55,376 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:10:55,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:10:55,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:10:55,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:10:55,376 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:10:55,376 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:10:55,376 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:10:55,376 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:10:55,376 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:10:55,651 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:10:55,651 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:10:55,656 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13558 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:10:55,663 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:10:55,663 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:10:55,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:10:55,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:10:55,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:10:55,664 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:10:55,664 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:10:55,664 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:10:55,695 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:10:55,696 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:55,696 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:10:55,696 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:10:55,696 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:10:55,696 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:55,697 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:10:55,697 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:10:55,697 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:55,697 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:55,720 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:10:55,721 INFO L131 PetriNetUnfolder]: For 3301/3509 co-relation queries the response was YES. [2022-12-06 00:10:55,721 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3301/3509 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2985 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:10:55,723 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:55,723 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:10:55,874 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:10:55,875 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 179 [2022-12-06 00:10:55,875 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:10:55,875 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:10:55,875 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:10:55,875 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:10:55,875 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable955 [2022-12-06 00:10:55,875 INFO L420 AbstractCegarLoop]: === Iteration 957 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:10:55,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:10:55,875 INFO L85 PathProgramCache]: Analyzing trace with hash -89220128, now seen corresponding path program 1 times [2022-12-06 00:10:55,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:10:55,875 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112619608] [2022-12-06 00:10:55,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:10:55,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:10:55,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:10:55,938 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-06 00:10:55,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:10:55,939 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112619608] [2022-12-06 00:10:55,939 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2112619608] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:10:55,939 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:10:55,939 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:10:55,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008009641] [2022-12-06 00:10:55,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:10:55,939 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:10:55,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:10:55,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:10:55,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:10:55,939 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:10:55,939 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:10:55,939 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:10:55,939 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:10:55,939 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:10:56,245 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:10:56,245 INFO L131 PetriNetUnfolder]: For 27136/27181 co-relation queries the response was YES. [2022-12-06 00:10:56,251 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27136/27181 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13533 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:10:56,258 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:10:56,259 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:10:56,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:10:56,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:10:56,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:10:56,259 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:10:56,259 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:10:56,259 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:10:56,301 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:10:56,302 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:56,302 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:10:56,302 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:10:56,302 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:10:56,302 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:56,303 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:10:56,303 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:10:56,303 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:56,303 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:56,331 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:10:56,331 INFO L131 PetriNetUnfolder]: For 3180/3321 co-relation queries the response was YES. [2022-12-06 00:10:56,333 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3180/3321 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 3005 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:10:56,335 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:56,335 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:10:56,496 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:10:56,496 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 194 [2022-12-06 00:10:56,497 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:10:56,497 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:10:56,497 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:10:56,497 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:10:56,497 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable956 [2022-12-06 00:10:56,497 INFO L420 AbstractCegarLoop]: === Iteration 958 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:10:56,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:10:56,497 INFO L85 PathProgramCache]: Analyzing trace with hash 1653590207, now seen corresponding path program 1 times [2022-12-06 00:10:56,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:10:56,497 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084377680] [2022-12-06 00:10:56,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:10:56,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:10:56,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:10:56,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-06 00:10:56,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:10:56,569 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084377680] [2022-12-06 00:10:56,569 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1084377680] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:10:56,569 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:10:56,569 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:10:56,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469200483] [2022-12-06 00:10:56,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:10:56,569 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:10:56,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:10:56,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:10:56,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:10:56,569 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:10:56,569 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:10:56,569 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:10:56,569 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:10:56,570 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:10:56,867 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:10:56,867 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:10:56,871 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13573 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:10:56,877 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:10:56,877 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:10:56,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:10:56,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:10:56,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:10:56,878 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:10:56,878 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:10:56,878 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:10:56,910 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:10:56,912 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:56,912 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:10:56,912 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:10:56,912 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:10:56,912 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:56,913 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:10:56,913 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:10:56,913 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:56,913 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:56,939 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:10:56,939 INFO L131 PetriNetUnfolder]: For 3299/3508 co-relation queries the response was YES. [2022-12-06 00:10:56,940 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3299/3508 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2992 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:10:56,942 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:56,942 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:10:57,095 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:10:57,095 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 183 [2022-12-06 00:10:57,095 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:10:57,095 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:10:57,096 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:10:57,096 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:10:57,096 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable957 [2022-12-06 00:10:57,096 INFO L420 AbstractCegarLoop]: === Iteration 959 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:10:57,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:10:57,096 INFO L85 PathProgramCache]: Analyzing trace with hash -898566754, now seen corresponding path program 1 times [2022-12-06 00:10:57,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:10:57,096 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330933667] [2022-12-06 00:10:57,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:10:57,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:10:57,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:10:57,162 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-06 00:10:57,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:10:57,162 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330933667] [2022-12-06 00:10:57,162 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [330933667] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:10:57,162 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:10:57,162 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:10:57,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461211799] [2022-12-06 00:10:57,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:10:57,163 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:10:57,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:10:57,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:10:57,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:10:57,163 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:10:57,163 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:10:57,163 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:10:57,163 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:10:57,163 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:10:57,446 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:10:57,446 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 00:10:57,452 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26969/27014 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13520 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:10:57,459 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:10:57,459 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:10:57,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:10:57,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:10:57,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:10:57,460 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:10:57,460 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:10:57,460 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:10:57,497 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:10:57,498 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:57,498 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:10:57,498 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:10:57,498 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:10:57,498 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:57,499 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:10:57,499 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:10:57,499 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:57,499 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:57,523 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:10:57,523 INFO L131 PetriNetUnfolder]: For 3134/3275 co-relation queries the response was YES. [2022-12-06 00:10:57,524 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3134/3275 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2980 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:10:57,526 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:57,526 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:10:57,696 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:10:57,697 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 199 [2022-12-06 00:10:57,697 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:10:57,697 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:10:57,697 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:10:57,697 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:10:57,697 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable958 [2022-12-06 00:10:57,697 INFO L420 AbstractCegarLoop]: === Iteration 960 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:10:57,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:10:57,697 INFO L85 PathProgramCache]: Analyzing trace with hash 844243581, now seen corresponding path program 1 times [2022-12-06 00:10:57,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:10:57,697 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854682470] [2022-12-06 00:10:57,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:10:57,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:10:57,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:10:57,764 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-06 00:10:57,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:10:57,764 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854682470] [2022-12-06 00:10:57,764 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1854682470] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:10:57,764 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:10:57,765 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:10:57,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624731826] [2022-12-06 00:10:57,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:10:57,765 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:10:57,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:10:57,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:10:57,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:10:57,765 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:10:57,765 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:10:57,765 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:10:57,765 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:10:57,765 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:10:58,036 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:10:58,036 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:10:58,041 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13569 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:10:58,050 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:10:58,050 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:10:58,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:10:58,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:10:58,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:10:58,051 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:10:58,051 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:10:58,052 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:10:58,087 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:10:58,088 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:58,088 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:10:58,088 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:10:58,088 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:10:58,088 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:58,088 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:10:58,089 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:10:58,089 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:58,089 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:58,113 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:10:58,113 INFO L131 PetriNetUnfolder]: For 3307/3517 co-relation queries the response was YES. [2022-12-06 00:10:58,114 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3307/3517 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2980 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:10:58,116 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:58,116 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:10:58,255 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:10:58,256 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 168 [2022-12-06 00:10:58,256 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:10:58,256 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:10:58,256 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:10:58,256 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:10:58,256 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable959 [2022-12-06 00:10:58,256 INFO L420 AbstractCegarLoop]: === Iteration 961 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:10:58,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:10:58,256 INFO L85 PathProgramCache]: Analyzing trace with hash -1707913380, now seen corresponding path program 1 times [2022-12-06 00:10:58,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:10:58,256 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654517490] [2022-12-06 00:10:58,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:10:58,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:10:58,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:10:58,317 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-06 00:10:58,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:10:58,317 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654517490] [2022-12-06 00:10:58,318 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [654517490] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:10:58,318 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:10:58,318 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:10:58,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496202960] [2022-12-06 00:10:58,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:10:58,318 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:10:58,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:10:58,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:10:58,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:10:58,318 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:10:58,318 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:10:58,318 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:10:58,318 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:10:58,318 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:10:58,615 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:10:58,615 INFO L131 PetriNetUnfolder]: For 26955/27000 co-relation queries the response was YES. [2022-12-06 00:10:58,620 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26955/27000 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13528 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:10:58,626 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:10:58,626 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:10:58,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:10:58,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:10:58,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:10:58,627 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:10:58,627 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:10:58,627 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:10:58,657 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:10:58,658 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:58,658 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:10:58,658 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:10:58,658 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:10:58,658 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:58,658 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:10:58,659 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:10:58,659 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:58,659 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:58,682 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:10:58,683 INFO L131 PetriNetUnfolder]: For 3146/3287 co-relation queries the response was YES. [2022-12-06 00:10:58,683 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3146/3287 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2961 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:10:58,685 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:58,685 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:10:58,828 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:10:58,828 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 170 [2022-12-06 00:10:58,828 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:10:58,828 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:10:58,828 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:10:58,828 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:10:58,829 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable960 [2022-12-06 00:10:58,829 INFO L420 AbstractCegarLoop]: === Iteration 962 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:10:58,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:10:58,829 INFO L85 PathProgramCache]: Analyzing trace with hash 34896955, now seen corresponding path program 1 times [2022-12-06 00:10:58,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:10:58,829 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9038710] [2022-12-06 00:10:58,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:10:58,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:10:58,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:10:58,897 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-06 00:10:58,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:10:58,897 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9038710] [2022-12-06 00:10:58,897 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [9038710] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:10:58,897 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:10:58,898 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:10:58,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861340209] [2022-12-06 00:10:58,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:10:58,898 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:10:58,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:10:58,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:10:58,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:10:58,898 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:10:58,898 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:10:58,898 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:10:58,898 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:10:58,898 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:10:59,174 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:10:59,174 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:10:59,180 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13547 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:10:59,187 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:10:59,187 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:10:59,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:10:59,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:10:59,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:10:59,187 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:10:59,187 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:10:59,187 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:10:59,224 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:10:59,225 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:59,225 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:10:59,225 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:10:59,225 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:10:59,225 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:59,225 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:10:59,225 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:10:59,226 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:59,226 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:59,251 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:10:59,251 INFO L131 PetriNetUnfolder]: For 3288/3497 co-relation queries the response was YES. [2022-12-06 00:10:59,252 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3288/3497 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2993 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:10:59,254 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:59,254 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:10:59,405 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:10:59,406 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 181 [2022-12-06 00:10:59,406 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:10:59,406 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:10:59,406 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:10:59,406 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:10:59,406 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable961 [2022-12-06 00:10:59,406 INFO L420 AbstractCegarLoop]: === Iteration 963 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:10:59,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:10:59,406 INFO L85 PathProgramCache]: Analyzing trace with hash 1777707290, now seen corresponding path program 1 times [2022-12-06 00:10:59,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:10:59,406 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450734990] [2022-12-06 00:10:59,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:10:59,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:10:59,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:10:59,475 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-06 00:10:59,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:10:59,475 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1450734990] [2022-12-06 00:10:59,475 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1450734990] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:10:59,475 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:10:59,475 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:10:59,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647968066] [2022-12-06 00:10:59,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:10:59,475 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:10:59,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:10:59,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:10:59,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:10:59,476 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:10:59,476 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:10:59,476 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:10:59,476 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:10:59,476 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:10:59,784 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:10:59,785 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 00:10:59,790 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13561 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:10:59,798 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:10:59,798 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:10:59,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:10:59,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:10:59,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:10:59,799 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:10:59,799 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:10:59,799 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:10:59,836 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:10:59,837 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:59,838 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:10:59,838 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:10:59,838 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:10:59,838 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:59,838 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:10:59,838 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:10:59,838 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:59,839 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:59,862 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:10:59,863 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 00:10:59,864 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3312/3520 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2974 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:10:59,866 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:10:59,866 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:11:00,013 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:11:00,013 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 175 [2022-12-06 00:11:00,013 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:11:00,013 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:11:00,013 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:11:00,013 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:11:00,013 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable962 [2022-12-06 00:11:00,014 INFO L420 AbstractCegarLoop]: === Iteration 964 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:11:00,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:11:00,014 INFO L85 PathProgramCache]: Analyzing trace with hash -774449671, now seen corresponding path program 1 times [2022-12-06 00:11:00,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:11:00,014 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671996037] [2022-12-06 00:11:00,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:11:00,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:11:00,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:11:00,088 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-06 00:11:00,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:11:00,089 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671996037] [2022-12-06 00:11:00,089 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [671996037] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:11:00,089 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:11:00,089 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:11:00,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032727966] [2022-12-06 00:11:00,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:11:00,089 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:11:00,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:11:00,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:11:00,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:11:00,090 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:11:00,090 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:11:00,090 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:11:00,090 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:11:00,090 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:11:00,392 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:11:00,393 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:11:00,397 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13566 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:11:00,403 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:11:00,403 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:11:00,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:11:00,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:11:00,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:11:00,403 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:11:00,403 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:11:00,403 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:11:00,436 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:11:00,437 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:00,437 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:11:00,437 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:11:00,437 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:11:00,437 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:00,438 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:11:00,438 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:11:00,438 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:00,438 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:00,465 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:11:00,465 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 00:11:00,466 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3312/3520 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2978 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:11:00,468 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:00,468 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:11:00,613 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:11:00,613 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 176 [2022-12-06 00:11:00,613 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:11:00,613 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:11:00,614 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:11:00,614 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:11:00,614 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable963 [2022-12-06 00:11:00,614 INFO L420 AbstractCegarLoop]: === Iteration 965 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:11:00,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:11:00,614 INFO L85 PathProgramCache]: Analyzing trace with hash 968360664, now seen corresponding path program 1 times [2022-12-06 00:11:00,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:11:00,614 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532274174] [2022-12-06 00:11:00,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:11:00,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:11:00,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:11:00,681 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-06 00:11:00,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:11:00,681 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532274174] [2022-12-06 00:11:00,681 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1532274174] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:11:00,681 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:11:00,681 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:11:00,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211631803] [2022-12-06 00:11:00,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:11:00,681 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:11:00,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:11:00,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:11:00,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:11:00,682 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:11:00,682 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:11:00,682 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:11:00,682 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:11:00,682 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:11:00,945 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:11:00,945 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:11:00,951 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13552 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:11:00,958 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:11:00,958 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:11:00,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:11:00,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:11:00,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:11:00,959 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:11:00,959 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:11:00,959 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:11:00,992 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:11:00,993 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:00,993 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:11:00,993 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:11:00,993 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:11:00,993 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:00,994 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:11:00,994 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:11:00,994 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:00,994 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:01,018 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:11:01,018 INFO L131 PetriNetUnfolder]: For 3348/3558 co-relation queries the response was YES. [2022-12-06 00:11:01,019 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3348/3558 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2975 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:11:01,020 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:01,021 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:11:01,184 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:11:01,184 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 191 [2022-12-06 00:11:01,184 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:11:01,184 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:11:01,184 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:11:01,184 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:11:01,184 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable964 [2022-12-06 00:11:01,184 INFO L420 AbstractCegarLoop]: === Iteration 966 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:11:01,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:11:01,185 INFO L85 PathProgramCache]: Analyzing trace with hash -1583796297, now seen corresponding path program 1 times [2022-12-06 00:11:01,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:11:01,185 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091787071] [2022-12-06 00:11:01,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:11:01,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:11:01,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:11:01,259 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-06 00:11:01,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:11:01,259 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091787071] [2022-12-06 00:11:01,259 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1091787071] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:11:01,259 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:11:01,259 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:11:01,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833765089] [2022-12-06 00:11:01,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:11:01,260 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:11:01,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:11:01,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:11:01,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:11:01,260 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:11:01,260 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:11:01,260 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:11:01,260 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:11:01,260 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:11:01,535 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:11:01,535 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:11:01,541 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13565 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:11:01,547 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:11:01,547 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:11:01,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:11:01,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:11:01,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:11:01,548 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:11:01,548 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:11:01,548 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:11:01,581 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:11:01,582 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:01,582 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:11:01,582 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:11:01,582 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:11:01,582 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:01,583 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:11:01,583 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:11:01,583 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:01,583 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:01,607 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:11:01,607 INFO L131 PetriNetUnfolder]: For 3301/3509 co-relation queries the response was YES. [2022-12-06 00:11:01,608 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3301/3509 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2980 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:11:01,609 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:01,610 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:11:01,777 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:11:01,778 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 196 [2022-12-06 00:11:01,778 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:11:01,778 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:11:01,778 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:11:01,778 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:11:01,778 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable965 [2022-12-06 00:11:01,778 INFO L420 AbstractCegarLoop]: === Iteration 967 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:11:01,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:11:01,778 INFO L85 PathProgramCache]: Analyzing trace with hash 159014038, now seen corresponding path program 1 times [2022-12-06 00:11:01,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:11:01,778 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242939646] [2022-12-06 00:11:01,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:11:01,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:11:01,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:11:01,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-06 00:11:01,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:11:01,845 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242939646] [2022-12-06 00:11:01,845 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [242939646] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:11:01,845 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:11:01,845 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:11:01,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963826792] [2022-12-06 00:11:01,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:11:01,845 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:11:01,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:11:01,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:11:01,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:11:01,845 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:11:01,845 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:11:01,845 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:11:01,845 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:11:01,845 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:11:02,149 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:11:02,150 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:11:02,154 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13571 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:11:02,160 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:11:02,160 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:11:02,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:11:02,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:11:02,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:11:02,161 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:11:02,161 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:11:02,161 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:11:02,195 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:11:02,196 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:02,196 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:11:02,196 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:11:02,196 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:11:02,196 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:02,196 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:11:02,196 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:11:02,197 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:02,197 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:02,226 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:11:02,226 INFO L131 PetriNetUnfolder]: For 3308/3518 co-relation queries the response was YES. [2022-12-06 00:11:02,227 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3308/3518 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2991 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:11:02,228 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:02,229 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:11:02,364 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:11:02,365 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 169 [2022-12-06 00:11:02,365 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:11:02,365 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:11:02,365 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:11:02,365 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:11:02,365 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable966 [2022-12-06 00:11:02,365 INFO L420 AbstractCegarLoop]: === Iteration 968 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:11:02,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:11:02,366 INFO L85 PathProgramCache]: Analyzing trace with hash 1901824373, now seen corresponding path program 1 times [2022-12-06 00:11:02,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:11:02,366 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498842556] [2022-12-06 00:11:02,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:11:02,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:11:02,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:11:02,427 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-06 00:11:02,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:11:02,428 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498842556] [2022-12-06 00:11:02,428 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1498842556] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:11:02,428 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:11:02,428 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:11:02,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390766003] [2022-12-06 00:11:02,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:11:02,428 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:11:02,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:11:02,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:11:02,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:11:02,428 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:11:02,428 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:11:02,428 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:11:02,428 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:11:02,428 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:11:02,697 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:11:02,698 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 00:11:02,703 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26965/27010 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13510 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:11:02,709 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:11:02,709 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:11:02,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:11:02,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:11:02,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:11:02,710 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:11:02,710 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:11:02,710 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:11:02,745 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:11:02,746 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:02,746 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:11:02,746 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:11:02,747 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:11:02,747 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:02,747 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:11:02,747 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:11:02,747 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:02,748 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:02,772 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:11:02,772 INFO L131 PetriNetUnfolder]: For 3122/3262 co-relation queries the response was YES. [2022-12-06 00:11:02,773 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3122/3262 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2977 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:11:02,775 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:02,775 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:11:02,921 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:11:02,922 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 175 [2022-12-06 00:11:02,922 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:11:02,922 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:11:02,922 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:11:02,922 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:11:02,922 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable967 [2022-12-06 00:11:02,922 INFO L420 AbstractCegarLoop]: === Iteration 969 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:11:02,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:11:02,922 INFO L85 PathProgramCache]: Analyzing trace with hash -650332588, now seen corresponding path program 1 times [2022-12-06 00:11:02,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:11:02,923 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319955592] [2022-12-06 00:11:02,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:11:02,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:11:02,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:11:02,982 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-06 00:11:02,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:11:02,982 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319955592] [2022-12-06 00:11:02,983 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1319955592] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:11:02,983 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:11:02,983 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:11:02,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551700077] [2022-12-06 00:11:02,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:11:02,983 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:11:02,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:11:02,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:11:02,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:11:02,983 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:11:02,983 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:11:02,983 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:11:02,983 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:11:02,983 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:11:03,260 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:11:03,260 INFO L131 PetriNetUnfolder]: For 26955/27000 co-relation queries the response was YES. [2022-12-06 00:11:03,266 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26955/27000 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13522 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:11:03,273 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:11:03,274 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:11:03,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:11:03,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:11:03,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:11:03,274 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:11:03,274 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:11:03,274 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:11:03,309 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:11:03,310 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:03,310 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:11:03,310 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:11:03,310 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:11:03,310 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:03,310 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:11:03,310 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:11:03,311 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:03,311 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:03,335 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:11:03,335 INFO L131 PetriNetUnfolder]: For 3140/3283 co-relation queries the response was YES. [2022-12-06 00:11:03,336 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3140/3283 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2977 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:11:03,338 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:03,338 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:11:03,491 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:11:03,491 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 181 [2022-12-06 00:11:03,491 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:11:03,491 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:11:03,491 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:11:03,491 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:11:03,491 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable968 [2022-12-06 00:11:03,492 INFO L420 AbstractCegarLoop]: === Iteration 970 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:11:03,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:11:03,492 INFO L85 PathProgramCache]: Analyzing trace with hash 1092477747, now seen corresponding path program 1 times [2022-12-06 00:11:03,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:11:03,492 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864971705] [2022-12-06 00:11:03,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:11:03,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:11:03,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:11:03,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-06 00:11:03,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:11:03,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864971705] [2022-12-06 00:11:03,561 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1864971705] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:11:03,561 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:11:03,561 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:11:03,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128993856] [2022-12-06 00:11:03,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:11:03,562 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:11:03,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:11:03,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:11:03,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:11:03,562 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:11:03,562 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:11:03,562 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:11:03,562 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:11:03,562 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:11:03,870 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:11:03,870 INFO L131 PetriNetUnfolder]: For 26955/27000 co-relation queries the response was YES. [2022-12-06 00:11:03,874 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26955/27000 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13535 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:11:03,880 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:11:03,880 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:11:03,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:11:03,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:11:03,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:11:03,881 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:11:03,881 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:11:03,881 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:11:03,913 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:11:03,914 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:03,914 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:11:03,914 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:11:03,914 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:11:03,914 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:03,915 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:11:03,915 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:11:03,915 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:03,915 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:03,939 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:11:03,939 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 00:11:03,940 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3133/3273 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2978 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:11:03,942 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:03,942 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:11:04,105 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:11:04,105 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 191 [2022-12-06 00:11:04,105 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:11:04,105 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:11:04,105 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:11:04,106 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:11:04,106 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable969 [2022-12-06 00:11:04,106 INFO L420 AbstractCegarLoop]: === Iteration 971 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:11:04,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:11:04,106 INFO L85 PathProgramCache]: Analyzing trace with hash -1459679214, now seen corresponding path program 1 times [2022-12-06 00:11:04,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:11:04,106 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988093331] [2022-12-06 00:11:04,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:11:04,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:11:04,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:11:04,169 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-06 00:11:04,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:11:04,169 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988093331] [2022-12-06 00:11:04,169 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [988093331] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:11:04,169 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:11:04,170 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:11:04,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952049675] [2022-12-06 00:11:04,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:11:04,170 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:11:04,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:11:04,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:11:04,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:11:04,170 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:11:04,170 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:11:04,170 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:11:04,170 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:11:04,170 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:11:04,456 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:11:04,456 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 00:11:04,462 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26969/27014 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13533 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:11:04,469 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:11:04,469 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:11:04,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:11:04,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:11:04,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:11:04,470 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:11:04,470 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:11:04,470 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:11:04,506 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:11:04,508 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:04,508 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:11:04,508 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:11:04,508 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:11:04,508 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:04,508 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:11:04,509 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:11:04,509 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:04,509 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:04,533 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:11:04,533 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 00:11:04,534 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3133/3273 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2979 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:11:04,536 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:04,536 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:11:04,705 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:11:04,706 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 198 [2022-12-06 00:11:04,706 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:11:04,706 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:11:04,706 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:11:04,706 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:11:04,706 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable970 [2022-12-06 00:11:04,706 INFO L420 AbstractCegarLoop]: === Iteration 972 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:11:04,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:11:04,706 INFO L85 PathProgramCache]: Analyzing trace with hash 283131121, now seen corresponding path program 1 times [2022-12-06 00:11:04,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:11:04,707 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457577865] [2022-12-06 00:11:04,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:11:04,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:11:04,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:11:04,767 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-06 00:11:04,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:11:04,767 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457577865] [2022-12-06 00:11:04,767 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [457577865] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:11:04,767 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:11:04,768 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:11:04,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597242632] [2022-12-06 00:11:04,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:11:04,768 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:11:04,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:11:04,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:11:04,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:11:04,768 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:11:04,768 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:11:04,768 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:11:04,768 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:11:04,768 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:11:05,050 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:11:05,051 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 00:11:05,056 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26969/27014 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13570 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:11:05,064 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:11:05,064 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:11:05,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:11:05,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:11:05,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:11:05,065 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:11:05,065 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:11:05,065 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:11:05,103 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:11:05,104 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:05,104 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:11:05,104 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:11:05,104 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:11:05,104 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:05,105 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:11:05,105 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:11:05,105 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:05,105 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:05,130 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:11:05,130 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 00:11:05,131 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3133/3273 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2971 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:11:05,133 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:05,133 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:11:05,296 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:11:05,296 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 192 [2022-12-06 00:11:05,296 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:11:05,296 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:11:05,296 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:11:05,296 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:11:05,296 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable971 [2022-12-06 00:11:05,296 INFO L420 AbstractCegarLoop]: === Iteration 973 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:11:05,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:11:05,297 INFO L85 PathProgramCache]: Analyzing trace with hash 2025941456, now seen corresponding path program 1 times [2022-12-06 00:11:05,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:11:05,297 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702632081] [2022-12-06 00:11:05,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:11:05,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:11:05,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:11:05,363 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-06 00:11:05,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:11:05,363 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702632081] [2022-12-06 00:11:05,363 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1702632081] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:11:05,363 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:11:05,363 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:11:05,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338744064] [2022-12-06 00:11:05,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:11:05,364 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:11:05,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:11:05,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:11:05,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:11:05,364 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:11:05,364 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:11:05,364 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:11:05,364 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:11:05,364 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:11:05,666 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:11:05,667 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:11:05,671 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13550 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:11:05,677 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:11:05,678 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:11:05,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:11:05,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:11:05,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:11:05,678 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:11:05,678 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:11:05,678 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:11:05,708 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:11:05,709 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:05,709 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:11:05,709 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:11:05,709 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:11:05,709 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:05,710 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:11:05,710 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:11:05,710 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:05,710 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:05,734 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:11:05,734 INFO L131 PetriNetUnfolder]: For 3348/3558 co-relation queries the response was YES. [2022-12-06 00:11:05,735 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3348/3558 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2996 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:11:05,737 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:05,737 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:11:05,898 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:11:05,899 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 190 [2022-12-06 00:11:05,899 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:11:05,899 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:11:05,899 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:11:05,899 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:11:05,899 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable972 [2022-12-06 00:11:05,899 INFO L420 AbstractCegarLoop]: === Iteration 974 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:11:05,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:11:05,899 INFO L85 PathProgramCache]: Analyzing trace with hash -526215505, now seen corresponding path program 1 times [2022-12-06 00:11:05,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:11:05,899 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707945268] [2022-12-06 00:11:05,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:11:05,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:11:05,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:11:05,963 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-06 00:11:05,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:11:05,963 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707945268] [2022-12-06 00:11:05,963 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1707945268] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:11:05,963 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:11:05,963 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:11:05,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785095251] [2022-12-06 00:11:05,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:11:05,964 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:11:05,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:11:05,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:11:05,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:11:05,964 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:11:05,964 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:11:05,964 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:11:05,964 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:11:05,964 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:11:06,250 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:11:06,250 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 00:11:06,256 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26965/27010 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13504 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:11:06,263 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:11:06,263 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:11:06,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:11:06,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:11:06,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:11:06,263 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:11:06,264 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:11:06,264 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:11:06,300 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:11:06,301 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:06,301 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:11:06,301 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:11:06,301 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:11:06,301 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:06,302 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:11:06,302 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:11:06,302 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:06,302 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:06,326 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:11:06,326 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 00:11:06,327 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3133/3273 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2973 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:11:06,329 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:06,329 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:11:06,474 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:11:06,474 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 173 [2022-12-06 00:11:06,474 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:11:06,474 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:11:06,474 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:11:06,474 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:11:06,474 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable973 [2022-12-06 00:11:06,475 INFO L420 AbstractCegarLoop]: === Iteration 975 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:11:06,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:11:06,475 INFO L85 PathProgramCache]: Analyzing trace with hash 1216594830, now seen corresponding path program 1 times [2022-12-06 00:11:06,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:11:06,475 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763343623] [2022-12-06 00:11:06,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:11:06,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:11:06,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:11:06,542 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-06 00:11:06,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:11:06,542 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763343623] [2022-12-06 00:11:06,542 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1763343623] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:11:06,542 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:11:06,542 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:11:06,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130674141] [2022-12-06 00:11:06,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:11:06,543 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:11:06,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:11:06,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:11:06,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:11:06,543 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:11:06,543 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:11:06,543 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:11:06,543 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:11:06,543 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:11:06,828 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:11:06,828 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 00:11:06,834 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26965/27010 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13513 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:11:06,840 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:11:06,841 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:11:06,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:11:06,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:11:06,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:11:06,841 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:11:06,841 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:11:06,841 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:11:06,877 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:11:06,878 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:06,878 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:11:06,879 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:11:06,879 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:11:06,879 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:06,879 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:11:06,879 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:11:06,879 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:06,880 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:06,906 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:11:06,906 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 00:11:06,907 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3133/3273 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2981 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:11:06,909 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:06,909 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:11:07,061 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:11:07,062 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 183 [2022-12-06 00:11:07,062 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:11:07,062 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:11:07,062 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:11:07,062 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:11:07,062 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable974 [2022-12-06 00:11:07,062 INFO L420 AbstractCegarLoop]: === Iteration 976 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:11:07,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:11:07,062 INFO L85 PathProgramCache]: Analyzing trace with hash -1335562131, now seen corresponding path program 1 times [2022-12-06 00:11:07,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:11:07,062 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17961093] [2022-12-06 00:11:07,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:11:07,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:11:07,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:11:07,130 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-06 00:11:07,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:11:07,130 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17961093] [2022-12-06 00:11:07,130 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [17961093] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:11:07,130 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:11:07,130 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:11:07,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833222982] [2022-12-06 00:11:07,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:11:07,130 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:11:07,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:11:07,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:11:07,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:11:07,131 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:11:07,131 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:11:07,131 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:11:07,131 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:11:07,131 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:11:07,446 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:11:07,446 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:11:07,450 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13551 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:11:07,457 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:11:07,457 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:11:07,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:11:07,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:11:07,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:11:07,457 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:11:07,457 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:11:07,457 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:11:07,488 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:11:07,489 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:07,490 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:11:07,490 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:11:07,490 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:11:07,490 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:07,490 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:11:07,490 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:11:07,490 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:07,491 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:07,515 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:11:07,515 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 00:11:07,516 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3321/3530 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2983 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:11:07,518 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:07,518 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:11:07,665 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:11:07,665 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 175 [2022-12-06 00:11:07,666 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:11:07,666 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:11:07,666 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:11:07,666 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:11:07,666 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable975 [2022-12-06 00:11:07,666 INFO L420 AbstractCegarLoop]: === Iteration 977 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:11:07,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:11:07,666 INFO L85 PathProgramCache]: Analyzing trace with hash 407248204, now seen corresponding path program 1 times [2022-12-06 00:11:07,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:11:07,666 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981768487] [2022-12-06 00:11:07,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:11:07,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:11:07,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:11:07,730 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-06 00:11:07,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:11:07,731 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981768487] [2022-12-06 00:11:07,731 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [981768487] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:11:07,731 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:11:07,731 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:11:07,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745887063] [2022-12-06 00:11:07,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:11:07,731 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:11:07,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:11:07,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:11:07,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:11:07,731 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:11:07,732 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:11:07,732 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:11:07,732 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:11:07,732 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:11:08,024 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:11:08,024 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:11:08,030 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13574 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:11:08,038 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:11:08,038 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:11:08,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:11:08,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:11:08,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:11:08,039 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:11:08,039 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:11:08,039 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:11:08,073 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:11:08,074 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:08,074 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:11:08,074 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:11:08,074 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:11:08,074 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:08,074 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:11:08,075 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:11:08,075 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:08,075 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:08,100 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:11:08,100 INFO L131 PetriNetUnfolder]: For 3338/3547 co-relation queries the response was YES. [2022-12-06 00:11:08,101 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3338/3547 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2979 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:11:08,103 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:08,104 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:11:08,253 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:11:08,253 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 179 [2022-12-06 00:11:08,254 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:11:08,254 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:11:08,254 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:11:08,254 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:11:08,254 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable976 [2022-12-06 00:11:08,254 INFO L420 AbstractCegarLoop]: === Iteration 978 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:11:08,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:11:08,254 INFO L85 PathProgramCache]: Analyzing trace with hash -2144908757, now seen corresponding path program 1 times [2022-12-06 00:11:08,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:11:08,254 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112576269] [2022-12-06 00:11:08,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:11:08,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:11:08,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:11:08,318 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-06 00:11:08,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:11:08,318 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112576269] [2022-12-06 00:11:08,318 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2112576269] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:11:08,318 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:11:08,318 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:11:08,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022397688] [2022-12-06 00:11:08,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:11:08,318 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:11:08,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:11:08,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:11:08,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:11:08,319 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:11:08,319 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:11:08,319 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:11:08,319 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:11:08,319 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:11:08,597 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:11:08,597 INFO L131 PetriNetUnfolder]: For 27229/27274 co-relation queries the response was YES. [2022-12-06 00:11:08,603 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27229/27274 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13557 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:11:08,611 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:11:08,611 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:11:08,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:11:08,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:11:08,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:11:08,612 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:11:08,612 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:11:08,612 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:11:08,647 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:11:08,648 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:08,648 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:11:08,649 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:11:08,649 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:11:08,649 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:08,649 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:11:08,649 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:11:08,649 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:08,650 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:08,674 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:11:08,674 INFO L131 PetriNetUnfolder]: For 3304/3511 co-relation queries the response was YES. [2022-12-06 00:11:08,675 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3304/3511 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2988 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:11:08,677 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:08,677 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:11:08,837 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:11:08,838 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 189 [2022-12-06 00:11:08,838 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:11:08,838 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:11:08,838 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:11:08,838 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:11:08,838 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable977 [2022-12-06 00:11:08,838 INFO L420 AbstractCegarLoop]: === Iteration 979 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:11:08,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:11:08,838 INFO L85 PathProgramCache]: Analyzing trace with hash -402098422, now seen corresponding path program 1 times [2022-12-06 00:11:08,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:11:08,839 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700774595] [2022-12-06 00:11:08,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:11:08,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:11:08,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:11:08,925 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-06 00:11:08,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:11:08,925 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700774595] [2022-12-06 00:11:08,925 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1700774595] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:11:08,925 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:11:08,925 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:11:08,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584560160] [2022-12-06 00:11:08,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:11:08,925 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:11:08,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:11:08,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:11:08,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:11:08,926 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:11:08,926 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:11:08,926 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:11:08,926 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:11:08,926 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:11:09,238 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:11:09,238 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 00:11:09,243 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26969/27014 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13517 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:11:09,249 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:11:09,249 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:11:09,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:11:09,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:11:09,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:11:09,249 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:11:09,249 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:11:09,249 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:11:09,281 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:11:09,282 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:09,282 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:11:09,283 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:11:09,283 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:11:09,283 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:09,283 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:11:09,283 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:11:09,283 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:09,284 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:09,307 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:11:09,308 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 00:11:09,308 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3133/3273 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2987 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:11:09,310 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:09,310 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:11:09,462 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:11:09,463 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 180 [2022-12-06 00:11:09,463 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:11:09,463 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:11:09,463 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:11:09,463 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:11:09,463 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable978 [2022-12-06 00:11:09,463 INFO L420 AbstractCegarLoop]: === Iteration 980 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:11:09,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:11:09,463 INFO L85 PathProgramCache]: Analyzing trace with hash 1340711913, now seen corresponding path program 1 times [2022-12-06 00:11:09,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:11:09,464 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049355126] [2022-12-06 00:11:09,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:11:09,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:11:09,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:11:09,528 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-06 00:11:09,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:11:09,528 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049355126] [2022-12-06 00:11:09,528 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1049355126] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:11:09,528 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:11:09,528 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:11:09,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373863678] [2022-12-06 00:11:09,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:11:09,529 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:11:09,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:11:09,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:11:09,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:11:09,529 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:11:09,529 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:11:09,529 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:11:09,529 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:11:09,529 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:11:09,850 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:11:09,850 INFO L131 PetriNetUnfolder]: For 27146/27191 co-relation queries the response was YES. [2022-12-06 00:11:09,855 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27146/27191 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13556 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:11:09,862 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:11:09,862 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:11:09,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:11:09,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:11:09,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:11:09,862 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:11:09,862 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:11:09,863 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:11:09,894 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:11:09,895 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:09,895 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:11:09,895 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:11:09,896 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:11:09,896 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:09,896 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:11:09,896 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:11:09,896 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:09,897 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:09,920 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:11:09,920 INFO L131 PetriNetUnfolder]: For 3156/3296 co-relation queries the response was YES. [2022-12-06 00:11:09,921 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3156/3296 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 3010 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:11:09,923 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:09,923 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:11:10,070 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:11:10,071 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 175 [2022-12-06 00:11:10,071 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:11:10,071 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:11:10,071 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:11:10,071 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:11:10,071 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable979 [2022-12-06 00:11:10,071 INFO L420 AbstractCegarLoop]: === Iteration 981 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:11:10,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:11:10,071 INFO L85 PathProgramCache]: Analyzing trace with hash -1211445048, now seen corresponding path program 1 times [2022-12-06 00:11:10,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:11:10,072 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499123365] [2022-12-06 00:11:10,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:11:10,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:11:10,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:11:10,133 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-06 00:11:10,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:11:10,133 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499123365] [2022-12-06 00:11:10,133 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [499123365] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:11:10,133 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:11:10,134 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:11:10,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112992837] [2022-12-06 00:11:10,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:11:10,134 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:11:10,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:11:10,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:11:10,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:11:10,134 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:11:10,134 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:11:10,134 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:11:10,134 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:11:10,134 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:11:10,417 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:11:10,417 INFO L131 PetriNetUnfolder]: For 27136/27181 co-relation queries the response was YES. [2022-12-06 00:11:10,423 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27136/27181 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13521 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:11:10,430 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:11:10,430 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:11:10,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:11:10,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:11:10,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:11:10,431 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:11:10,431 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:11:10,431 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:11:10,463 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:11:10,465 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:10,465 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:11:10,465 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:11:10,465 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:11:10,465 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:10,465 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:11:10,465 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:11:10,465 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:10,466 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:10,490 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:11:10,490 INFO L131 PetriNetUnfolder]: For 3175/3318 co-relation queries the response was YES. [2022-12-06 00:11:10,491 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3175/3318 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2988 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:11:10,493 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:10,493 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:11:10,646 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:11:10,647 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 182 [2022-12-06 00:11:10,647 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:11:10,647 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:11:10,647 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:11:10,647 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:11:10,647 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable980 [2022-12-06 00:11:10,647 INFO L420 AbstractCegarLoop]: === Iteration 982 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:11:10,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:11:10,647 INFO L85 PathProgramCache]: Analyzing trace with hash 531365287, now seen corresponding path program 1 times [2022-12-06 00:11:10,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:11:10,647 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666238355] [2022-12-06 00:11:10,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:11:10,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:11:10,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:11:10,717 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-06 00:11:10,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:11:10,718 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666238355] [2022-12-06 00:11:10,718 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1666238355] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:11:10,718 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:11:10,718 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:11:10,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491805937] [2022-12-06 00:11:10,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:11:10,718 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:11:10,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:11:10,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:11:10,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:11:10,718 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:11:10,718 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:11:10,719 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:11:10,719 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:11:10,719 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:11:11,070 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:11:11,070 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 00:11:11,076 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26965/27010 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13527 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:11:11,081 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:11:11,082 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:11:11,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:11:11,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:11:11,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:11:11,082 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:11:11,082 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:11:11,082 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:11:11,114 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:11:11,115 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:11,115 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:11:11,116 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:11:11,116 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:11:11,116 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:11,116 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:11:11,116 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:11:11,116 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:11,117 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:11,140 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:11:11,141 INFO L131 PetriNetUnfolder]: For 3122/3262 co-relation queries the response was YES. [2022-12-06 00:11:11,141 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3122/3262 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2985 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:11:11,143 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:11,143 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:11:11,305 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:11:11,306 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 190 [2022-12-06 00:11:11,306 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:11:11,306 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:11:11,306 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:11:11,306 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:11:11,306 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable981 [2022-12-06 00:11:11,306 INFO L420 AbstractCegarLoop]: === Iteration 983 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:11:11,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:11:11,306 INFO L85 PathProgramCache]: Analyzing trace with hash -2020791674, now seen corresponding path program 1 times [2022-12-06 00:11:11,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:11:11,306 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172431603] [2022-12-06 00:11:11,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:11:11,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:11:11,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:11:11,370 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-06 00:11:11,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:11:11,370 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172431603] [2022-12-06 00:11:11,370 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [172431603] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:11:11,370 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:11:11,370 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:11:11,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560519935] [2022-12-06 00:11:11,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:11:11,370 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:11:11,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:11:11,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:11:11,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:11:11,371 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:11:11,371 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:11:11,371 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:11:11,371 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:11:11,371 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:11:11,647 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:11:11,647 INFO L131 PetriNetUnfolder]: For 26955/27000 co-relation queries the response was YES. [2022-12-06 00:11:11,652 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26955/27000 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13519 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:11:11,659 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:11:11,659 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:11:11,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:11:11,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:11:11,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:11:11,660 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:11:11,660 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:11:11,660 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:11:11,698 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:11:11,699 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:11,699 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:11:11,699 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:11:11,699 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:11:11,699 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:11,699 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:11:11,700 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:11:11,700 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:11,700 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:11,725 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:11:11,725 INFO L131 PetriNetUnfolder]: For 3122/3262 co-relation queries the response was YES. [2022-12-06 00:11:11,726 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3122/3262 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2980 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:11:11,728 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:11,728 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:11:11,878 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:11:11,878 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 179 [2022-12-06 00:11:11,878 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:11:11,878 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:11:11,878 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:11:11,878 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:11:11,879 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable982 [2022-12-06 00:11:11,879 INFO L420 AbstractCegarLoop]: === Iteration 984 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:11:11,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:11:11,879 INFO L85 PathProgramCache]: Analyzing trace with hash -277981339, now seen corresponding path program 1 times [2022-12-06 00:11:11,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:11:11,879 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538310323] [2022-12-06 00:11:11,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:11:11,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:11:11,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:11:11,937 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-06 00:11:11,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:11:11,938 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538310323] [2022-12-06 00:11:11,938 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1538310323] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:11:11,938 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:11:11,938 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:11:11,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095585993] [2022-12-06 00:11:11,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:11:11,938 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:11:11,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:11:11,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:11:11,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:11:11,938 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:11:11,938 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:11:11,938 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:11:11,938 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:11:11,939 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:11:12,207 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:11:12,207 INFO L131 PetriNetUnfolder]: For 27136/27181 co-relation queries the response was YES. [2022-12-06 00:11:12,212 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27136/27181 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13507 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:11:12,219 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:11:12,219 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:11:12,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:11:12,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:11:12,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:11:12,219 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:11:12,220 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:11:12,220 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:11:12,252 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:11:12,253 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:12,253 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:11:12,253 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:11:12,253 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:11:12,253 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:12,254 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:11:12,254 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:11:12,254 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:12,254 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:12,278 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:11:12,278 INFO L131 PetriNetUnfolder]: For 3156/3296 co-relation queries the response was YES. [2022-12-06 00:11:12,279 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3156/3296 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2997 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:11:12,281 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:12,281 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:11:12,420 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:11:12,420 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 167 [2022-12-06 00:11:12,420 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:11:12,420 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:11:12,420 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:11:12,420 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:11:12,420 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable983 [2022-12-06 00:11:12,420 INFO L420 AbstractCegarLoop]: === Iteration 985 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:11:12,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:11:12,421 INFO L85 PathProgramCache]: Analyzing trace with hash 1464828996, now seen corresponding path program 1 times [2022-12-06 00:11:12,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:11:12,421 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929608368] [2022-12-06 00:11:12,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:11:12,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:11:12,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:11:12,488 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-06 00:11:12,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:11:12,488 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929608368] [2022-12-06 00:11:12,488 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929608368] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:11:12,488 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:11:12,488 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:11:12,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32334262] [2022-12-06 00:11:12,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:11:12,488 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:11:12,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:11:12,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:11:12,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:11:12,489 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:11:12,489 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:11:12,489 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:11:12,489 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:11:12,489 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:11:12,798 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:11:12,798 INFO L131 PetriNetUnfolder]: For 27136/27181 co-relation queries the response was YES. [2022-12-06 00:11:12,802 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27136/27181 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13517 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:11:12,807 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:11:12,808 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:11:12,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:11:12,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:11:12,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:11:12,808 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:11:12,808 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:11:12,808 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:11:12,837 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:11:12,838 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:12,838 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:11:12,838 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:11:12,838 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:11:12,839 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:12,839 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:11:12,839 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:11:12,839 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:12,840 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:12,864 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:11:12,864 INFO L131 PetriNetUnfolder]: For 3174/3317 co-relation queries the response was YES. [2022-12-06 00:11:12,865 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3174/3317 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 3010 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:11:12,867 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:12,867 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:11:13,023 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:11:13,024 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 186 [2022-12-06 00:11:13,024 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:11:13,024 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:11:13,024 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:11:13,024 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:11:13,024 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable984 [2022-12-06 00:11:13,024 INFO L420 AbstractCegarLoop]: === Iteration 986 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:11:13,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:11:13,024 INFO L85 PathProgramCache]: Analyzing trace with hash -1087327965, now seen corresponding path program 1 times [2022-12-06 00:11:13,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:11:13,025 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653820583] [2022-12-06 00:11:13,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:11:13,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:11:13,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:11:13,094 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-06 00:11:13,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:11:13,094 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653820583] [2022-12-06 00:11:13,094 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1653820583] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:11:13,094 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:11:13,094 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:11:13,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688575709] [2022-12-06 00:11:13,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:11:13,094 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:11:13,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:11:13,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:11:13,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:11:13,095 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:11:13,095 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:11:13,095 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:11:13,095 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:11:13,095 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:11:13,375 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:11:13,375 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 00:11:13,381 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13559 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:11:13,388 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:11:13,388 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:11:13,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:11:13,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:11:13,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:11:13,389 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:11:13,389 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:11:13,389 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:11:13,425 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:11:13,426 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:13,426 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:11:13,426 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:11:13,426 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:11:13,427 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:13,427 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:11:13,427 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:11:13,427 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:13,428 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:13,453 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:11:13,453 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 00:11:13,454 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3312/3520 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2989 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:11:13,456 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:13,456 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:11:13,620 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:11:13,621 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 195 [2022-12-06 00:11:13,621 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:11:13,621 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:11:13,621 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:11:13,621 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:11:13,621 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable985 [2022-12-06 00:11:13,621 INFO L420 AbstractCegarLoop]: === Iteration 987 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:11:13,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:11:13,621 INFO L85 PathProgramCache]: Analyzing trace with hash 655482370, now seen corresponding path program 1 times [2022-12-06 00:11:13,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:11:13,622 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101599595] [2022-12-06 00:11:13,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:11:13,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:11:13,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:11:13,688 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-06 00:11:13,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:11:13,688 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101599595] [2022-12-06 00:11:13,689 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2101599595] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:11:13,689 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:11:13,689 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:11:13,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93042367] [2022-12-06 00:11:13,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:11:13,689 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:11:13,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:11:13,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:11:13,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:11:13,689 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:11:13,689 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:11:13,689 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:11:13,689 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:11:13,689 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:11:13,959 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:11:13,960 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:11:13,965 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13574 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:11:13,972 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:11:13,972 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:11:13,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:11:13,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:11:13,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:11:13,972 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:11:13,973 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:11:13,973 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:11:14,006 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:11:14,007 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:14,007 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:11:14,007 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:11:14,007 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:11:14,007 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:14,008 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:11:14,008 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:11:14,008 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:14,008 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:14,032 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:11:14,032 INFO L131 PetriNetUnfolder]: For 3308/3518 co-relation queries the response was YES. [2022-12-06 00:11:14,033 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3308/3518 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2997 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:11:14,035 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:14,035 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:11:14,178 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:11:14,179 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 172 [2022-12-06 00:11:14,179 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:11:14,179 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:11:14,179 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:11:14,179 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:11:14,179 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable986 [2022-12-06 00:11:14,179 INFO L420 AbstractCegarLoop]: === Iteration 988 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:11:14,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:11:14,179 INFO L85 PathProgramCache]: Analyzing trace with hash -1896674591, now seen corresponding path program 1 times [2022-12-06 00:11:14,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:11:14,179 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896598008] [2022-12-06 00:11:14,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:11:14,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:11:14,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:11:14,242 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-06 00:11:14,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:11:14,242 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896598008] [2022-12-06 00:11:14,242 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [896598008] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:11:14,242 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:11:14,242 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:11:14,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535350719] [2022-12-06 00:11:14,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:11:14,243 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:11:14,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:11:14,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:11:14,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:11:14,243 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:11:14,243 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:11:14,243 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:11:14,243 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:11:14,243 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:11:14,537 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:11:14,538 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 00:11:14,542 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26965/27010 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13516 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:11:14,548 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:11:14,548 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:11:14,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:11:14,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:11:14,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:11:14,549 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:11:14,549 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:11:14,549 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:11:14,579 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:11:14,580 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:14,580 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:11:14,581 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:11:14,581 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:11:14,581 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:14,581 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:11:14,581 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:11:14,581 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:14,582 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:14,605 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:11:14,606 INFO L131 PetriNetUnfolder]: For 3122/3262 co-relation queries the response was YES. [2022-12-06 00:11:14,607 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3122/3262 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2982 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:11:14,609 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:14,609 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:11:14,753 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:11:14,753 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 172 [2022-12-06 00:11:14,753 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:11:14,753 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:11:14,753 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:11:14,753 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:11:14,753 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable987 [2022-12-06 00:11:14,754 INFO L420 AbstractCegarLoop]: === Iteration 989 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:11:14,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:11:14,754 INFO L85 PathProgramCache]: Analyzing trace with hash -153864256, now seen corresponding path program 1 times [2022-12-06 00:11:14,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:11:14,754 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395353285] [2022-12-06 00:11:14,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:11:14,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:11:14,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:11:14,826 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-06 00:11:14,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:11:14,826 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395353285] [2022-12-06 00:11:14,827 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1395353285] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:11:14,827 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:11:14,827 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:11:14,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845724546] [2022-12-06 00:11:14,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:11:14,827 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:11:14,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:11:14,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:11:14,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:11:14,827 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:11:14,827 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:11:14,827 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:11:14,827 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:11:14,827 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:11:15,109 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:11:15,110 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 00:11:15,115 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13555 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:11:15,123 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:11:15,123 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:11:15,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:11:15,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:11:15,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:11:15,123 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:11:15,123 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:11:15,124 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:11:15,155 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:11:15,156 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:15,157 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:11:15,157 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:11:15,157 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:11:15,157 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:15,157 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:11:15,157 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:11:15,157 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:15,158 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:15,181 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:11:15,181 INFO L131 PetriNetUnfolder]: For 3338/3547 co-relation queries the response was YES. [2022-12-06 00:11:15,182 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3338/3547 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2977 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:11:15,184 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:15,184 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:11:15,330 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:11:15,330 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 173 [2022-12-06 00:11:15,330 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:11:15,330 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:11:15,330 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:11:15,330 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:11:15,330 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable988 [2022-12-06 00:11:15,331 INFO L420 AbstractCegarLoop]: === Iteration 990 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:11:15,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:11:15,331 INFO L85 PathProgramCache]: Analyzing trace with hash 1588946079, now seen corresponding path program 1 times [2022-12-06 00:11:15,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:11:15,331 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846960331] [2022-12-06 00:11:15,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:11:15,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:11:15,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:11:15,402 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-06 00:11:15,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:11:15,402 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846960331] [2022-12-06 00:11:15,402 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [846960331] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:11:15,402 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:11:15,402 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:11:15,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215718854] [2022-12-06 00:11:15,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:11:15,403 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:11:15,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:11:15,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:11:15,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:11:15,403 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:11:15,403 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:11:15,403 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:11:15,403 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:11:15,403 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:11:15,682 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:11:15,683 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:11:15,688 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13542 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:11:15,695 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:11:15,695 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:11:15,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:11:15,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:11:15,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:11:15,696 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:11:15,696 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:11:15,696 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:11:15,732 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:11:15,733 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:15,733 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:11:15,734 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:11:15,734 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:11:15,734 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:15,734 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:11:15,734 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:11:15,734 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:15,735 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:15,759 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:11:15,759 INFO L131 PetriNetUnfolder]: For 3301/3509 co-relation queries the response was YES. [2022-12-06 00:11:15,760 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3301/3509 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2984 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:11:15,762 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:15,762 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:11:15,924 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:11:15,925 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 191 [2022-12-06 00:11:15,925 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:11:15,925 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:11:15,925 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:11:15,925 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:11:15,925 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable989 [2022-12-06 00:11:15,925 INFO L420 AbstractCegarLoop]: === Iteration 991 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:11:15,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:11:15,925 INFO L85 PathProgramCache]: Analyzing trace with hash -963210882, now seen corresponding path program 1 times [2022-12-06 00:11:15,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:11:15,925 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403154711] [2022-12-06 00:11:15,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:11:15,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:11:15,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:11:15,999 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-06 00:11:15,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:11:15,999 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403154711] [2022-12-06 00:11:16,000 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1403154711] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:11:16,000 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:11:16,000 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:11:16,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256691347] [2022-12-06 00:11:16,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:11:16,000 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:11:16,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:11:16,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:11:16,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:11:16,000 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:11:16,000 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:11:16,000 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:11:16,000 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:11:16,000 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:11:16,295 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:11:16,295 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:11:16,299 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13550 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:11:16,305 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:11:16,305 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:11:16,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:11:16,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:11:16,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:11:16,306 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:11:16,306 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:11:16,306 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:11:16,337 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:11:16,338 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:16,338 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:11:16,338 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:11:16,338 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:11:16,338 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:16,339 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:11:16,339 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:11:16,339 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:16,339 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:16,363 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:11:16,363 INFO L131 PetriNetUnfolder]: For 3310/3519 co-relation queries the response was YES. [2022-12-06 00:11:16,364 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3310/3519 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2988 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:11:16,365 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:16,365 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:11:16,526 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:11:16,527 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 189 [2022-12-06 00:11:16,527 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:11:16,527 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:11:16,527 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:11:16,527 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:11:16,527 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable990 [2022-12-06 00:11:16,527 INFO L420 AbstractCegarLoop]: === Iteration 992 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:11:16,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:11:16,527 INFO L85 PathProgramCache]: Analyzing trace with hash 779599453, now seen corresponding path program 1 times [2022-12-06 00:11:16,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:11:16,527 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201150482] [2022-12-06 00:11:16,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:11:16,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:11:16,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:11:16,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-06 00:11:16,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:11:16,584 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201150482] [2022-12-06 00:11:16,584 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [201150482] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:11:16,584 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:11:16,584 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:11:16,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078270232] [2022-12-06 00:11:16,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:11:16,584 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:11:16,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:11:16,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:11:16,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:11:16,584 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:11:16,584 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:11:16,584 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:11:16,584 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:11:16,584 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:11:16,861 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:11:16,861 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:11:16,866 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13554 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:11:16,873 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:11:16,873 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:11:16,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:11:16,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:11:16,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:11:16,873 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:11:16,873 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:11:16,873 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:11:16,910 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:11:16,911 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:16,911 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:11:16,911 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:11:16,911 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:11:16,911 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:16,912 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:11:16,912 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:11:16,912 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:16,912 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:16,940 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:11:16,940 INFO L131 PetriNetUnfolder]: For 3301/3509 co-relation queries the response was YES. [2022-12-06 00:11:16,941 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3301/3509 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2978 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:11:16,942 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:16,943 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:11:17,085 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:11:17,085 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 174 [2022-12-06 00:11:17,085 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:11:17,085 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:11:17,086 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:11:17,086 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:11:17,086 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable991 [2022-12-06 00:11:17,086 INFO L420 AbstractCegarLoop]: === Iteration 993 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:11:17,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:11:17,086 INFO L85 PathProgramCache]: Analyzing trace with hash -1772557508, now seen corresponding path program 1 times [2022-12-06 00:11:17,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:11:17,086 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338035773] [2022-12-06 00:11:17,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:11:17,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:11:17,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:11:17,152 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-06 00:11:17,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:11:17,152 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338035773] [2022-12-06 00:11:17,153 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1338035773] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:11:17,153 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:11:17,153 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:11:17,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111752077] [2022-12-06 00:11:17,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:11:17,153 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:11:17,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:11:17,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:11:17,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:11:17,153 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:11:17,153 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:11:17,153 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:11:17,153 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:11:17,153 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:11:17,418 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:11:17,418 INFO L131 PetriNetUnfolder]: For 26955/27000 co-relation queries the response was YES. [2022-12-06 00:11:17,423 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26955/27000 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13525 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:11:17,429 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:11:17,429 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:11:17,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:11:17,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:11:17,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:11:17,430 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:11:17,430 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:11:17,430 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:11:17,465 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:11:17,466 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:17,466 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:11:17,466 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:11:17,467 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:11:17,467 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:17,467 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:11:17,467 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:11:17,467 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:17,468 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:17,491 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:11:17,491 INFO L131 PetriNetUnfolder]: For 3146/3287 co-relation queries the response was YES. [2022-12-06 00:11:17,491 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3146/3287 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2987 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:11:17,493 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:17,493 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:11:17,658 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:11:17,658 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 191 [2022-12-06 00:11:17,658 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:11:17,658 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:11:17,659 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:11:17,659 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:11:17,659 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable992 [2022-12-06 00:11:17,659 INFO L420 AbstractCegarLoop]: === Iteration 994 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:11:17,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:11:17,659 INFO L85 PathProgramCache]: Analyzing trace with hash -29747173, now seen corresponding path program 1 times [2022-12-06 00:11:17,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:11:17,659 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380048592] [2022-12-06 00:11:17,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:11:17,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:11:17,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:11:17,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:11:17,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:11:17,739 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380048592] [2022-12-06 00:11:17,739 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1380048592] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:11:17,739 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:11:17,739 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:11:17,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644181388] [2022-12-06 00:11:17,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:11:17,739 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:11:17,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:11:17,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:11:17,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:11:17,740 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:11:17,740 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:11:17,740 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:11:17,740 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:11:17,740 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:11:18,033 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:11:18,033 INFO L131 PetriNetUnfolder]: For 27229/27274 co-relation queries the response was YES. [2022-12-06 00:11:18,037 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27229/27274 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13546 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:11:18,043 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:11:18,043 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:11:18,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:11:18,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:11:18,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:11:18,043 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:11:18,043 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:11:18,043 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:11:18,072 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:11:18,073 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:18,074 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:11:18,074 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:11:18,074 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:11:18,074 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:18,074 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:11:18,074 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:11:18,074 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:18,075 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:18,098 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:11:18,098 INFO L131 PetriNetUnfolder]: For 3309/3518 co-relation queries the response was YES. [2022-12-06 00:11:18,099 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3309/3518 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2976 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:11:18,101 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:18,101 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:11:18,244 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:11:18,244 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 170 [2022-12-06 00:11:18,245 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:11:18,245 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:11:18,245 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:11:18,245 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:11:18,245 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable993 [2022-12-06 00:11:18,245 INFO L420 AbstractCegarLoop]: === Iteration 995 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:11:18,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:11:18,245 INFO L85 PathProgramCache]: Analyzing trace with hash 1713063162, now seen corresponding path program 1 times [2022-12-06 00:11:18,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:11:18,245 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987466597] [2022-12-06 00:11:18,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:11:18,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:11:18,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:11:18,306 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-06 00:11:18,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:11:18,306 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987466597] [2022-12-06 00:11:18,306 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [987466597] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:11:18,306 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:11:18,306 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:11:18,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150010776] [2022-12-06 00:11:18,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:11:18,306 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:11:18,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:11:18,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:11:18,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:11:18,307 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:11:18,307 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:11:18,307 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:11:18,307 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:11:18,307 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:11:18,572 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:11:18,572 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 00:11:18,577 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26965/27010 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13522 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:11:18,584 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:11:18,584 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:11:18,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:11:18,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:11:18,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:11:18,585 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:11:18,585 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:11:18,585 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:11:18,617 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:11:18,618 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:18,618 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:11:18,618 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:11:18,618 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:11:18,618 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:18,619 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:11:18,619 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:11:18,619 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:18,619 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:18,643 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:11:18,643 INFO L131 PetriNetUnfolder]: For 3122/3262 co-relation queries the response was YES. [2022-12-06 00:11:18,644 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3122/3262 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2976 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:11:18,646 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:18,646 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:11:18,807 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:11:18,807 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 189 [2022-12-06 00:11:18,807 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:11:18,807 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:11:18,807 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:11:18,807 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:11:18,807 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable994 [2022-12-06 00:11:18,807 INFO L420 AbstractCegarLoop]: === Iteration 996 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:11:18,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:11:18,808 INFO L85 PathProgramCache]: Analyzing trace with hash -839093799, now seen corresponding path program 1 times [2022-12-06 00:11:18,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:11:18,808 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855515787] [2022-12-06 00:11:18,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:11:18,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:11:18,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:11:18,867 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-06 00:11:18,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:11:18,867 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855515787] [2022-12-06 00:11:18,867 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1855515787] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:11:18,868 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:11:18,868 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:11:18,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391417488] [2022-12-06 00:11:18,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:11:18,868 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:11:18,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:11:18,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:11:18,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:11:18,868 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:11:18,868 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:11:18,868 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:11:18,868 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:11:18,868 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:11:19,138 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:11:19,138 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 00:11:19,143 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13584 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:11:19,150 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:11:19,151 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:11:19,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:11:19,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:11:19,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:11:19,151 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:11:19,151 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:11:19,151 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:11:19,185 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:11:19,186 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:19,186 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:11:19,187 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:11:19,187 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:11:19,187 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:19,187 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:11:19,187 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:11:19,187 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:19,188 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:19,211 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:11:19,211 INFO L131 PetriNetUnfolder]: For 3301/3509 co-relation queries the response was YES. [2022-12-06 00:11:19,212 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3301/3509 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 3000 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:11:19,214 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:19,214 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:11:19,367 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:11:19,368 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 181 [2022-12-06 00:11:19,368 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:11:19,368 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:11:19,368 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:11:19,368 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:11:19,368 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable995 [2022-12-06 00:11:19,368 INFO L420 AbstractCegarLoop]: === Iteration 997 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:11:19,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:11:19,368 INFO L85 PathProgramCache]: Analyzing trace with hash 903716536, now seen corresponding path program 1 times [2022-12-06 00:11:19,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:11:19,369 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539477117] [2022-12-06 00:11:19,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:11:19,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:11:19,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:11:19,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-06 00:11:19,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:11:19,437 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539477117] [2022-12-06 00:11:19,438 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1539477117] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:11:19,438 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:11:19,438 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:11:19,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813329196] [2022-12-06 00:11:19,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:11:19,438 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:11:19,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:11:19,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:11:19,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:11:19,438 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:11:19,438 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:11:19,438 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:11:19,438 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:11:19,438 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:11:19,744 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:11:19,744 INFO L131 PetriNetUnfolder]: For 27136/27181 co-relation queries the response was YES. [2022-12-06 00:11:19,749 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27136/27181 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13558 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:11:19,755 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:11:19,755 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:11:19,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:11:19,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:11:19,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:11:19,756 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:11:19,756 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:11:19,756 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:11:19,785 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:11:19,786 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:19,786 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:11:19,787 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:11:19,787 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:11:19,787 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:19,787 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:11:19,787 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:11:19,787 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:19,788 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:19,811 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:11:19,811 INFO L131 PetriNetUnfolder]: For 3185/3328 co-relation queries the response was YES. [2022-12-06 00:11:19,812 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3185/3328 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2996 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:11:19,814 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:19,814 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:11:19,957 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:11:19,957 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 170 [2022-12-06 00:11:19,957 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:11:19,958 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:11:19,958 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:11:19,958 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:11:19,958 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable996 [2022-12-06 00:11:19,958 INFO L420 AbstractCegarLoop]: === Iteration 998 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:11:19,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:11:19,958 INFO L85 PathProgramCache]: Analyzing trace with hash -1648440425, now seen corresponding path program 1 times [2022-12-06 00:11:19,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:11:19,958 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695360001] [2022-12-06 00:11:19,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:11:19,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:11:19,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:11:20,027 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-06 00:11:20,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:11:20,027 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695360001] [2022-12-06 00:11:20,027 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1695360001] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:11:20,027 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:11:20,027 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:11:20,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494209867] [2022-12-06 00:11:20,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:11:20,027 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:11:20,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:11:20,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:11:20,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:11:20,028 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:11:20,028 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:11:20,028 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:11:20,028 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:11:20,028 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:11:20,307 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:11:20,307 INFO L131 PetriNetUnfolder]: For 27146/27191 co-relation queries the response was YES. [2022-12-06 00:11:20,313 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27146/27191 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13515 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:11:20,321 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:11:20,321 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:11:20,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:11:20,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:11:20,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:11:20,322 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:11:20,322 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:11:20,322 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:11:20,355 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:11:20,356 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:20,356 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:11:20,357 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:11:20,357 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:11:20,357 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:20,357 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:11:20,357 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:11:20,357 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:20,358 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:20,382 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:11:20,382 INFO L131 PetriNetUnfolder]: For 3167/3307 co-relation queries the response was YES. [2022-12-06 00:11:20,383 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3167/3307 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2995 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:11:20,385 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:20,385 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:11:20,542 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:11:20,542 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 185 [2022-12-06 00:11:20,542 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:11:20,542 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:11:20,542 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:11:20,542 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:11:20,542 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable997 [2022-12-06 00:11:20,543 INFO L420 AbstractCegarLoop]: === Iteration 999 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:11:20,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:11:20,543 INFO L85 PathProgramCache]: Analyzing trace with hash 94369910, now seen corresponding path program 1 times [2022-12-06 00:11:20,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:11:20,543 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165545163] [2022-12-06 00:11:20,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:11:20,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:11:20,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:11:20,604 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-06 00:11:20,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:11:20,604 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165545163] [2022-12-06 00:11:20,604 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [165545163] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:11:20,604 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:11:20,604 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:11:20,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121374684] [2022-12-06 00:11:20,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:11:20,605 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:11:20,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:11:20,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:11:20,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:11:20,605 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:11:20,605 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:11:20,605 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:11:20,605 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:11:20,605 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:11:20,877 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:11:20,877 INFO L131 PetriNetUnfolder]: For 27229/27274 co-relation queries the response was YES. [2022-12-06 00:11:20,883 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27229/27274 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13572 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:11:20,892 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:11:20,892 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:11:20,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:11:20,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:11:20,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:11:20,893 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:11:20,893 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:11:20,893 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:11:20,927 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:11:20,928 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:20,928 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:11:20,928 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:11:20,928 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:11:20,928 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:20,929 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:11:20,929 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:11:20,929 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:20,929 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:20,953 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:11:20,953 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 00:11:20,954 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3321/3530 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2980 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:11:20,956 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:20,956 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:11:21,116 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:11:21,116 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 188 [2022-12-06 00:11:21,116 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:11:21,117 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:11:21,117 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:11:21,117 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:11:21,117 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable998 [2022-12-06 00:11:21,117 INFO L420 AbstractCegarLoop]: === Iteration 1000 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:11:21,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:11:21,117 INFO L85 PathProgramCache]: Analyzing trace with hash 1837180245, now seen corresponding path program 1 times [2022-12-06 00:11:21,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:11:21,117 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983559351] [2022-12-06 00:11:21,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:11:21,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:11:21,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:11:21,177 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-06 00:11:21,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:11:21,177 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983559351] [2022-12-06 00:11:21,177 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [983559351] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:11:21,177 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:11:21,177 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:11:21,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832502242] [2022-12-06 00:11:21,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:11:21,177 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:11:21,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:11:21,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:11:21,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:11:21,178 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:11:21,178 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:11:21,178 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:11:21,178 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:11:21,178 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:11:21,484 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:11:21,485 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 00:11:21,489 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26965/27010 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13524 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:11:21,496 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:11:21,496 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:11:21,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:11:21,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:11:21,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:11:21,497 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:11:21,497 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:11:21,497 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:11:21,528 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:11:21,529 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:21,530 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:11:21,530 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:11:21,530 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:11:21,530 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:21,531 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:11:21,531 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:11:21,531 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:21,532 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:21,556 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:11:21,557 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 00:11:21,558 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3133/3273 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2983 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:11:21,560 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:21,560 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:11:21,705 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:11:21,706 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 176 [2022-12-06 00:11:21,706 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:11:21,706 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:11:21,706 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:11:21,706 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:11:21,706 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable999 [2022-12-06 00:11:21,706 INFO L420 AbstractCegarLoop]: === Iteration 1001 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:11:21,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:11:21,706 INFO L85 PathProgramCache]: Analyzing trace with hash -714976716, now seen corresponding path program 1 times [2022-12-06 00:11:21,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:11:21,707 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223189606] [2022-12-06 00:11:21,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:11:21,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:11:21,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:11:21,766 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-06 00:11:21,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:11:21,766 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223189606] [2022-12-06 00:11:21,766 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1223189606] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:11:21,766 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:11:21,766 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:11:21,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326756534] [2022-12-06 00:11:21,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:11:21,766 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:11:21,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:11:21,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:11:21,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:11:21,767 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:11:21,767 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:11:21,767 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:11:21,767 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:11:21,767 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:11:22,040 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:11:22,040 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:11:22,046 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13545 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:11:22,053 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:11:22,053 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:11:22,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:11:22,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:11:22,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:11:22,054 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:11:22,054 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:11:22,054 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:11:22,089 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:11:22,090 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:22,090 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:11:22,091 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:11:22,091 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:11:22,091 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:22,091 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:11:22,091 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:11:22,091 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:22,092 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:22,116 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:11:22,116 INFO L131 PetriNetUnfolder]: For 3338/3547 co-relation queries the response was YES. [2022-12-06 00:11:22,117 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3338/3547 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2973 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:11:22,119 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:22,119 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:11:22,274 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:11:22,274 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 183 [2022-12-06 00:11:22,274 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:11:22,274 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:11:22,274 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:11:22,274 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:11:22,274 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1000 [2022-12-06 00:11:22,274 INFO L420 AbstractCegarLoop]: === Iteration 1002 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:11:22,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:11:22,275 INFO L85 PathProgramCache]: Analyzing trace with hash 1027833619, now seen corresponding path program 1 times [2022-12-06 00:11:22,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:11:22,275 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427133257] [2022-12-06 00:11:22,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:11:22,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:11:22,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:11:22,330 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-06 00:11:22,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:11:22,330 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427133257] [2022-12-06 00:11:22,330 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [427133257] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:11:22,330 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:11:22,330 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:11:22,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495467017] [2022-12-06 00:11:22,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:11:22,330 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:11:22,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:11:22,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:11:22,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:11:22,331 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:11:22,331 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:11:22,331 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:11:22,331 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:11:22,331 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:11:22,610 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:11:22,611 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 00:11:22,616 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26969/27014 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13514 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:11:22,624 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:11:22,624 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:11:22,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:11:22,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:11:22,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:11:22,625 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:11:22,625 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:11:22,625 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:11:22,660 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:11:22,661 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:22,661 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:11:22,661 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:11:22,661 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:11:22,661 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:22,662 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:11:22,662 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:11:22,662 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:22,662 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:22,686 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:11:22,686 INFO L131 PetriNetUnfolder]: For 3122/3262 co-relation queries the response was YES. [2022-12-06 00:11:22,687 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3122/3262 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2982 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:11:22,689 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:22,689 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:11:22,856 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:11:22,856 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 195 [2022-12-06 00:11:22,856 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:11:22,856 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:11:22,856 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:11:22,856 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:11:22,856 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1001 [2022-12-06 00:11:22,857 INFO L420 AbstractCegarLoop]: === Iteration 1003 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:11:22,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:11:22,857 INFO L85 PathProgramCache]: Analyzing trace with hash -1524323342, now seen corresponding path program 1 times [2022-12-06 00:11:22,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:11:22,857 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128631192] [2022-12-06 00:11:22,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:11:22,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:11:22,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:11:22,943 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-06 00:11:22,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:11:22,943 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128631192] [2022-12-06 00:11:22,943 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [128631192] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:11:22,943 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:11:22,944 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:11:22,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798336978] [2022-12-06 00:11:22,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:11:22,944 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:11:22,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:11:22,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:11:22,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:11:22,944 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:11:22,944 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:11:22,944 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:11:22,944 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:11:22,944 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:11:23,250 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:11:23,251 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 00:11:23,255 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13577 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:11:23,261 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:11:23,261 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:11:23,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:11:23,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:11:23,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:11:23,262 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:11:23,262 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:11:23,262 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:11:23,292 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:11:23,293 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:23,293 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:11:23,293 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:11:23,293 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:11:23,293 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:23,294 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:11:23,294 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:11:23,294 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:23,294 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:23,318 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:11:23,318 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 00:11:23,319 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3312/3520 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2971 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:11:23,321 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:23,321 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:11:23,463 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:11:23,463 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 170 [2022-12-06 00:11:23,463 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:11:23,463 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:11:23,463 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:11:23,463 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:11:23,463 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1002 [2022-12-06 00:11:23,463 INFO L420 AbstractCegarLoop]: === Iteration 1004 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:11:23,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:11:23,464 INFO L85 PathProgramCache]: Analyzing trace with hash 218486993, now seen corresponding path program 1 times [2022-12-06 00:11:23,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:11:23,464 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292652562] [2022-12-06 00:11:23,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:11:23,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:11:23,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:11:23,523 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-06 00:11:23,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:11:23,523 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292652562] [2022-12-06 00:11:23,523 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [292652562] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:11:23,523 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:11:23,523 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:11:23,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15665157] [2022-12-06 00:11:23,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:11:23,524 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:11:23,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:11:23,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:11:23,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:11:23,524 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:11:23,524 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:11:23,524 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:11:23,524 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:11:23,524 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:11:23,800 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:11:23,800 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:11:23,808 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13555 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:11:23,816 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:11:23,816 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:11:23,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:11:23,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:11:23,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:11:23,817 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:11:23,817 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:11:23,817 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:11:23,854 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:11:23,856 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:23,856 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:11:23,856 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:11:23,856 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:11:23,856 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:23,857 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:11:23,857 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:11:23,857 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:23,858 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:23,885 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:11:23,885 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 00:11:23,886 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3321/3530 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2972 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:11:23,888 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:23,888 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:11:24,042 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:11:24,042 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 186 [2022-12-06 00:11:24,042 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:11:24,042 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:11:24,042 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:11:24,042 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:11:24,042 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1003 [2022-12-06 00:11:24,042 INFO L420 AbstractCegarLoop]: === Iteration 1005 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:11:24,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:11:24,043 INFO L85 PathProgramCache]: Analyzing trace with hash 1961297328, now seen corresponding path program 1 times [2022-12-06 00:11:24,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:11:24,043 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958718180] [2022-12-06 00:11:24,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:11:24,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:11:24,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:11:24,102 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-06 00:11:24,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:11:24,103 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958718180] [2022-12-06 00:11:24,103 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [958718180] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:11:24,103 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:11:24,103 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:11:24,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577132333] [2022-12-06 00:11:24,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:11:24,103 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:11:24,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:11:24,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:11:24,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:11:24,103 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:11:24,103 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:11:24,103 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:11:24,104 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:11:24,104 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:11:24,373 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:11:24,374 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:11:24,379 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13566 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:11:24,387 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:11:24,387 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:11:24,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:11:24,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:11:24,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:11:24,387 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:11:24,387 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:11:24,388 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:11:24,424 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:11:24,425 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:24,425 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:11:24,425 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:11:24,425 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:11:24,425 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:24,426 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:11:24,426 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:11:24,426 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:24,426 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:24,450 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:11:24,450 INFO L131 PetriNetUnfolder]: For 3338/3550 co-relation queries the response was YES. [2022-12-06 00:11:24,451 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3338/3550 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2970 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:11:24,453 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:24,453 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:11:24,595 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:11:24,595 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 170 [2022-12-06 00:11:24,595 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:11:24,595 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:11:24,595 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:11:24,595 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:11:24,595 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1004 [2022-12-06 00:11:24,595 INFO L420 AbstractCegarLoop]: === Iteration 1006 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:11:24,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:11:24,596 INFO L85 PathProgramCache]: Analyzing trace with hash -590859633, now seen corresponding path program 1 times [2022-12-06 00:11:24,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:11:24,596 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686744930] [2022-12-06 00:11:24,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:11:24,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:11:24,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:11:24,656 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-06 00:11:24,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:11:24,656 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686744930] [2022-12-06 00:11:24,656 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [686744930] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:11:24,656 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:11:24,656 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:11:24,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93435868] [2022-12-06 00:11:24,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:11:24,656 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:11:24,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:11:24,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:11:24,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:11:24,657 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:11:24,657 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:11:24,657 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:11:24,657 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:11:24,657 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:11:24,956 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:11:24,956 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:11:24,960 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13559 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:11:24,966 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:11:24,966 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:11:24,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:11:24,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:11:24,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:11:24,967 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:11:24,967 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:11:24,967 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:11:24,998 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:11:24,999 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:24,999 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:11:24,999 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:11:24,999 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:11:24,999 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:25,000 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:11:25,000 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:11:25,000 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:25,000 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:25,029 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:11:25,029 INFO L131 PetriNetUnfolder]: For 3304/3511 co-relation queries the response was YES. [2022-12-06 00:11:25,030 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3304/3511 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2990 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:11:25,032 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:25,032 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:11:25,211 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:11:25,212 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 213 [2022-12-06 00:11:25,212 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:11:25,212 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:11:25,212 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:11:25,212 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:11:25,212 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1005 [2022-12-06 00:11:25,212 INFO L420 AbstractCegarLoop]: === Iteration 1007 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:11:25,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:11:25,213 INFO L85 PathProgramCache]: Analyzing trace with hash 1151950702, now seen corresponding path program 1 times [2022-12-06 00:11:25,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:11:25,213 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758652612] [2022-12-06 00:11:25,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:11:25,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:11:25,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:11:25,274 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-06 00:11:25,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:11:25,274 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758652612] [2022-12-06 00:11:25,274 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1758652612] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:11:25,274 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:11:25,274 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:11:25,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674218650] [2022-12-06 00:11:25,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:11:25,275 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:11:25,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:11:25,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:11:25,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:11:25,275 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:11:25,275 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:11:25,275 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:11:25,275 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:11:25,275 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:11:25,555 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:11:25,555 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:11:25,561 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13592 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:11:25,568 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:11:25,569 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:11:25,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:11:25,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:11:25,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:11:25,569 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:11:25,569 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:11:25,569 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:11:25,604 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:11:25,605 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:25,605 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:11:25,605 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:11:25,605 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:11:25,605 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:25,605 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:11:25,606 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:11:25,606 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:25,606 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:25,630 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:11:25,630 INFO L131 PetriNetUnfolder]: For 3307/3517 co-relation queries the response was YES. [2022-12-06 00:11:25,631 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3307/3517 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2977 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:11:25,633 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:25,633 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:11:25,774 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:11:25,775 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 170 [2022-12-06 00:11:25,775 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:11:25,775 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:11:25,775 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:11:25,775 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:11:25,775 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1006 [2022-12-06 00:11:25,775 INFO L420 AbstractCegarLoop]: === Iteration 1008 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:11:25,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:11:25,775 INFO L85 PathProgramCache]: Analyzing trace with hash -1400206259, now seen corresponding path program 1 times [2022-12-06 00:11:25,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:11:25,775 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027223173] [2022-12-06 00:11:25,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:11:25,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:11:25,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:11:25,835 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-06 00:11:25,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:11:25,835 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027223173] [2022-12-06 00:11:25,835 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2027223173] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:11:25,835 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:11:25,835 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:11:25,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399042384] [2022-12-06 00:11:25,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:11:25,836 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:11:25,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:11:25,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:11:25,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:11:25,836 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:11:25,836 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:11:25,836 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:11:25,836 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:11:25,836 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:11:26,121 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:11:26,121 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:11:26,126 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13552 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:11:26,134 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:11:26,134 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:11:26,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:11:26,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:11:26,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:11:26,134 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:11:26,134 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:11:26,134 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:11:26,169 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:11:26,170 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:26,170 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:11:26,170 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:11:26,170 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:11:26,170 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:26,171 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:11:26,171 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:11:26,171 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:26,172 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:26,195 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:11:26,195 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 00:11:26,196 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3321/3530 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2993 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:11:26,198 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:26,198 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:11:26,356 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:11:26,357 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 187 [2022-12-06 00:11:26,357 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:11:26,357 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:11:26,357 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:11:26,357 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:11:26,357 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1007 [2022-12-06 00:11:26,357 INFO L420 AbstractCegarLoop]: === Iteration 1009 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:11:26,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:11:26,357 INFO L85 PathProgramCache]: Analyzing trace with hash 342604076, now seen corresponding path program 1 times [2022-12-06 00:11:26,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:11:26,358 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571893981] [2022-12-06 00:11:26,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:11:26,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:11:26,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:11:26,419 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-06 00:11:26,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:11:26,419 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571893981] [2022-12-06 00:11:26,419 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [571893981] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:11:26,419 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:11:26,419 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:11:26,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532992035] [2022-12-06 00:11:26,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:11:26,419 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:11:26,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:11:26,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:11:26,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:11:26,420 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:11:26,420 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:11:26,420 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:11:26,420 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:11:26,420 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:11:26,717 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:11:26,717 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:11:26,721 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13587 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:11:26,727 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:11:26,727 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:11:26,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:11:26,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:11:26,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:11:26,728 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:11:26,728 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:11:26,728 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:11:26,758 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:11:26,759 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:26,759 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:11:26,759 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:11:26,759 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:11:26,759 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:26,760 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:11:26,760 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:11:26,760 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:26,760 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:26,784 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:11:26,785 INFO L131 PetriNetUnfolder]: For 3337/3547 co-relation queries the response was YES. [2022-12-06 00:11:26,785 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3337/3547 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2992 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:11:26,787 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:26,787 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:11:26,946 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:11:26,947 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 188 [2022-12-06 00:11:26,947 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:11:26,947 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:11:26,947 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:11:26,947 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:11:26,947 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1008 [2022-12-06 00:11:26,947 INFO L420 AbstractCegarLoop]: === Iteration 1010 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:11:26,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:11:26,947 INFO L85 PathProgramCache]: Analyzing trace with hash 2085414411, now seen corresponding path program 1 times [2022-12-06 00:11:26,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:11:26,948 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807298211] [2022-12-06 00:11:26,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:11:26,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:11:26,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:11:27,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-06 00:11:27,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:11:27,005 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807298211] [2022-12-06 00:11:27,005 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [807298211] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:11:27,005 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:11:27,005 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:11:27,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990931025] [2022-12-06 00:11:27,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:11:27,005 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:11:27,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:11:27,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:11:27,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:11:27,005 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:11:27,006 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:11:27,006 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:11:27,006 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:11:27,006 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:11:27,273 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:11:27,274 INFO L131 PetriNetUnfolder]: For 27136/27181 co-relation queries the response was YES. [2022-12-06 00:11:27,279 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27136/27181 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13525 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:11:27,286 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:11:27,286 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:11:27,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:11:27,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:11:27,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:11:27,287 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:11:27,287 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:11:27,287 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:11:27,321 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:11:27,322 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:27,322 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:11:27,323 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:11:27,323 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:11:27,323 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:27,323 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:11:27,323 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:11:27,323 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:27,324 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:27,348 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:11:27,348 INFO L131 PetriNetUnfolder]: For 3168/3309 co-relation queries the response was YES. [2022-12-06 00:11:27,349 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3168/3309 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2998 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:11:27,351 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:27,351 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:11:27,502 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:11:27,502 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 179 [2022-12-06 00:11:27,502 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:11:27,502 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:11:27,502 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:11:27,502 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:11:27,502 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1009 [2022-12-06 00:11:27,502 INFO L420 AbstractCegarLoop]: === Iteration 1011 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:11:27,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:11:27,503 INFO L85 PathProgramCache]: Analyzing trace with hash -466742550, now seen corresponding path program 1 times [2022-12-06 00:11:27,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:11:27,503 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784138649] [2022-12-06 00:11:27,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:11:27,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:11:27,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:11:27,562 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-06 00:11:27,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:11:27,562 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784138649] [2022-12-06 00:11:27,562 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [784138649] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:11:27,562 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:11:27,562 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:11:27,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419557825] [2022-12-06 00:11:27,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:11:27,563 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:11:27,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:11:27,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:11:27,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:11:27,563 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:11:27,563 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:11:27,563 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:11:27,563 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:11:27,563 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:11:27,819 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:11:27,819 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:11:27,824 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13568 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:11:27,831 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:11:27,831 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:11:27,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:11:27,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:11:27,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:11:27,831 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:11:27,831 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:11:27,831 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:11:27,864 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:11:27,865 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:27,866 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:11:27,866 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:11:27,866 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:11:27,866 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:27,866 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:11:27,866 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:11:27,866 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:27,867 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:27,891 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:11:27,891 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 00:11:27,892 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3321/3530 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2974 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:11:27,893 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:27,893 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:11:28,032 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:11:28,032 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 166 [2022-12-06 00:11:28,032 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:11:28,032 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:11:28,032 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:11:28,032 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:11:28,032 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1010 [2022-12-06 00:11:28,032 INFO L420 AbstractCegarLoop]: === Iteration 1012 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:11:28,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:11:28,033 INFO L85 PathProgramCache]: Analyzing trace with hash 1276067785, now seen corresponding path program 1 times [2022-12-06 00:11:28,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:11:28,033 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977387823] [2022-12-06 00:11:28,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:11:28,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:11:28,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:11:28,094 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-06 00:11:28,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:11:28,094 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977387823] [2022-12-06 00:11:28,094 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [977387823] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:11:28,094 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:11:28,094 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:11:28,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019608502] [2022-12-06 00:11:28,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:11:28,094 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:11:28,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:11:28,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:11:28,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:11:28,095 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:11:28,095 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:11:28,095 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:11:28,095 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:11:28,095 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:11:28,364 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:11:28,364 INFO L131 PetriNetUnfolder]: For 27229/27274 co-relation queries the response was YES. [2022-12-06 00:11:28,370 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27229/27274 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13573 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:11:28,376 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:11:28,377 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:11:28,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:11:28,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:11:28,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:11:28,377 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:11:28,377 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:11:28,377 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:11:28,435 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:11:28,436 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:28,437 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:11:28,437 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:11:28,437 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:11:28,437 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:28,437 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:11:28,437 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:11:28,437 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:28,438 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:28,462 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:11:28,462 INFO L131 PetriNetUnfolder]: For 3310/3519 co-relation queries the response was YES. [2022-12-06 00:11:28,463 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3310/3519 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2983 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:11:28,465 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:28,465 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:11:28,622 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:11:28,623 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 186 [2022-12-06 00:11:28,623 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:11:28,623 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:11:28,623 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:11:28,623 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:11:28,623 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1011 [2022-12-06 00:11:28,623 INFO L420 AbstractCegarLoop]: === Iteration 1013 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:11:28,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:11:28,623 INFO L85 PathProgramCache]: Analyzing trace with hash -1276089176, now seen corresponding path program 1 times [2022-12-06 00:11:28,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:11:28,623 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151892570] [2022-12-06 00:11:28,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:11:28,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:11:28,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:11:28,684 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-06 00:11:28,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:11:28,684 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151892570] [2022-12-06 00:11:28,684 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1151892570] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:11:28,684 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:11:28,684 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:11:28,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045164582] [2022-12-06 00:11:28,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:11:28,684 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:11:28,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:11:28,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:11:28,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:11:28,685 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:11:28,685 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:11:28,685 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:11:28,685 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:11:28,685 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:11:28,961 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:11:28,961 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 00:11:28,967 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13561 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:11:28,974 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:11:28,974 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:11:28,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:11:28,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:11:28,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:11:28,974 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:11:28,974 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:11:28,974 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:11:29,009 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:11:29,010 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:29,010 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:11:29,010 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:11:29,010 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:11:29,010 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:29,011 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:11:29,011 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:11:29,011 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:29,011 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:29,035 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:11:29,035 INFO L131 PetriNetUnfolder]: For 3349/3561 co-relation queries the response was YES. [2022-12-06 00:11:29,036 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3349/3561 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2982 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:11:29,038 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:29,038 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:11:29,180 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:11:29,181 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 171 [2022-12-06 00:11:29,181 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:11:29,181 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:11:29,181 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:11:29,181 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:11:29,181 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1012 [2022-12-06 00:11:29,181 INFO L420 AbstractCegarLoop]: === Iteration 1014 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:11:29,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:11:29,181 INFO L85 PathProgramCache]: Analyzing trace with hash 466721159, now seen corresponding path program 1 times [2022-12-06 00:11:29,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:11:29,182 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007746944] [2022-12-06 00:11:29,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:11:29,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:11:29,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:11:29,251 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-06 00:11:29,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:11:29,251 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007746944] [2022-12-06 00:11:29,251 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1007746944] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:11:29,251 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:11:29,251 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:11:29,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445742651] [2022-12-06 00:11:29,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:11:29,252 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:11:29,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:11:29,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:11:29,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:11:29,252 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:11:29,252 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:11:29,252 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:11:29,252 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:11:29,252 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:11:29,534 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:11:29,534 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:11:29,539 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13563 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:11:29,546 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:11:29,546 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:11:29,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:11:29,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:11:29,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:11:29,547 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:11:29,547 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:11:29,547 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:11:29,580 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:11:29,581 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:29,582 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:11:29,582 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:11:29,582 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:11:29,582 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:29,582 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:11:29,582 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:11:29,582 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:29,583 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:29,606 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:11:29,607 INFO L131 PetriNetUnfolder]: For 3304/3511 co-relation queries the response was YES. [2022-12-06 00:11:29,607 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3304/3511 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2986 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:11:29,609 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:29,609 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:11:29,770 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:11:29,770 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 188 [2022-12-06 00:11:29,770 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:11:29,770 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:11:29,770 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:11:29,770 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:11:29,770 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1013 [2022-12-06 00:11:29,771 INFO L420 AbstractCegarLoop]: === Iteration 1015 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:11:29,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:11:29,771 INFO L85 PathProgramCache]: Analyzing trace with hash -2085435802, now seen corresponding path program 1 times [2022-12-06 00:11:29,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:11:29,771 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745604374] [2022-12-06 00:11:29,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:11:29,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:11:29,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:11:29,832 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-06 00:11:29,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:11:29,832 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745604374] [2022-12-06 00:11:29,832 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1745604374] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:11:29,832 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:11:29,832 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:11:29,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905735055] [2022-12-06 00:11:29,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:11:29,833 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:11:29,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:11:29,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:11:29,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:11:29,833 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:11:29,833 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:11:29,833 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:11:29,833 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:11:29,833 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:11:30,122 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:11:30,122 INFO L131 PetriNetUnfolder]: For 27229/27274 co-relation queries the response was YES. [2022-12-06 00:11:30,129 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27229/27274 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13527 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:11:30,138 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:11:30,138 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:11:30,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:11:30,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:11:30,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:11:30,139 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:11:30,139 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:11:30,139 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:11:30,215 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:11:30,216 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:30,217 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:11:30,217 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:11:30,217 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:11:30,217 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:30,217 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:11:30,217 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:11:30,217 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:30,218 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:30,243 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:11:30,243 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 00:11:30,244 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3312/3520 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2995 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:11:30,246 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:30,246 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:11:30,391 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:11:30,391 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 174 [2022-12-06 00:11:30,391 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:11:30,391 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:11:30,392 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:11:30,392 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:11:30,392 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1014 [2022-12-06 00:11:30,392 INFO L420 AbstractCegarLoop]: === Iteration 1016 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:11:30,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:11:30,392 INFO L85 PathProgramCache]: Analyzing trace with hash -342625467, now seen corresponding path program 1 times [2022-12-06 00:11:30,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:11:30,392 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816162855] [2022-12-06 00:11:30,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:11:30,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:11:30,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:11:30,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-06 00:11:30,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:11:30,452 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816162855] [2022-12-06 00:11:30,452 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1816162855] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:11:30,452 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:11:30,452 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:11:30,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958354471] [2022-12-06 00:11:30,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:11:30,452 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:11:30,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:11:30,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:11:30,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:11:30,453 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:11:30,453 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:11:30,453 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:11:30,453 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:11:30,453 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:11:30,718 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:11:30,719 INFO L131 PetriNetUnfolder]: For 27146/27191 co-relation queries the response was YES. [2022-12-06 00:11:30,723 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27146/27191 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13533 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:11:30,730 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:11:30,730 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:11:30,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:11:30,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:11:30,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:11:30,731 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:11:30,731 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:11:30,731 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:11:30,765 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:11:30,766 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:30,766 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:11:30,766 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:11:30,766 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:11:30,766 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:30,767 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:11:30,767 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:11:30,767 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:30,767 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:30,791 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:11:30,791 INFO L131 PetriNetUnfolder]: For 3156/3296 co-relation queries the response was YES. [2022-12-06 00:11:30,792 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3156/3296 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 3007 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:11:30,794 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:30,794 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:11:30,967 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:11:30,968 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 202 [2022-12-06 00:11:30,968 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:11:30,968 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:11:30,968 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:11:30,968 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:11:30,968 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1015 [2022-12-06 00:11:30,968 INFO L420 AbstractCegarLoop]: === Iteration 1017 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:11:30,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:11:30,968 INFO L85 PathProgramCache]: Analyzing trace with hash 1400184868, now seen corresponding path program 1 times [2022-12-06 00:11:30,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:11:30,968 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340666409] [2022-12-06 00:11:30,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:11:30,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:11:30,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:11:31,035 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-06 00:11:31,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:11:31,035 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340666409] [2022-12-06 00:11:31,035 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [340666409] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:11:31,035 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:11:31,036 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:11:31,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706861483] [2022-12-06 00:11:31,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:11:31,036 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:11:31,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:11:31,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:11:31,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:11:31,036 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:11:31,036 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:11:31,036 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:11:31,036 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:11:31,036 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:11:31,318 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:11:31,318 INFO L131 PetriNetUnfolder]: For 26955/27000 co-relation queries the response was YES. [2022-12-06 00:11:31,324 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26955/27000 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13536 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:11:31,331 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:11:31,331 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:11:31,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:11:31,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:11:31,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:11:31,331 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:11:31,331 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:11:31,331 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:11:31,365 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:11:31,366 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:31,366 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:11:31,366 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:11:31,366 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:11:31,366 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:31,367 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:11:31,367 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:11:31,367 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:31,367 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:31,391 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:11:31,391 INFO L131 PetriNetUnfolder]: For 3140/3283 co-relation queries the response was YES. [2022-12-06 00:11:31,392 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3140/3283 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2979 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:11:31,393 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:31,393 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:11:31,540 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:11:31,540 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 174 [2022-12-06 00:11:31,540 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:11:31,540 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:11:31,540 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:11:31,540 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:11:31,540 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1016 [2022-12-06 00:11:31,540 INFO L420 AbstractCegarLoop]: === Iteration 1018 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:11:31,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:11:31,541 INFO L85 PathProgramCache]: Analyzing trace with hash -1151972093, now seen corresponding path program 1 times [2022-12-06 00:11:31,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:11:31,541 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757028152] [2022-12-06 00:11:31,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:11:31,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:11:31,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:11:31,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-06 00:11:31,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:11:31,610 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757028152] [2022-12-06 00:11:31,610 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [757028152] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:11:31,610 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:11:31,611 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:11:31,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706917080] [2022-12-06 00:11:31,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:11:31,611 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:11:31,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:11:31,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:11:31,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:11:31,611 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:11:31,611 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:11:31,611 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:11:31,611 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:11:31,611 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:11:31,893 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:11:31,893 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:11:31,899 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13566 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:11:31,934 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:11:31,934 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:11:31,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:11:31,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:11:31,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:11:31,935 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:11:31,935 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:11:31,935 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:11:31,972 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:11:31,974 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:31,974 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:11:31,974 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:11:31,974 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:11:31,974 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:31,974 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:11:31,974 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:11:31,974 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:31,975 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:32,000 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:11:32,001 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 00:11:32,002 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3312/3520 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2979 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:11:32,004 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:32,004 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:11:32,160 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:11:32,161 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 187 [2022-12-06 00:11:32,161 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:11:32,161 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:11:32,161 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:11:32,161 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:11:32,161 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1017 [2022-12-06 00:11:32,161 INFO L420 AbstractCegarLoop]: === Iteration 1019 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:11:32,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:11:32,161 INFO L85 PathProgramCache]: Analyzing trace with hash 590838242, now seen corresponding path program 1 times [2022-12-06 00:11:32,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:11:32,162 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730900692] [2022-12-06 00:11:32,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:11:32,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:11:32,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:11:32,241 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-06 00:11:32,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:11:32,242 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730900692] [2022-12-06 00:11:32,242 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [730900692] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:11:32,242 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:11:32,242 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:11:32,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538618693] [2022-12-06 00:11:32,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:11:32,242 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:11:32,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:11:32,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:11:32,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:11:32,243 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:11:32,243 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:11:32,243 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:11:32,243 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:11:32,243 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:11:32,558 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:11:32,558 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:11:32,564 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13567 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:11:32,573 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:11:32,573 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:11:32,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:11:32,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:11:32,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:11:32,574 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:11:32,574 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:11:32,574 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:11:32,612 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:11:32,614 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:32,614 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:11:32,614 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:11:32,614 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:11:32,614 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:32,614 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:11:32,614 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:11:32,614 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:32,615 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:32,641 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:11:32,641 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 00:11:32,642 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3321/3530 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2981 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:11:32,644 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:32,644 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:11:32,819 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:11:32,819 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 205 [2022-12-06 00:11:32,819 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:11:32,820 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:11:32,820 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:11:32,820 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:11:32,820 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1018 [2022-12-06 00:11:32,820 INFO L420 AbstractCegarLoop]: === Iteration 1020 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:11:32,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:11:32,820 INFO L85 PathProgramCache]: Analyzing trace with hash -1961318719, now seen corresponding path program 1 times [2022-12-06 00:11:32,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:11:32,820 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516601953] [2022-12-06 00:11:32,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:11:32,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:11:32,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:11:32,880 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-06 00:11:32,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:11:32,880 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516601953] [2022-12-06 00:11:32,881 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [516601953] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:11:32,881 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:11:32,881 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:11:32,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647475762] [2022-12-06 00:11:32,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:11:32,881 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:11:32,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:11:32,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:11:32,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:11:32,881 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:11:32,881 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:11:32,881 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:11:32,881 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:11:32,881 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:11:33,150 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:11:33,151 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:11:33,156 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13558 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:11:33,163 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:11:33,164 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:11:33,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:11:33,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:11:33,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:11:33,164 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:11:33,164 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:11:33,164 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:11:33,198 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:11:33,200 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:33,200 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:11:33,200 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:11:33,200 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:11:33,200 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:33,200 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:11:33,200 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:11:33,201 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:33,201 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:33,225 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:11:33,225 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 00:11:33,226 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3312/3520 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2971 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:11:33,228 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:33,228 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:11:33,371 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:11:33,371 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 171 [2022-12-06 00:11:33,371 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:11:33,371 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:11:33,371 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:11:33,371 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:11:33,371 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1019 [2022-12-06 00:11:33,372 INFO L420 AbstractCegarLoop]: === Iteration 1021 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:11:33,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:11:33,372 INFO L85 PathProgramCache]: Analyzing trace with hash -218508384, now seen corresponding path program 1 times [2022-12-06 00:11:33,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:11:33,372 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288916451] [2022-12-06 00:11:33,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:11:33,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:11:33,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:11:33,431 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-06 00:11:33,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:11:33,431 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288916451] [2022-12-06 00:11:33,431 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [288916451] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:11:33,431 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:11:33,431 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:11:33,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534072662] [2022-12-06 00:11:33,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:11:33,432 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:11:33,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:11:33,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:11:33,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:11:33,432 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:11:33,432 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:11:33,432 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:11:33,432 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:11:33,432 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:11:33,711 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:11:33,711 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:11:33,717 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13575 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:11:33,724 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:11:33,724 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:11:33,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:11:33,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:11:33,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:11:33,725 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:11:33,725 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:11:33,725 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:11:33,787 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:11:33,788 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:33,788 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:11:33,788 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:11:33,788 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:11:33,789 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:33,789 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:11:33,789 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:11:33,789 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:33,790 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:33,815 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:11:33,815 INFO L131 PetriNetUnfolder]: For 3348/3558 co-relation queries the response was YES. [2022-12-06 00:11:33,816 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3348/3558 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2983 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:11:33,818 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:33,818 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:11:33,963 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:11:33,963 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 175 [2022-12-06 00:11:33,963 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:11:33,963 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:11:33,963 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:11:33,963 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:11:33,964 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1020 [2022-12-06 00:11:33,964 INFO L420 AbstractCegarLoop]: === Iteration 1022 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:11:33,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:11:33,964 INFO L85 PathProgramCache]: Analyzing trace with hash 1524301951, now seen corresponding path program 1 times [2022-12-06 00:11:33,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:11:33,964 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845643066] [2022-12-06 00:11:33,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:11:33,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:11:33,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:11:34,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-06 00:11:34,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:11:34,021 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845643066] [2022-12-06 00:11:34,021 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [845643066] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:11:34,021 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:11:34,021 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:11:34,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015452431] [2022-12-06 00:11:34,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:11:34,022 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:11:34,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:11:34,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:11:34,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:11:34,022 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:11:34,022 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:11:34,022 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:11:34,022 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:11:34,022 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:11:34,287 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:11:34,287 INFO L131 PetriNetUnfolder]: For 27229/27274 co-relation queries the response was YES. [2022-12-06 00:11:34,292 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27229/27274 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13554 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:11:34,299 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:11:34,299 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:11:34,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:11:34,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:11:34,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:11:34,300 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:11:34,300 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:11:34,300 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:11:34,334 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:11:34,335 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:34,335 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:11:34,335 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:11:34,335 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:11:34,335 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:34,336 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:11:34,336 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:11:34,336 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:34,336 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:34,360 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:11:34,360 INFO L131 PetriNetUnfolder]: For 3293/3500 co-relation queries the response was YES. [2022-12-06 00:11:34,360 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3293/3500 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2994 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:11:34,362 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:34,362 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:11:34,509 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:11:34,509 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 174 [2022-12-06 00:11:34,509 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:11:34,509 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:11:34,509 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:11:34,509 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:11:34,509 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1021 [2022-12-06 00:11:34,510 INFO L420 AbstractCegarLoop]: === Iteration 1023 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:11:34,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:11:34,510 INFO L85 PathProgramCache]: Analyzing trace with hash -1027855010, now seen corresponding path program 1 times [2022-12-06 00:11:34,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:11:34,510 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726220703] [2022-12-06 00:11:34,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:11:34,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:11:34,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:11:34,580 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-06 00:11:34,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:11:34,581 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726220703] [2022-12-06 00:11:34,581 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1726220703] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:11:34,581 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:11:34,581 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:11:34,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474384516] [2022-12-06 00:11:34,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:11:34,581 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:11:34,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:11:34,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:11:34,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:11:34,582 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:11:34,582 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:11:34,582 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:11:34,582 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:11:34,582 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:11:34,871 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:11:34,871 INFO L131 PetriNetUnfolder]: For 26955/27000 co-relation queries the response was YES. [2022-12-06 00:11:34,877 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26955/27000 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13534 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:11:34,885 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:11:34,885 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:11:34,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:11:34,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:11:34,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:11:34,886 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:11:34,886 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:11:34,886 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:11:34,926 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:11:34,927 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:34,927 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:11:34,927 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:11:34,927 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:11:34,927 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:34,928 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:11:34,928 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:11:34,928 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:34,928 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:34,955 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:11:34,955 INFO L131 PetriNetUnfolder]: For 3123/3264 co-relation queries the response was YES. [2022-12-06 00:11:34,956 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3123/3264 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2974 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:11:34,958 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:34,958 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:11:35,104 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:11:35,105 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 178 [2022-12-06 00:11:35,105 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:11:35,105 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:11:35,105 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:11:35,105 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:11:35,105 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1022 [2022-12-06 00:11:35,105 INFO L420 AbstractCegarLoop]: === Iteration 1024 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:11:35,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:11:35,106 INFO L85 PathProgramCache]: Analyzing trace with hash 714955325, now seen corresponding path program 1 times [2022-12-06 00:11:35,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:11:35,106 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117496633] [2022-12-06 00:11:35,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:11:35,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:11:35,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:11:35,197 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-06 00:11:35,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:11:35,197 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117496633] [2022-12-06 00:11:35,197 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2117496633] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:11:35,197 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:11:35,197 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:11:35,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411478206] [2022-12-06 00:11:35,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:11:35,197 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:11:35,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:11:35,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:11:35,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:11:35,198 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:11:35,198 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:11:35,198 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:11:35,198 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:11:35,198 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:11:35,477 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:11:35,477 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 00:11:35,482 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13548 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:11:35,489 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:11:35,489 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:11:35,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:11:35,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:11:35,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:11:35,490 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:11:35,490 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:11:35,490 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:11:35,547 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:11:35,549 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:35,549 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:11:35,549 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:11:35,549 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:11:35,549 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:35,549 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:11:35,549 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:11:35,549 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:35,550 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:35,575 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:11:35,575 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 00:11:35,576 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3321/3530 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2995 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:11:35,578 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:35,578 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:11:35,731 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:11:35,732 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 183 [2022-12-06 00:11:35,732 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:11:35,732 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:11:35,732 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:11:35,732 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:11:35,732 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1023 [2022-12-06 00:11:35,732 INFO L420 AbstractCegarLoop]: === Iteration 1025 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:11:35,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:11:35,732 INFO L85 PathProgramCache]: Analyzing trace with hash -1837201636, now seen corresponding path program 1 times [2022-12-06 00:11:35,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:11:35,732 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936513487] [2022-12-06 00:11:35,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:11:35,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:11:35,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:11:35,804 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-06 00:11:35,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:11:35,805 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936513487] [2022-12-06 00:11:35,805 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1936513487] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:11:35,805 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:11:35,805 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:11:35,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835551085] [2022-12-06 00:11:35,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:11:35,805 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:11:35,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:11:35,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:11:35,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:11:35,806 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:11:35,806 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:11:35,806 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:11:35,806 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:11:35,806 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:11:36,092 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:11:36,093 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:11:36,098 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13560 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:11:36,107 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:11:36,108 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:11:36,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:11:36,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:11:36,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:11:36,112 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:11:36,112 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:11:36,112 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:11:36,154 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:11:36,156 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:36,156 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:11:36,156 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:11:36,156 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:11:36,156 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:36,157 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:11:36,157 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:11:36,157 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:36,157 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:36,189 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:11:36,190 INFO L131 PetriNetUnfolder]: For 3338/3547 co-relation queries the response was YES. [2022-12-06 00:11:36,191 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3338/3547 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2988 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:11:36,193 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:36,193 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:11:36,343 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:11:36,343 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 187 [2022-12-06 00:11:36,343 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:11:36,343 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:11:36,343 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:11:36,343 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:11:36,343 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1024 [2022-12-06 00:11:36,343 INFO L420 AbstractCegarLoop]: === Iteration 1026 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:11:36,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:11:36,344 INFO L85 PathProgramCache]: Analyzing trace with hash -94391301, now seen corresponding path program 1 times [2022-12-06 00:11:36,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:11:36,344 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577204573] [2022-12-06 00:11:36,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:11:36,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:11:36,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:11:36,404 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-06 00:11:36,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:11:36,404 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577204573] [2022-12-06 00:11:36,404 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [577204573] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:11:36,404 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:11:36,404 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:11:36,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773227043] [2022-12-06 00:11:36,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:11:36,405 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:11:36,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:11:36,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:11:36,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:11:36,405 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:11:36,405 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:11:36,405 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:11:36,405 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:11:36,405 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:11:36,667 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:11:36,667 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:11:36,672 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13555 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:11:36,679 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:11:36,680 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:11:36,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:11:36,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:11:36,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:11:36,680 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:11:36,680 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:11:36,680 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:11:36,713 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:11:36,714 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:36,714 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:11:36,714 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:11:36,714 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:11:36,714 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:36,715 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:11:36,715 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:11:36,715 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:36,715 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:36,739 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:11:36,739 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 00:11:36,740 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3312/3520 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2972 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:11:36,742 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:36,742 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:11:36,897 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:11:36,897 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 183 [2022-12-06 00:11:36,897 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:11:36,897 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:11:36,897 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:11:36,897 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:11:36,898 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1025 [2022-12-06 00:11:36,898 INFO L420 AbstractCegarLoop]: === Iteration 1027 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:11:36,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:11:36,898 INFO L85 PathProgramCache]: Analyzing trace with hash 1648419034, now seen corresponding path program 1 times [2022-12-06 00:11:36,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:11:36,898 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358535037] [2022-12-06 00:11:36,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:11:36,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:11:36,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:11:36,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-06 00:11:36,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:11:36,956 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358535037] [2022-12-06 00:11:36,956 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1358535037] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:11:36,956 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:11:36,956 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:11:36,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224409549] [2022-12-06 00:11:36,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:11:36,956 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:11:36,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:11:36,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:11:36,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:11:36,956 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:11:36,956 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:11:36,956 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:11:36,956 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:11:36,957 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:11:37,230 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:11:37,230 INFO L131 PetriNetUnfolder]: For 27146/27191 co-relation queries the response was YES. [2022-12-06 00:11:37,235 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27146/27191 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13524 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:11:37,271 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:11:37,272 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:11:37,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:11:37,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:11:37,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:11:37,272 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:11:37,272 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:11:37,272 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:11:37,302 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:11:37,303 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:37,303 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:11:37,303 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:11:37,303 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:11:37,303 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:37,304 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:11:37,304 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:11:37,304 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:37,304 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:37,328 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:11:37,328 INFO L131 PetriNetUnfolder]: For 3167/3307 co-relation queries the response was YES. [2022-12-06 00:11:37,329 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3167/3307 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 3009 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:11:37,331 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:37,331 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:11:37,476 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:11:37,476 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 173 [2022-12-06 00:11:37,476 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:11:37,476 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:11:37,476 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:11:37,476 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:11:37,476 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1026 [2022-12-06 00:11:37,476 INFO L420 AbstractCegarLoop]: === Iteration 1028 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:11:37,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:11:37,477 INFO L85 PathProgramCache]: Analyzing trace with hash -903737927, now seen corresponding path program 1 times [2022-12-06 00:11:37,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:11:37,477 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479850549] [2022-12-06 00:11:37,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:11:37,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:11:37,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:11:37,538 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-06 00:11:37,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:11:37,538 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479850549] [2022-12-06 00:11:37,538 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1479850549] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:11:37,538 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:11:37,538 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:11:37,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617999439] [2022-12-06 00:11:37,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:11:37,538 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:11:37,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:11:37,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:11:37,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:11:37,539 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:11:37,539 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:11:37,539 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:11:37,539 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:11:37,539 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:11:37,796 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:11:37,796 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:11:37,802 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13576 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:11:37,809 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:11:37,809 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:11:37,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:11:37,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:11:37,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:11:37,809 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:11:37,809 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:11:37,809 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:11:37,842 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:11:37,843 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:37,843 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:11:37,843 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:11:37,843 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:11:37,843 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:37,843 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:11:37,843 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:11:37,843 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:37,844 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:37,867 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:11:37,867 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 00:11:37,868 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3321/3530 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2987 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:11:37,870 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:37,870 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:11:38,022 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:11:38,023 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 180 [2022-12-06 00:11:38,023 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:11:38,023 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:11:38,023 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:11:38,023 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:11:38,023 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1027 [2022-12-06 00:11:38,023 INFO L420 AbstractCegarLoop]: === Iteration 1029 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:11:38,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:11:38,023 INFO L85 PathProgramCache]: Analyzing trace with hash 839072408, now seen corresponding path program 1 times [2022-12-06 00:11:38,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:11:38,023 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853990226] [2022-12-06 00:11:38,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:11:38,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:11:38,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:11:38,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-06 00:11:38,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:11:38,079 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853990226] [2022-12-06 00:11:38,079 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1853990226] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:11:38,079 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:11:38,079 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:11:38,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122410342] [2022-12-06 00:11:38,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:11:38,079 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:11:38,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:11:38,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:11:38,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:11:38,080 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:11:38,080 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:11:38,080 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:11:38,080 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:11:38,080 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:11:38,356 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:11:38,357 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:11:38,362 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13561 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:11:38,370 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:11:38,370 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:11:38,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:11:38,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:11:38,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:11:38,371 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:11:38,371 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:11:38,371 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:11:38,406 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:11:38,407 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:38,407 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:11:38,407 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:11:38,407 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:11:38,408 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:38,408 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:11:38,408 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:11:38,408 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:38,409 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:38,432 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:11:38,432 INFO L131 PetriNetUnfolder]: For 3338/3550 co-relation queries the response was YES. [2022-12-06 00:11:38,433 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3338/3550 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2988 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:11:38,435 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:38,435 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:11:38,580 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:11:38,580 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 173 [2022-12-06 00:11:38,580 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:11:38,580 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:11:38,580 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:11:38,580 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:11:38,581 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1028 [2022-12-06 00:11:38,581 INFO L420 AbstractCegarLoop]: === Iteration 1030 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:11:38,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:11:38,581 INFO L85 PathProgramCache]: Analyzing trace with hash -1713084553, now seen corresponding path program 1 times [2022-12-06 00:11:38,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:11:38,581 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572175727] [2022-12-06 00:11:38,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:11:38,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:11:38,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:11:38,640 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-06 00:11:38,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:11:38,640 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572175727] [2022-12-06 00:11:38,640 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [572175727] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:11:38,640 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:11:38,640 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:11:38,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412381506] [2022-12-06 00:11:38,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:11:38,641 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:11:38,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:11:38,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:11:38,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:11:38,641 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:11:38,641 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:11:38,641 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:11:38,641 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:11:38,641 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:11:38,905 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:11:38,905 INFO L131 PetriNetUnfolder]: For 26955/27000 co-relation queries the response was YES. [2022-12-06 00:11:38,910 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26955/27000 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13519 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:11:38,916 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:11:38,917 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:11:38,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:11:38,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:11:38,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:11:38,917 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:11:38,917 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:11:38,917 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:11:38,980 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:11:38,981 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:38,981 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:11:38,981 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:11:38,981 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:11:38,981 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:38,982 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:11:38,982 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:11:38,982 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:38,982 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:39,006 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:11:39,007 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 00:11:39,007 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3133/3273 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2975 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:11:39,009 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:39,009 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:11:39,148 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:11:39,148 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 167 [2022-12-06 00:11:39,148 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:11:39,148 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:11:39,148 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:11:39,148 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:11:39,148 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1029 [2022-12-06 00:11:39,148 INFO L420 AbstractCegarLoop]: === Iteration 1031 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:11:39,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:11:39,149 INFO L85 PathProgramCache]: Analyzing trace with hash 29725782, now seen corresponding path program 1 times [2022-12-06 00:11:39,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:11:39,149 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239220651] [2022-12-06 00:11:39,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:11:39,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:11:39,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:11:39,218 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-06 00:11:39,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:11:39,218 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239220651] [2022-12-06 00:11:39,218 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [239220651] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:11:39,218 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:11:39,218 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:11:39,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99696104] [2022-12-06 00:11:39,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:11:39,218 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:11:39,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:11:39,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:11:39,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:11:39,219 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:11:39,219 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:11:39,219 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:11:39,219 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:11:39,219 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:11:39,485 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:11:39,485 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:11:39,490 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13565 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:11:39,496 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:11:39,497 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:11:39,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:11:39,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:11:39,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:11:39,497 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:11:39,497 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:11:39,497 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:11:39,529 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:11:39,530 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:39,530 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:11:39,530 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:11:39,530 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:11:39,531 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:39,531 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:11:39,531 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:11:39,531 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:39,532 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:39,555 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:11:39,555 INFO L131 PetriNetUnfolder]: For 3307/3517 co-relation queries the response was YES. [2022-12-06 00:11:39,556 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3307/3517 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2979 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:11:39,558 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:39,558 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:11:39,710 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:11:39,711 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 181 [2022-12-06 00:11:39,711 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:11:39,711 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:11:39,711 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:11:39,711 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:11:39,711 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1030 [2022-12-06 00:11:39,711 INFO L420 AbstractCegarLoop]: === Iteration 1032 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:11:39,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:11:39,711 INFO L85 PathProgramCache]: Analyzing trace with hash 1772536117, now seen corresponding path program 1 times [2022-12-06 00:11:39,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:11:39,711 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023359081] [2022-12-06 00:11:39,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:11:39,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:11:39,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:11:39,779 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-06 00:11:39,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:11:39,779 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023359081] [2022-12-06 00:11:39,779 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1023359081] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:11:39,779 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:11:39,779 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:11:39,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750256563] [2022-12-06 00:11:39,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:11:39,780 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:11:39,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:11:39,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:11:39,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:11:39,780 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:11:39,780 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:11:39,780 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:11:39,780 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:11:39,780 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:11:40,045 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:11:40,045 INFO L131 PetriNetUnfolder]: For 27136/27181 co-relation queries the response was YES. [2022-12-06 00:11:40,051 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27136/27181 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13553 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:11:40,058 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:11:40,058 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:11:40,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:11:40,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:11:40,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:11:40,058 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:11:40,058 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:11:40,058 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:11:40,092 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:11:40,094 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:40,094 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:11:40,094 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:11:40,094 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:11:40,094 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:40,094 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:11:40,094 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:11:40,094 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:40,095 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:40,118 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:11:40,119 INFO L131 PetriNetUnfolder]: For 3157/3298 co-relation queries the response was YES. [2022-12-06 00:11:40,119 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3157/3298 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2985 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:11:40,121 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:40,121 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:11:40,267 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:11:40,267 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 173 [2022-12-06 00:11:40,267 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:11:40,267 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:11:40,267 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:11:40,267 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:11:40,267 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1031 [2022-12-06 00:11:40,267 INFO L420 AbstractCegarLoop]: === Iteration 1033 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:11:40,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:11:40,268 INFO L85 PathProgramCache]: Analyzing trace with hash -779620844, now seen corresponding path program 1 times [2022-12-06 00:11:40,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:11:40,268 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633366424] [2022-12-06 00:11:40,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:11:40,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:11:40,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:11:40,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-06 00:11:40,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:11:40,340 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633366424] [2022-12-06 00:11:40,340 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1633366424] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:11:40,340 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:11:40,340 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:11:40,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012294292] [2022-12-06 00:11:40,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:11:40,341 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:11:40,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:11:40,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:11:40,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:11:40,341 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:11:40,341 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:11:40,341 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:11:40,341 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:11:40,341 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:11:40,636 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:11:40,636 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:11:40,640 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13565 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:11:40,646 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:11:40,646 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:11:40,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:11:40,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:11:40,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:11:40,647 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:11:40,647 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:11:40,647 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:11:40,674 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:11:40,676 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:40,676 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:11:40,676 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:11:40,676 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:11:40,676 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:40,676 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:11:40,676 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:11:40,676 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:40,677 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:40,701 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:11:40,701 INFO L131 PetriNetUnfolder]: For 3327/3536 co-relation queries the response was YES. [2022-12-06 00:11:40,702 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3327/3536 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2971 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:11:40,704 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:40,704 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:11:40,848 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:11:40,848 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 172 [2022-12-06 00:11:40,848 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:11:40,848 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:11:40,848 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:11:40,848 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:11:40,848 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1032 [2022-12-06 00:11:40,848 INFO L420 AbstractCegarLoop]: === Iteration 1034 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:11:40,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:11:40,849 INFO L85 PathProgramCache]: Analyzing trace with hash 963189491, now seen corresponding path program 1 times [2022-12-06 00:11:40,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:11:40,849 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398444201] [2022-12-06 00:11:40,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:11:40,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:11:40,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:11:40,915 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-06 00:11:40,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:11:40,915 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398444201] [2022-12-06 00:11:40,915 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [398444201] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:11:40,915 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:11:40,915 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:11:40,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089271643] [2022-12-06 00:11:40,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:11:40,915 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:11:40,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:11:40,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:11:40,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:11:40,916 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:11:40,916 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:11:40,916 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:11:40,916 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:11:40,916 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:11:41,188 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:11:41,188 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 00:11:41,194 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13560 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:11:41,201 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:11:41,201 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:11:41,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:11:41,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:11:41,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:11:41,201 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:11:41,201 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:11:41,201 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:11:41,232 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:11:41,233 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:41,233 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:11:41,234 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:11:41,234 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:11:41,234 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:41,234 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:11:41,234 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:11:41,234 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:41,235 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:41,258 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:11:41,259 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 00:11:41,259 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3312/3520 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2984 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:11:41,261 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:41,261 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:11:41,428 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:11:41,428 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 194 [2022-12-06 00:11:41,428 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:11:41,428 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:11:41,428 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:11:41,429 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:11:41,429 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1033 [2022-12-06 00:11:41,429 INFO L420 AbstractCegarLoop]: === Iteration 1035 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:11:41,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:11:41,429 INFO L85 PathProgramCache]: Analyzing trace with hash -1588967470, now seen corresponding path program 1 times [2022-12-06 00:11:41,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:11:41,429 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070740899] [2022-12-06 00:11:41,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:11:41,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:11:41,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:11:41,500 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-06 00:11:41,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:11:41,500 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070740899] [2022-12-06 00:11:41,500 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2070740899] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:11:41,500 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:11:41,500 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:11:41,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600236753] [2022-12-06 00:11:41,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:11:41,500 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:11:41,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:11:41,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:11:41,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:11:41,501 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:11:41,501 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:11:41,501 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:11:41,501 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:11:41,501 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:11:41,777 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:11:41,778 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:11:41,783 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13572 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:11:41,790 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:11:41,790 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:11:41,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:11:41,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:11:41,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:11:41,790 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:11:41,790 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:11:41,791 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:11:41,822 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:11:41,824 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:41,824 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:11:41,824 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:11:41,824 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:11:41,824 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:41,824 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:11:41,824 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:11:41,824 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:41,825 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:41,848 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:11:41,849 INFO L131 PetriNetUnfolder]: For 3310/3519 co-relation queries the response was YES. [2022-12-06 00:11:41,849 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3310/3519 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2962 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:11:41,851 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:41,851 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:11:42,005 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:11:42,005 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 181 [2022-12-06 00:11:42,005 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:11:42,005 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:11:42,005 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:11:42,005 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:11:42,005 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1034 [2022-12-06 00:11:42,005 INFO L420 AbstractCegarLoop]: === Iteration 1036 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:11:42,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:11:42,006 INFO L85 PathProgramCache]: Analyzing trace with hash 153842865, now seen corresponding path program 1 times [2022-12-06 00:11:42,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:11:42,006 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227956648] [2022-12-06 00:11:42,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:11:42,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:11:42,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:11:42,066 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-06 00:11:42,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:11:42,066 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227956648] [2022-12-06 00:11:42,066 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [227956648] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:11:42,066 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:11:42,066 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:11:42,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947931999] [2022-12-06 00:11:42,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:11:42,067 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:11:42,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:11:42,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:11:42,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:11:42,067 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:11:42,067 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:11:42,067 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:11:42,067 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:11:42,067 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:11:42,356 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:11:42,356 INFO L131 PetriNetUnfolder]: For 27136/27181 co-relation queries the response was YES. [2022-12-06 00:11:42,360 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27136/27181 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13553 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:11:42,366 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:11:42,366 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:11:42,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:11:42,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:11:42,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:11:42,367 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:11:42,367 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:11:42,367 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:11:42,394 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:11:42,395 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:42,396 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:11:42,396 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:11:42,396 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:11:42,396 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:42,396 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:11:42,396 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:11:42,396 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:42,397 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:42,421 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:11:42,421 INFO L131 PetriNetUnfolder]: For 3168/3309 co-relation queries the response was YES. [2022-12-06 00:11:42,421 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3168/3309 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 3004 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:11:42,423 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:42,423 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:11:42,559 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:11:42,560 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 164 [2022-12-06 00:11:42,560 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:11:42,560 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:11:42,560 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:11:42,560 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:11:42,560 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1035 [2022-12-06 00:11:42,560 INFO L420 AbstractCegarLoop]: === Iteration 1037 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:11:42,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:11:42,560 INFO L85 PathProgramCache]: Analyzing trace with hash 1896653200, now seen corresponding path program 1 times [2022-12-06 00:11:42,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:11:42,560 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868509029] [2022-12-06 00:11:42,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:11:42,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:11:42,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:11:42,621 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-06 00:11:42,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:11:42,621 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868509029] [2022-12-06 00:11:42,621 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [868509029] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:11:42,622 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:11:42,622 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:11:42,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704319424] [2022-12-06 00:11:42,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:11:42,622 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:11:42,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:11:42,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:11:42,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:11:42,622 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:11:42,622 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:11:42,622 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:11:42,622 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:11:42,622 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:11:42,887 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:11:42,887 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 00:11:42,892 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26965/27010 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13536 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:11:42,898 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:11:42,898 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:11:42,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:11:42,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:11:42,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:11:42,899 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:11:42,899 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:11:42,899 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:11:42,934 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:11:42,935 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:42,935 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:11:42,935 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:11:42,935 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:11:42,935 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:42,935 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:11:42,936 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:11:42,936 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:42,936 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:42,962 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:11:42,963 INFO L131 PetriNetUnfolder]: For 3146/3287 co-relation queries the response was YES. [2022-12-06 00:11:42,964 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3146/3287 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2975 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:11:42,965 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:42,965 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:11:43,107 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:11:43,108 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 173 [2022-12-06 00:11:43,108 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:11:43,108 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:11:43,108 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:11:43,108 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:11:43,108 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1036 [2022-12-06 00:11:43,108 INFO L420 AbstractCegarLoop]: === Iteration 1038 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:11:43,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:11:43,108 INFO L85 PathProgramCache]: Analyzing trace with hash -655503761, now seen corresponding path program 1 times [2022-12-06 00:11:43,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:11:43,109 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545508573] [2022-12-06 00:11:43,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:11:43,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:11:43,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:11:43,176 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-06 00:11:43,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:11:43,176 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545508573] [2022-12-06 00:11:43,176 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [545508573] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:11:43,176 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:11:43,176 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:11:43,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870806767] [2022-12-06 00:11:43,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:11:43,177 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:11:43,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:11:43,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:11:43,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:11:43,177 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:11:43,177 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:11:43,177 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:11:43,177 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:11:43,177 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:11:43,456 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:11:43,456 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:11:43,461 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13566 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:11:43,468 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:11:43,468 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:11:43,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:11:43,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:11:43,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:11:43,469 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:11:43,469 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:11:43,469 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:11:43,503 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:11:43,504 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:43,504 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:11:43,504 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:11:43,504 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:11:43,504 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:43,505 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:11:43,505 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:11:43,505 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:43,505 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:43,528 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:11:43,529 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 00:11:43,529 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3312/3520 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2984 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:11:43,531 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:43,531 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:11:43,680 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:11:43,680 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 176 [2022-12-06 00:11:43,680 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:11:43,680 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:11:43,680 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:11:43,680 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:11:43,680 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1037 [2022-12-06 00:11:43,680 INFO L420 AbstractCegarLoop]: === Iteration 1039 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:11:43,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:11:43,681 INFO L85 PathProgramCache]: Analyzing trace with hash 1087306574, now seen corresponding path program 1 times [2022-12-06 00:11:43,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:11:43,681 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171045433] [2022-12-06 00:11:43,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:11:43,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:11:43,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:11:43,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-06 00:11:43,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:11:43,750 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171045433] [2022-12-06 00:11:43,750 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1171045433] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:11:43,750 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:11:43,751 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:11:43,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615693590] [2022-12-06 00:11:43,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:11:43,751 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:11:43,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:11:43,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:11:43,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:11:43,751 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:11:43,751 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:11:43,751 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:11:43,751 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:11:43,751 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:11:44,043 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:11:44,043 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 00:11:44,047 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26965/27010 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13532 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:11:44,052 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:11:44,052 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:11:44,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:11:44,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:11:44,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:11:44,053 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:11:44,053 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:11:44,053 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:11:44,083 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:11:44,084 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:44,084 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:11:44,084 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:11:44,084 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:11:44,084 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:44,085 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:11:44,085 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:11:44,085 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:44,085 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:44,109 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:11:44,109 INFO L131 PetriNetUnfolder]: For 3134/3275 co-relation queries the response was YES. [2022-12-06 00:11:44,110 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3134/3275 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2977 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:11:44,112 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:44,112 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:11:44,253 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:11:44,254 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 170 [2022-12-06 00:11:44,254 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:11:44,254 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:11:44,254 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:11:44,254 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:11:44,254 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1038 [2022-12-06 00:11:44,254 INFO L420 AbstractCegarLoop]: === Iteration 1040 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:11:44,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:11:44,254 INFO L85 PathProgramCache]: Analyzing trace with hash -1464850387, now seen corresponding path program 1 times [2022-12-06 00:11:44,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:11:44,254 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539101635] [2022-12-06 00:11:44,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:11:44,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:11:44,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:11:44,310 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-06 00:11:44,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:11:44,310 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539101635] [2022-12-06 00:11:44,310 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1539101635] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:11:44,310 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:11:44,311 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:11:44,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107695894] [2022-12-06 00:11:44,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:11:44,311 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:11:44,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:11:44,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:11:44,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:11:44,311 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:11:44,311 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:11:44,311 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:11:44,311 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:11:44,311 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:11:44,577 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:11:44,577 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:11:44,582 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13545 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:11:44,590 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:11:44,590 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:11:44,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:11:44,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:11:44,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:11:44,591 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:11:44,591 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:11:44,591 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:11:44,623 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:11:44,624 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:44,624 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:11:44,624 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:11:44,624 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:11:44,624 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:44,625 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:11:44,625 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:11:44,625 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:44,625 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:44,649 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:11:44,649 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 00:11:44,649 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3312/3520 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2980 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:11:44,651 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:44,651 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:11:44,795 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:11:44,796 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 172 [2022-12-06 00:11:44,796 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:11:44,796 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:11:44,796 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:11:44,796 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:11:44,796 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1039 [2022-12-06 00:11:44,796 INFO L420 AbstractCegarLoop]: === Iteration 1041 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:11:44,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:11:44,796 INFO L85 PathProgramCache]: Analyzing trace with hash 277959948, now seen corresponding path program 1 times [2022-12-06 00:11:44,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:11:44,796 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216893175] [2022-12-06 00:11:44,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:11:44,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:11:44,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:11:44,864 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-06 00:11:44,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:11:44,864 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216893175] [2022-12-06 00:11:44,865 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [216893175] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:11:44,865 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:11:44,865 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:11:44,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214028009] [2022-12-06 00:11:44,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:11:44,865 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:11:44,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:11:44,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:11:44,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:11:44,865 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:11:44,865 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:11:44,865 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:11:44,865 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:11:44,865 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:11:45,141 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:11:45,142 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:11:45,146 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13573 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:11:45,153 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:11:45,153 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:11:45,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:11:45,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:11:45,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:11:45,153 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:11:45,153 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:11:45,154 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:11:45,183 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:11:45,184 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:45,184 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:11:45,184 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:11:45,185 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:11:45,185 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:45,185 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:11:45,185 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:11:45,185 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:45,186 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:45,209 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:11:45,209 INFO L131 PetriNetUnfolder]: For 3338/3547 co-relation queries the response was YES. [2022-12-06 00:11:45,210 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3338/3547 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2958 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:11:45,212 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:45,212 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:11:45,346 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:11:45,347 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 162 [2022-12-06 00:11:45,347 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:11:45,347 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:11:45,347 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:11:45,347 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:11:45,347 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1040 [2022-12-06 00:11:45,347 INFO L420 AbstractCegarLoop]: === Iteration 1042 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:11:45,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:11:45,347 INFO L85 PathProgramCache]: Analyzing trace with hash 2020770283, now seen corresponding path program 1 times [2022-12-06 00:11:45,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:11:45,347 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011949220] [2022-12-06 00:11:45,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:11:45,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:11:45,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:11:45,415 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-06 00:11:45,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:11:45,415 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011949220] [2022-12-06 00:11:45,415 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2011949220] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:11:45,415 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:11:45,415 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:11:45,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870434330] [2022-12-06 00:11:45,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:11:45,416 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:11:45,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:11:45,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:11:45,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:11:45,416 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:11:45,416 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:11:45,416 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:11:45,416 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:11:45,416 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:11:45,715 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:11:45,716 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 00:11:45,720 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26965/27010 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13525 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:11:45,725 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:11:45,725 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:11:45,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:11:45,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:11:45,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:11:45,726 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:11:45,726 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:11:45,726 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:11:45,755 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:11:45,756 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:45,756 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:11:45,756 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:11:45,756 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:11:45,756 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:45,756 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:11:45,756 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:11:45,756 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:45,757 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:45,780 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:11:45,780 INFO L131 PetriNetUnfolder]: For 3122/3262 co-relation queries the response was YES. [2022-12-06 00:11:45,781 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3122/3262 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2991 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:11:45,783 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:45,783 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:11:45,937 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:11:45,937 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 181 [2022-12-06 00:11:45,937 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:11:45,937 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:11:45,937 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:11:45,937 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:11:45,937 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1041 [2022-12-06 00:11:45,937 INFO L420 AbstractCegarLoop]: === Iteration 1043 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:11:45,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:11:45,938 INFO L85 PathProgramCache]: Analyzing trace with hash -531386678, now seen corresponding path program 1 times [2022-12-06 00:11:45,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:11:45,938 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325301200] [2022-12-06 00:11:45,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:11:45,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:11:45,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:11:46,008 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-06 00:11:46,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:11:46,008 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325301200] [2022-12-06 00:11:46,008 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [325301200] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:11:46,008 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:11:46,008 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:11:46,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139746097] [2022-12-06 00:11:46,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:11:46,009 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:11:46,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:11:46,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:11:46,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:11:46,009 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:11:46,009 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:11:46,009 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:11:46,009 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:11:46,009 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:11:46,274 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:11:46,275 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 00:11:46,280 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13562 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:11:46,286 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:11:46,286 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:11:46,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:11:46,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:11:46,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:11:46,287 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:11:46,287 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:11:46,287 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:11:46,321 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:11:46,322 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:46,323 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:11:46,323 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:11:46,323 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:11:46,323 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:46,323 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:11:46,323 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:11:46,323 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:46,324 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:46,347 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:11:46,348 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 00:11:46,348 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3321/3530 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2975 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:11:46,350 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:46,350 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:11:46,504 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:11:46,504 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 181 [2022-12-06 00:11:46,504 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:11:46,504 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:11:46,504 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:11:46,504 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:11:46,504 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1042 [2022-12-06 00:11:46,505 INFO L420 AbstractCegarLoop]: === Iteration 1044 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:11:46,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:11:46,505 INFO L85 PathProgramCache]: Analyzing trace with hash 1211423657, now seen corresponding path program 1 times [2022-12-06 00:11:46,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:11:46,505 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377653698] [2022-12-06 00:11:46,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:11:46,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:11:46,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:11:46,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-06 00:11:46,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:11:46,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377653698] [2022-12-06 00:11:46,561 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1377653698] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:11:46,561 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:11:46,561 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:11:46,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421351623] [2022-12-06 00:11:46,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:11:46,562 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:11:46,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:11:46,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:11:46,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:11:46,562 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:11:46,562 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:11:46,562 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:11:46,562 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:11:46,562 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:11:46,829 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:11:46,829 INFO L131 PetriNetUnfolder]: For 27229/27274 co-relation queries the response was YES. [2022-12-06 00:11:46,834 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27229/27274 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13566 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:11:46,841 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:11:46,841 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:11:46,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:11:46,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:11:46,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:11:46,842 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:11:46,842 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:11:46,842 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:11:46,874 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:11:46,875 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:46,875 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:11:46,875 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:11:46,875 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:11:46,875 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:46,876 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:11:46,876 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:11:46,876 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:46,876 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:46,900 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:11:46,900 INFO L131 PetriNetUnfolder]: For 3301/3509 co-relation queries the response was YES. [2022-12-06 00:11:46,900 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3301/3509 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2990 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:11:46,902 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:46,902 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:11:47,055 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:11:47,055 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 180 [2022-12-06 00:11:47,055 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:11:47,055 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:11:47,055 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:11:47,055 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:11:47,055 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1043 [2022-12-06 00:11:47,055 INFO L420 AbstractCegarLoop]: === Iteration 1045 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:11:47,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:11:47,056 INFO L85 PathProgramCache]: Analyzing trace with hash -1340733304, now seen corresponding path program 1 times [2022-12-06 00:11:47,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:11:47,056 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235166765] [2022-12-06 00:11:47,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:11:47,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:11:47,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:11:47,123 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-06 00:11:47,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:11:47,123 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235166765] [2022-12-06 00:11:47,124 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1235166765] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:11:47,124 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:11:47,124 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:11:47,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329070674] [2022-12-06 00:11:47,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:11:47,124 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:11:47,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:11:47,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:11:47,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:11:47,124 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:11:47,124 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:11:47,124 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:11:47,124 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:11:47,124 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:11:47,414 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:11:47,414 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 00:11:47,418 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13556 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:11:47,424 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:11:47,424 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:11:47,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:11:47,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:11:47,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:11:47,424 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:11:47,424 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:11:47,425 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:11:47,454 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:11:47,455 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:47,455 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:11:47,455 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:11:47,455 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:11:47,455 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:47,456 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:11:47,456 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:11:47,456 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:47,456 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:47,480 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:11:47,480 INFO L131 PetriNetUnfolder]: For 3338/3547 co-relation queries the response was YES. [2022-12-06 00:11:47,480 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3338/3547 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2974 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:11:47,482 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:47,482 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:11:47,632 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:11:47,632 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 177 [2022-12-06 00:11:47,632 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:11:47,633 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:11:47,633 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:11:47,633 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:11:47,633 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1044 [2022-12-06 00:11:47,633 INFO L420 AbstractCegarLoop]: === Iteration 1046 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:11:47,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:11:47,633 INFO L85 PathProgramCache]: Analyzing trace with hash 402077031, now seen corresponding path program 1 times [2022-12-06 00:11:47,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:11:47,633 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435356148] [2022-12-06 00:11:47,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:11:47,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:11:47,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:11:47,700 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-06 00:11:47,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:11:47,700 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435356148] [2022-12-06 00:11:47,700 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1435356148] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:11:47,700 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:11:47,701 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:11:47,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277135393] [2022-12-06 00:11:47,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:11:47,701 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:11:47,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:11:47,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:11:47,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:11:47,701 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:11:47,701 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:11:47,701 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:11:47,701 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:11:47,701 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:11:47,969 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:11:47,969 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 00:11:47,975 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26965/27010 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13520 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:11:47,981 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:11:47,981 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:11:47,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:11:47,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:11:47,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:11:47,982 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:11:47,982 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:11:47,982 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:11:48,016 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:11:48,017 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:48,017 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:11:48,017 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:11:48,017 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:11:48,017 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:48,017 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:11:48,017 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:11:48,017 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:48,018 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:48,042 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:11:48,042 INFO L131 PetriNetUnfolder]: For 3122/3262 co-relation queries the response was YES. [2022-12-06 00:11:48,043 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3122/3262 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2980 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:11:48,044 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:48,044 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:11:48,195 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:11:48,195 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 178 [2022-12-06 00:11:48,195 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:11:48,195 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:11:48,195 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:11:48,195 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:11:48,195 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1045 [2022-12-06 00:11:48,195 INFO L420 AbstractCegarLoop]: === Iteration 1047 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:11:48,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:11:48,195 INFO L85 PathProgramCache]: Analyzing trace with hash 2144887366, now seen corresponding path program 1 times [2022-12-06 00:11:48,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:11:48,196 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787974207] [2022-12-06 00:11:48,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:11:48,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:11:48,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:11:48,263 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-06 00:11:48,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:11:48,263 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787974207] [2022-12-06 00:11:48,263 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1787974207] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:11:48,263 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:11:48,263 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:11:48,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362187153] [2022-12-06 00:11:48,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:11:48,264 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:11:48,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:11:48,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:11:48,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:11:48,264 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:11:48,264 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:11:48,264 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:11:48,264 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:11:48,264 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:11:48,532 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:11:48,532 INFO L131 PetriNetUnfolder]: For 26955/27000 co-relation queries the response was YES. [2022-12-06 00:11:48,539 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26955/27000 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13534 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:11:48,547 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:11:48,547 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:11:48,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:11:48,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:11:48,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:11:48,548 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:11:48,548 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:11:48,548 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:11:48,582 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:11:48,583 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:48,583 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:11:48,583 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:11:48,583 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:11:48,583 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:48,584 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:11:48,584 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:11:48,584 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:48,584 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:48,608 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:11:48,608 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 00:11:48,609 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3133/3273 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2974 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:11:48,611 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:48,611 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:11:48,758 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:11:48,759 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 176 [2022-12-06 00:11:48,759 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:11:48,759 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:11:48,759 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:11:48,759 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:11:48,759 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1046 [2022-12-06 00:11:48,759 INFO L420 AbstractCegarLoop]: === Iteration 1048 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:11:48,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:11:48,759 INFO L85 PathProgramCache]: Analyzing trace with hash -407269595, now seen corresponding path program 1 times [2022-12-06 00:11:48,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:11:48,759 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106439921] [2022-12-06 00:11:48,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:11:48,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:11:48,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:11:48,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-06 00:11:48,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:11:48,820 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106439921] [2022-12-06 00:11:48,820 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1106439921] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:11:48,820 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:11:48,820 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:11:48,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950485822] [2022-12-06 00:11:48,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:11:48,820 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:11:48,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:11:48,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:11:48,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:11:48,821 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:11:48,821 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:11:48,821 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:11:48,821 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:11:48,821 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:11:49,112 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:11:49,112 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:11:49,116 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13558 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:11:49,121 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:11:49,121 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:11:49,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:11:49,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:11:49,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:11:49,122 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:11:49,122 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:11:49,122 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:11:49,150 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:11:49,151 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:49,151 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:11:49,151 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:11:49,151 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:11:49,151 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:49,152 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:11:49,152 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:11:49,152 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:49,152 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:49,176 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:11:49,176 INFO L131 PetriNetUnfolder]: For 3308/3518 co-relation queries the response was YES. [2022-12-06 00:11:49,177 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3308/3518 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2991 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:11:49,179 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:49,179 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:11:49,328 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:11:49,328 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 177 [2022-12-06 00:11:49,328 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:11:49,328 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:11:49,328 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:11:49,328 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:11:49,328 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1047 [2022-12-06 00:11:49,328 INFO L420 AbstractCegarLoop]: === Iteration 1049 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:11:49,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:11:49,329 INFO L85 PathProgramCache]: Analyzing trace with hash 1335540740, now seen corresponding path program 1 times [2022-12-06 00:11:49,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:11:49,329 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978057088] [2022-12-06 00:11:49,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:11:49,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:11:49,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:11:49,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-06 00:11:49,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:11:49,384 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978057088] [2022-12-06 00:11:49,384 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1978057088] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:11:49,384 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:11:49,384 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:11:49,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648624663] [2022-12-06 00:11:49,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:11:49,384 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:11:49,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:11:49,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:11:49,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:11:49,384 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:11:49,385 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:11:49,385 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:11:49,385 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:11:49,385 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:11:49,652 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:11:49,652 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 00:11:49,657 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26969/27014 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13504 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:11:49,664 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:11:49,664 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:11:49,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:11:49,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:11:49,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:11:49,665 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:11:49,665 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:11:49,665 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:11:49,699 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:11:49,700 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:49,700 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:11:49,701 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:11:49,701 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:11:49,701 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:49,701 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:11:49,701 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:11:49,701 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:49,702 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:49,725 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:11:49,725 INFO L131 PetriNetUnfolder]: For 3135/3276 co-relation queries the response was YES. [2022-12-06 00:11:49,726 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3135/3276 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2964 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:11:49,728 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:49,728 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:11:49,881 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:11:49,881 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 180 [2022-12-06 00:11:49,881 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:11:49,881 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:11:49,881 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:11:49,881 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:11:49,881 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1048 [2022-12-06 00:11:49,882 INFO L420 AbstractCegarLoop]: === Iteration 1050 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:11:49,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:11:49,882 INFO L85 PathProgramCache]: Analyzing trace with hash -1216616221, now seen corresponding path program 1 times [2022-12-06 00:11:49,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:11:49,882 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350006534] [2022-12-06 00:11:49,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:11:49,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:11:49,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:11:49,949 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-06 00:11:49,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:11:49,950 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350006534] [2022-12-06 00:11:49,950 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1350006534] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:11:49,950 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:11:49,950 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:11:49,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185632855] [2022-12-06 00:11:49,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:11:49,950 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:11:49,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:11:49,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:11:49,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:11:49,950 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:11:49,950 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:11:49,950 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:11:49,950 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:11:49,951 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:11:50,219 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:11:50,219 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 00:11:50,224 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13536 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:11:50,231 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:11:50,231 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:11:50,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:11:50,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:11:50,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:11:50,232 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:11:50,232 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:11:50,232 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:11:50,265 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:11:50,266 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:50,266 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:11:50,266 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:11:50,266 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:11:50,266 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:50,267 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:11:50,267 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:11:50,267 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:50,267 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:50,291 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:11:50,291 INFO L131 PetriNetUnfolder]: For 3304/3511 co-relation queries the response was YES. [2022-12-06 00:11:50,292 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3304/3511 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2978 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:11:50,294 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:50,294 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:11:50,433 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:11:50,434 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 168 [2022-12-06 00:11:50,434 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:11:50,434 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:11:50,434 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:11:50,434 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:11:50,434 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1049 [2022-12-06 00:11:50,434 INFO L420 AbstractCegarLoop]: === Iteration 1051 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:11:50,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:11:50,434 INFO L85 PathProgramCache]: Analyzing trace with hash 526194114, now seen corresponding path program 1 times [2022-12-06 00:11:50,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:11:50,434 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742847880] [2022-12-06 00:11:50,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:11:50,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:11:50,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:11:50,494 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-06 00:11:50,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:11:50,494 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742847880] [2022-12-06 00:11:50,494 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1742847880] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:11:50,494 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:11:50,494 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:11:50,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418147068] [2022-12-06 00:11:50,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:11:50,494 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:11:50,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:11:50,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:11:50,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:11:50,495 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:11:50,495 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:11:50,495 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:11:50,495 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:11:50,495 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:11:50,781 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:11:50,781 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 00:11:50,785 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26965/27010 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13527 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:11:50,792 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:11:50,792 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:11:50,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:11:50,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:11:50,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:11:50,792 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:11:50,792 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:11:50,792 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:11:50,822 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:11:50,823 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:50,824 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:11:50,824 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:11:50,824 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:11:50,824 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:50,824 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:11:50,824 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:11:50,824 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:50,825 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:50,848 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:11:50,848 INFO L131 PetriNetUnfolder]: For 3122/3262 co-relation queries the response was YES. [2022-12-06 00:11:50,849 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3122/3262 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2956 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:11:50,851 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:50,851 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:11:51,023 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:11:51,023 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 199 [2022-12-06 00:11:51,023 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:11:51,023 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:11:51,023 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:11:51,023 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:11:51,023 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1050 [2022-12-06 00:11:51,023 INFO L420 AbstractCegarLoop]: === Iteration 1052 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:11:51,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:11:51,024 INFO L85 PathProgramCache]: Analyzing trace with hash -2025962847, now seen corresponding path program 1 times [2022-12-06 00:11:51,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:11:51,024 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068894497] [2022-12-06 00:11:51,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:11:51,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:11:51,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:11:51,101 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-06 00:11:51,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:11:51,101 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068894497] [2022-12-06 00:11:51,101 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2068894497] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:11:51,101 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:11:51,101 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:11:51,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9311176] [2022-12-06 00:11:51,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:11:51,102 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:11:51,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:11:51,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:11:51,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:11:51,102 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:11:51,102 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:11:51,102 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:11:51,102 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:11:51,102 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:11:51,378 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:11:51,379 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:11:51,384 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13577 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:11:51,391 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:11:51,391 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:11:51,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:11:51,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:11:51,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:11:51,392 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:11:51,392 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:11:51,392 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:11:51,426 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:11:51,427 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:51,427 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:11:51,427 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:11:51,427 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:11:51,427 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:51,428 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:11:51,428 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:11:51,428 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:51,428 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:51,452 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:11:51,452 INFO L131 PetriNetUnfolder]: For 3301/3509 co-relation queries the response was YES. [2022-12-06 00:11:51,453 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3301/3509 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2989 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:11:51,455 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:51,455 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:11:51,598 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:11:51,598 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 171 [2022-12-06 00:11:51,598 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:11:51,598 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:11:51,598 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:11:51,598 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:11:51,598 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1051 [2022-12-06 00:11:51,599 INFO L420 AbstractCegarLoop]: === Iteration 1053 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:11:51,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:11:51,599 INFO L85 PathProgramCache]: Analyzing trace with hash -283152512, now seen corresponding path program 1 times [2022-12-06 00:11:51,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:11:51,599 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311667272] [2022-12-06 00:11:51,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:11:51,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:11:51,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:11:51,659 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-06 00:11:51,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:11:51,659 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311667272] [2022-12-06 00:11:51,659 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1311667272] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:11:51,659 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:11:51,659 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:11:51,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313351591] [2022-12-06 00:11:51,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:11:51,660 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:11:51,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:11:51,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:11:51,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:11:51,660 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:11:51,660 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:11:51,660 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:11:51,660 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:11:51,660 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:11:51,931 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:11:51,931 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 00:11:51,936 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13552 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:11:51,944 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:11:51,944 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:11:51,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:11:51,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:11:51,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:11:51,945 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:11:51,945 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:11:51,945 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:11:51,978 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:11:51,979 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:51,980 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:11:51,980 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:11:51,980 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:11:51,980 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:51,980 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:11:51,980 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:11:51,980 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:51,981 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:52,005 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:11:52,005 INFO L131 PetriNetUnfolder]: For 3327/3536 co-relation queries the response was YES. [2022-12-06 00:11:52,006 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3327/3536 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2988 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:11:52,008 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:52,009 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:11:52,160 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:11:52,161 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 181 [2022-12-06 00:11:52,161 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:11:52,161 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:11:52,161 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:11:52,161 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:11:52,161 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1052 [2022-12-06 00:11:52,161 INFO L420 AbstractCegarLoop]: === Iteration 1054 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:11:52,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:11:52,161 INFO L85 PathProgramCache]: Analyzing trace with hash 1459657823, now seen corresponding path program 1 times [2022-12-06 00:11:52,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:11:52,161 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484085725] [2022-12-06 00:11:52,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:11:52,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:11:52,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:11:52,220 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-06 00:11:52,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:11:52,220 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484085725] [2022-12-06 00:11:52,220 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484085725] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:11:52,220 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:11:52,220 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:11:52,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327048814] [2022-12-06 00:11:52,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:11:52,221 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:11:52,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:11:52,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:11:52,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:11:52,221 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:11:52,221 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:11:52,221 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:11:52,221 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:11:52,221 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:11:52,516 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:11:52,516 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 00:11:52,520 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26969/27014 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13549 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:11:52,526 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:11:52,526 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:11:52,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:11:52,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:11:52,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:11:52,526 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:11:52,527 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:11:52,527 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:11:52,557 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:11:52,558 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:52,559 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:11:52,559 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:11:52,559 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:11:52,559 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:52,559 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:11:52,559 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:11:52,559 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:52,560 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:52,583 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:11:52,584 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 00:11:52,584 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3133/3273 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2977 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:11:52,586 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:52,586 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:11:52,735 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:11:52,735 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 176 [2022-12-06 00:11:52,735 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:11:52,735 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:11:52,735 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:11:52,735 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:11:52,736 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1053 [2022-12-06 00:11:52,736 INFO L420 AbstractCegarLoop]: === Iteration 1055 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:11:52,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:11:52,736 INFO L85 PathProgramCache]: Analyzing trace with hash -1092499138, now seen corresponding path program 1 times [2022-12-06 00:11:52,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:11:52,736 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282049949] [2022-12-06 00:11:52,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:11:52,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:11:52,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:11:52,795 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-06 00:11:52,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:11:52,795 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282049949] [2022-12-06 00:11:52,795 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [282049949] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:11:52,795 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:11:52,795 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:11:52,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713294111] [2022-12-06 00:11:52,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:11:52,795 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:11:52,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:11:52,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:11:52,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:11:52,796 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:11:52,796 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:11:52,796 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:11:52,796 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:11:52,796 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:11:53,081 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:11:53,082 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:11:53,087 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13554 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:11:53,095 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:11:53,095 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:11:53,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:11:53,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:11:53,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:11:53,096 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:11:53,096 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:11:53,096 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:11:53,131 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:11:53,132 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:53,132 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:11:53,132 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:11:53,132 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:11:53,132 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:53,132 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:11:53,132 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:11:53,133 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:53,133 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:53,157 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:11:53,157 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 00:11:53,158 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3321/3530 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2994 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:11:53,160 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:53,160 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:11:53,296 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:11:53,297 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 165 [2022-12-06 00:11:53,297 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:11:53,297 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:11:53,297 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:11:53,297 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:11:53,297 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1054 [2022-12-06 00:11:53,297 INFO L420 AbstractCegarLoop]: === Iteration 1056 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:11:53,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:11:53,297 INFO L85 PathProgramCache]: Analyzing trace with hash 650311197, now seen corresponding path program 1 times [2022-12-06 00:11:53,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:11:53,297 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351672004] [2022-12-06 00:11:53,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:11:53,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:11:53,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:11:53,365 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-06 00:11:53,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:11:53,365 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351672004] [2022-12-06 00:11:53,365 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1351672004] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:11:53,365 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:11:53,365 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:11:53,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429297954] [2022-12-06 00:11:53,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:11:53,365 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:11:53,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:11:53,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:11:53,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:11:53,366 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:11:53,366 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:11:53,366 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:11:53,366 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:11:53,366 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:11:53,632 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:11:53,632 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:11:53,637 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13563 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:11:53,644 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:11:53,644 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:11:53,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:11:53,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:11:53,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:11:53,644 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:11:53,644 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:11:53,644 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:11:53,680 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:11:53,681 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:53,681 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:11:53,681 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:11:53,681 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:11:53,681 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:53,682 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:11:53,682 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:11:53,682 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:53,682 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:53,706 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:11:53,706 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 00:11:53,707 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3312/3520 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2979 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:11:53,709 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:53,709 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:11:53,852 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:11:53,852 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 171 [2022-12-06 00:11:53,852 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:11:53,852 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:11:53,852 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:11:53,853 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:11:53,853 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1055 [2022-12-06 00:11:53,853 INFO L420 AbstractCegarLoop]: === Iteration 1057 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:11:53,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:11:53,853 INFO L85 PathProgramCache]: Analyzing trace with hash -1901845764, now seen corresponding path program 1 times [2022-12-06 00:11:53,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:11:53,853 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236694288] [2022-12-06 00:11:53,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:11:53,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:11:53,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:11:53,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-06 00:11:53,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:11:53,912 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236694288] [2022-12-06 00:11:53,912 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [236694288] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:11:53,912 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:11:53,912 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:11:53,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933218917] [2022-12-06 00:11:53,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:11:53,912 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:11:53,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:11:53,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:11:53,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:11:53,913 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:11:53,913 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:11:53,913 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:11:53,913 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:11:53,913 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:11:54,196 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:11:54,197 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:11:54,201 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13547 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:11:54,206 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:11:54,207 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:11:54,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:11:54,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:11:54,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:11:54,207 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:11:54,207 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:11:54,207 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:11:54,236 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:11:54,237 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:54,237 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:11:54,237 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:11:54,237 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:11:54,237 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:54,238 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:11:54,238 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:11:54,238 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:54,238 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:54,262 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:11:54,262 INFO L131 PetriNetUnfolder]: For 3338/3547 co-relation queries the response was YES. [2022-12-06 00:11:54,263 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3338/3547 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2987 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:11:54,265 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:54,265 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:11:54,421 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:11:54,422 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 185 [2022-12-06 00:11:54,422 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:11:54,422 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:11:54,422 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:11:54,422 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:11:54,422 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1056 [2022-12-06 00:11:54,422 INFO L420 AbstractCegarLoop]: === Iteration 1058 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:11:54,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:11:54,422 INFO L85 PathProgramCache]: Analyzing trace with hash -159035429, now seen corresponding path program 1 times [2022-12-06 00:11:54,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:11:54,423 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295148272] [2022-12-06 00:11:54,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:11:54,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:11:54,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:11:54,489 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-06 00:11:54,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:11:54,489 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295148272] [2022-12-06 00:11:54,489 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1295148272] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:11:54,489 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:11:54,489 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:11:54,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536780321] [2022-12-06 00:11:54,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:11:54,489 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:11:54,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:11:54,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:11:54,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:11:54,490 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:11:54,490 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:11:54,490 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:11:54,490 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:11:54,490 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:11:54,757 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:11:54,757 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:11:54,762 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13557 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:11:54,769 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:11:54,769 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:11:54,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:11:54,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:11:54,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:11:54,769 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:11:54,769 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:11:54,769 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:11:54,802 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:11:54,803 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:54,804 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:11:54,804 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:11:54,804 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:11:54,804 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:54,804 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:11:54,804 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:11:54,804 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:54,805 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:54,828 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:11:54,828 INFO L131 PetriNetUnfolder]: For 3304/3511 co-relation queries the response was YES. [2022-12-06 00:11:54,829 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3304/3511 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2992 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:11:54,831 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:54,831 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:11:54,979 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:11:54,979 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 175 [2022-12-06 00:11:54,979 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:11:54,979 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:11:54,979 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:11:54,979 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:11:54,979 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1057 [2022-12-06 00:11:54,979 INFO L420 AbstractCegarLoop]: === Iteration 1059 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:11:54,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:11:54,980 INFO L85 PathProgramCache]: Analyzing trace with hash 1583774906, now seen corresponding path program 1 times [2022-12-06 00:11:54,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:11:54,980 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736392799] [2022-12-06 00:11:54,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:11:54,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:11:54,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:11:55,039 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-06 00:11:55,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:11:55,039 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736392799] [2022-12-06 00:11:55,039 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [736392799] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:11:55,039 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:11:55,039 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:11:55,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563817486] [2022-12-06 00:11:55,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:11:55,040 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:11:55,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:11:55,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:11:55,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:11:55,040 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:11:55,040 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:11:55,040 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:11:55,040 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:11:55,040 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:11:55,322 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:11:55,322 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 00:11:55,328 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26969/27014 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13522 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:11:55,335 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:11:55,335 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:11:55,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:11:55,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:11:55,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:11:55,336 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:11:55,336 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:11:55,336 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:11:55,369 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:11:55,371 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:55,371 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:11:55,371 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:11:55,371 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:11:55,371 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:55,371 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:11:55,371 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:11:55,371 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:55,372 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:55,395 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:11:55,396 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 00:11:55,396 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3133/3273 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2977 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:11:55,398 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:55,398 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:11:55,544 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:11:55,544 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 173 [2022-12-06 00:11:55,544 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:11:55,545 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:11:55,545 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:11:55,545 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:11:55,545 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1058 [2022-12-06 00:11:55,545 INFO L420 AbstractCegarLoop]: === Iteration 1060 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:11:55,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:11:55,545 INFO L85 PathProgramCache]: Analyzing trace with hash -968382055, now seen corresponding path program 1 times [2022-12-06 00:11:55,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:11:55,545 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423838520] [2022-12-06 00:11:55,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:11:55,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:11:55,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:11:55,613 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-06 00:11:55,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:11:55,614 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423838520] [2022-12-06 00:11:55,614 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1423838520] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:11:55,614 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:11:55,614 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:11:55,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268725047] [2022-12-06 00:11:55,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:11:55,614 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:11:55,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:11:55,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:11:55,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:11:55,614 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:11:55,615 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:11:55,615 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:11:55,615 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:11:55,615 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:11:55,910 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:11:55,910 INFO L131 PetriNetUnfolder]: For 27229/27274 co-relation queries the response was YES. [2022-12-06 00:11:55,915 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27229/27274 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13572 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:11:55,920 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:11:55,920 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:11:55,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:11:55,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:11:55,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:11:55,921 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:11:55,921 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:11:55,921 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:11:55,951 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:11:55,952 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:55,952 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:11:55,952 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:11:55,952 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:11:55,952 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:55,952 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:11:55,953 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:11:55,953 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:55,953 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:55,976 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:11:55,977 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 00:11:55,977 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3312/3520 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2998 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:11:55,979 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:55,979 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:11:56,135 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:11:56,135 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 183 [2022-12-06 00:11:56,135 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:11:56,135 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:11:56,135 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:11:56,135 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:11:56,135 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1059 [2022-12-06 00:11:56,135 INFO L420 AbstractCegarLoop]: === Iteration 1061 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:11:56,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:11:56,136 INFO L85 PathProgramCache]: Analyzing trace with hash 774428280, now seen corresponding path program 1 times [2022-12-06 00:11:56,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:11:56,136 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946143919] [2022-12-06 00:11:56,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:11:56,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:11:56,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:11:56,196 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-06 00:11:56,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:11:56,196 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946143919] [2022-12-06 00:11:56,196 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [946143919] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:11:56,196 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:11:56,196 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:11:56,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701256376] [2022-12-06 00:11:56,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:11:56,196 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:11:56,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:11:56,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:11:56,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:11:56,197 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:11:56,197 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:11:56,197 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:11:56,197 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:11:56,197 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:11:56,462 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:11:56,463 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:11:56,468 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13567 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:11:56,475 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:11:56,475 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:11:56,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:11:56,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:11:56,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:11:56,476 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:11:56,476 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:11:56,476 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:11:56,507 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:11:56,508 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:56,508 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:11:56,509 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:11:56,509 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:11:56,509 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:56,509 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:11:56,509 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:11:56,509 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:56,510 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:56,533 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:11:56,533 INFO L131 PetriNetUnfolder]: For 3337/3547 co-relation queries the response was YES. [2022-12-06 00:11:56,534 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3337/3547 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2987 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:11:56,536 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:56,536 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:11:56,706 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:11:56,706 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 197 [2022-12-06 00:11:56,706 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:11:56,707 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:11:56,707 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:11:56,707 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:11:56,707 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1060 [2022-12-06 00:11:56,707 INFO L420 AbstractCegarLoop]: === Iteration 1062 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:11:56,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:11:56,707 INFO L85 PathProgramCache]: Analyzing trace with hash -1777728681, now seen corresponding path program 1 times [2022-12-06 00:11:56,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:11:56,707 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398291157] [2022-12-06 00:11:56,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:11:56,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:11:56,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:11:56,775 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-06 00:11:56,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:11:56,775 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398291157] [2022-12-06 00:11:56,775 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [398291157] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:11:56,775 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:11:56,775 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:11:56,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942822558] [2022-12-06 00:11:56,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:11:56,776 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:11:56,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:11:56,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:11:56,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:11:56,776 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:11:56,776 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:11:56,776 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:11:56,776 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:11:56,776 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:11:57,043 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:11:57,043 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:11:57,048 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13566 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:11:57,055 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:11:57,055 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:11:57,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:11:57,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:11:57,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:11:57,056 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:11:57,056 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:11:57,056 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:11:57,093 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:11:57,095 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:57,095 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:11:57,095 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:11:57,095 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:11:57,095 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:57,095 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:11:57,095 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:11:57,095 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:57,096 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:57,121 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:11:57,121 INFO L131 PetriNetUnfolder]: For 3304/3511 co-relation queries the response was YES. [2022-12-06 00:11:57,122 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3304/3511 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2980 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:11:57,124 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:57,124 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:11:57,273 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:11:57,273 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 178 [2022-12-06 00:11:57,273 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:11:57,273 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:11:57,273 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:11:57,273 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:11:57,274 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1061 [2022-12-06 00:11:57,274 INFO L420 AbstractCegarLoop]: === Iteration 1063 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:11:57,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:11:57,274 INFO L85 PathProgramCache]: Analyzing trace with hash -34918346, now seen corresponding path program 1 times [2022-12-06 00:11:57,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:11:57,274 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905350143] [2022-12-06 00:11:57,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:11:57,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:11:57,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:11:57,330 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-06 00:11:57,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:11:57,331 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905350143] [2022-12-06 00:11:57,331 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [905350143] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:11:57,331 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:11:57,331 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:11:57,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323776925] [2022-12-06 00:11:57,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:11:57,331 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:11:57,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:11:57,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:11:57,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:11:57,331 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:11:57,331 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:11:57,331 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:11:57,331 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:11:57,331 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:11:57,617 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:11:57,617 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:11:57,621 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13554 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:11:57,626 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:11:57,626 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:11:57,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:11:57,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:11:57,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:11:57,627 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:11:57,627 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:11:57,627 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:11:57,655 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:11:57,656 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:57,656 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:11:57,656 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:11:57,656 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:11:57,656 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:57,657 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:11:57,657 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:11:57,657 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:57,657 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:57,681 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:11:57,681 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 00:11:57,681 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3321/3530 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2994 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:11:57,683 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:57,683 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:11:57,838 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:11:57,838 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 182 [2022-12-06 00:11:57,838 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:11:57,838 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:11:57,838 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:11:57,839 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:11:57,839 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1062 [2022-12-06 00:11:57,839 INFO L420 AbstractCegarLoop]: === Iteration 1064 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:11:57,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:11:57,839 INFO L85 PathProgramCache]: Analyzing trace with hash 1707891989, now seen corresponding path program 1 times [2022-12-06 00:11:57,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:11:57,839 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825073004] [2022-12-06 00:11:57,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:11:57,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:11:57,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:11:57,898 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-06 00:11:57,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:11:57,898 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825073004] [2022-12-06 00:11:57,898 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [825073004] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:11:57,898 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:11:57,898 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:11:57,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072170901] [2022-12-06 00:11:57,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:11:57,898 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:11:57,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:11:57,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:11:57,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:11:57,899 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:11:57,899 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:11:57,899 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:11:57,899 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:11:57,899 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:11:58,165 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:11:58,165 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:11:58,170 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13576 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:11:58,177 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:11:58,177 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:11:58,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:11:58,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:11:58,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:11:58,178 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:11:58,178 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:11:58,178 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:11:58,210 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:11:58,211 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:58,211 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:11:58,212 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:11:58,212 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:11:58,212 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:58,212 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:11:58,212 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:11:58,212 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:58,213 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:58,236 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:11:58,236 INFO L131 PetriNetUnfolder]: For 3318/3528 co-relation queries the response was YES. [2022-12-06 00:11:58,237 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3318/3528 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2984 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:11:58,239 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:58,239 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:11:58,396 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:11:58,396 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 184 [2022-12-06 00:11:58,396 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:11:58,396 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:11:58,396 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:11:58,396 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:11:58,396 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1063 [2022-12-06 00:11:58,396 INFO L420 AbstractCegarLoop]: === Iteration 1065 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:11:58,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:11:58,397 INFO L85 PathProgramCache]: Analyzing trace with hash -844264972, now seen corresponding path program 1 times [2022-12-06 00:11:58,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:11:58,397 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252493332] [2022-12-06 00:11:58,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:11:58,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:11:58,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:11:58,459 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-06 00:11:58,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:11:58,459 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252493332] [2022-12-06 00:11:58,459 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1252493332] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:11:58,459 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:11:58,459 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:11:58,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595650498] [2022-12-06 00:11:58,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:11:58,459 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:11:58,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:11:58,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:11:58,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:11:58,460 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:11:58,460 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:11:58,460 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:11:58,460 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:11:58,460 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:11:58,722 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:11:58,722 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:11:58,727 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13553 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:11:58,734 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:11:58,734 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:11:58,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:11:58,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:11:58,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:11:58,735 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:11:58,735 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:11:58,735 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:11:58,767 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:11:58,768 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:58,768 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:11:58,769 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:11:58,769 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:11:58,769 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:58,769 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:11:58,769 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:11:58,769 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:58,770 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:58,795 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:11:58,795 INFO L131 PetriNetUnfolder]: For 3327/3536 co-relation queries the response was YES. [2022-12-06 00:11:58,796 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3327/3536 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2983 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:11:58,798 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:58,798 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:11:58,950 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:11:58,951 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 182 [2022-12-06 00:11:58,951 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:11:58,951 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:11:58,951 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:11:58,951 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:11:58,951 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1064 [2022-12-06 00:11:58,951 INFO L420 AbstractCegarLoop]: === Iteration 1066 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:11:58,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:11:58,951 INFO L85 PathProgramCache]: Analyzing trace with hash 898545363, now seen corresponding path program 1 times [2022-12-06 00:11:58,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:11:58,952 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601939329] [2022-12-06 00:11:58,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:11:58,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:11:58,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:11:59,017 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-06 00:11:59,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:11:59,017 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601939329] [2022-12-06 00:11:59,017 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1601939329] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:11:59,017 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:11:59,017 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:11:59,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184885839] [2022-12-06 00:11:59,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:11:59,018 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:11:59,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:11:59,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:11:59,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:11:59,018 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:11:59,018 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:11:59,018 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:11:59,018 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:11:59,018 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:11:59,307 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:11:59,307 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 00:11:59,312 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13556 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:11:59,317 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:11:59,317 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:11:59,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:11:59,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:11:59,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:11:59,318 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:11:59,318 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:11:59,318 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:11:59,346 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:11:59,347 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:59,347 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:11:59,348 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:11:59,348 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:11:59,348 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:59,348 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:11:59,348 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:11:59,348 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:59,349 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:59,373 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:11:59,373 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 00:11:59,374 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3312/3520 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2993 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:11:59,375 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:59,376 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:11:59,517 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:11:59,518 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 170 [2022-12-06 00:11:59,518 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:11:59,518 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:11:59,518 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:11:59,518 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:11:59,518 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1065 [2022-12-06 00:11:59,518 INFO L420 AbstractCegarLoop]: === Iteration 1067 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:11:59,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:11:59,518 INFO L85 PathProgramCache]: Analyzing trace with hash -1653611598, now seen corresponding path program 1 times [2022-12-06 00:11:59,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:11:59,518 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319157826] [2022-12-06 00:11:59,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:11:59,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:11:59,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:11:59,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-06 00:11:59,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:11:59,583 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319157826] [2022-12-06 00:11:59,583 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [319157826] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:11:59,583 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:11:59,584 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:11:59,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987095973] [2022-12-06 00:11:59,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:11:59,584 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:11:59,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:11:59,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:11:59,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:11:59,584 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:11:59,584 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:11:59,584 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:11:59,584 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:11:59,584 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:11:59,921 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:11:59,921 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:11:59,928 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13558 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:11:59,938 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:11:59,938 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:11:59,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:11:59,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:11:59,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:11:59,939 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:11:59,939 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:11:59,939 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:11:59,985 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:11:59,986 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:59,987 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:11:59,987 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:11:59,987 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:11:59,987 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:59,987 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:11:59,987 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:11:59,988 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:11:59,988 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:00,021 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:12:00,021 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 00:12:00,022 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3312/3520 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2984 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:12:00,025 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:00,025 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:12:00,249 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:12:00,249 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 262 [2022-12-06 00:12:00,249 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:12:00,249 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:12:00,249 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:12:00,250 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:12:00,250 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1066 [2022-12-06 00:12:00,250 INFO L420 AbstractCegarLoop]: === Iteration 1068 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:12:00,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:12:00,250 INFO L85 PathProgramCache]: Analyzing trace with hash 89198737, now seen corresponding path program 1 times [2022-12-06 00:12:00,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:12:00,250 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816913651] [2022-12-06 00:12:00,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:12:00,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:12:00,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:12:00,334 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-06 00:12:00,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:12:00,334 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816913651] [2022-12-06 00:12:00,334 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [816913651] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:12:00,334 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:12:00,334 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:12:00,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595616808] [2022-12-06 00:12:00,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:12:00,335 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:12:00,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:12:00,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:12:00,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:12:00,335 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:12:00,335 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:12:00,335 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:12:00,335 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:12:00,335 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:12:00,698 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:12:00,698 INFO L131 PetriNetUnfolder]: For 27229/27274 co-relation queries the response was YES. [2022-12-06 00:12:00,707 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27229/27274 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13549 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:12:00,717 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:12:00,718 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:12:00,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:12:00,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:12:00,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:12:00,718 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:12:00,718 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:12:00,719 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:12:00,771 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:12:00,772 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:00,772 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:12:00,772 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:12:00,772 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:12:00,772 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:00,773 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:12:00,773 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:12:00,773 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:00,774 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:00,806 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:12:00,806 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 00:12:00,808 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3312/3520 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2985 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:12:00,810 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:00,810 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:12:01,015 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:12:01,016 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 244 [2022-12-06 00:12:01,016 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:12:01,016 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:12:01,016 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:12:01,016 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:12:01,016 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1067 [2022-12-06 00:12:01,016 INFO L420 AbstractCegarLoop]: === Iteration 1069 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:12:01,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:12:01,017 INFO L85 PathProgramCache]: Analyzing trace with hash 1832009072, now seen corresponding path program 1 times [2022-12-06 00:12:01,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:12:01,017 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980150334] [2022-12-06 00:12:01,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:12:01,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:12:01,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:12:01,105 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-06 00:12:01,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:12:01,105 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980150334] [2022-12-06 00:12:01,105 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [980150334] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:12:01,106 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:12:01,106 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:12:01,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949702068] [2022-12-06 00:12:01,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:12:01,106 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:12:01,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:12:01,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:12:01,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:12:01,106 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:12:01,106 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:12:01,107 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:12:01,107 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:12:01,107 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:12:01,516 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:12:01,517 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:12:01,523 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13564 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:12:01,532 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:12:01,532 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:12:01,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:12:01,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:12:01,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:12:01,533 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:12:01,533 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:12:01,533 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:12:01,576 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:12:01,578 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:01,578 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:12:01,578 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:12:01,578 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:12:01,578 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:01,579 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:12:01,579 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:12:01,579 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:01,580 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:01,615 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:12:01,615 INFO L131 PetriNetUnfolder]: For 3338/3547 co-relation queries the response was YES. [2022-12-06 00:12:01,617 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3338/3547 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2977 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:12:01,620 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:01,620 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:12:01,797 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:12:01,798 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 220 [2022-12-06 00:12:01,798 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:12:01,798 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:12:01,798 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:12:01,798 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:12:01,798 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1068 [2022-12-06 00:12:01,798 INFO L420 AbstractCegarLoop]: === Iteration 1070 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:12:01,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:12:01,798 INFO L85 PathProgramCache]: Analyzing trace with hash -720147889, now seen corresponding path program 1 times [2022-12-06 00:12:01,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:12:01,799 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243697318] [2022-12-06 00:12:01,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:12:01,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:12:01,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:12:01,878 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-06 00:12:01,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:12:01,878 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243697318] [2022-12-06 00:12:01,878 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1243697318] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:12:01,878 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:12:01,878 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:12:01,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658118838] [2022-12-06 00:12:01,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:12:01,879 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:12:01,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:12:01,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:12:01,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:12:01,879 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:12:01,879 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:12:01,879 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:12:01,879 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:12:01,879 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:12:02,241 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:12:02,242 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:12:02,251 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13571 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:12:02,262 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:12:02,262 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:12:02,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:12:02,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:12:02,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:12:02,263 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:12:02,263 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:12:02,263 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:12:02,318 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:12:02,319 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:02,319 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:12:02,320 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:12:02,320 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:12:02,320 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:02,320 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:12:02,320 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:12:02,320 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:02,321 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:02,355 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:12:02,355 INFO L131 PetriNetUnfolder]: For 3301/3509 co-relation queries the response was YES. [2022-12-06 00:12:02,356 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3301/3509 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2992 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:12:02,359 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:02,359 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:12:02,536 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:12:02,537 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 217 [2022-12-06 00:12:02,537 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:12:02,537 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:12:02,537 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:12:02,537 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:12:02,537 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1069 [2022-12-06 00:12:02,537 INFO L420 AbstractCegarLoop]: === Iteration 1071 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:12:02,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:12:02,538 INFO L85 PathProgramCache]: Analyzing trace with hash 1022662446, now seen corresponding path program 1 times [2022-12-06 00:12:02,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:12:02,538 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806802738] [2022-12-06 00:12:02,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:12:02,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:12:02,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:12:02,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-06 00:12:02,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:12:02,620 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806802738] [2022-12-06 00:12:02,620 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [806802738] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:12:02,620 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:12:02,620 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:12:02,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148424478] [2022-12-06 00:12:02,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:12:02,621 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:12:02,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:12:02,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:12:02,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:12:02,621 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:12:02,621 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:12:02,621 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:12:02,621 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:12:02,621 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:12:02,989 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:12:02,989 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 00:12:02,999 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13574 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:12:03,009 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:12:03,010 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:12:03,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:12:03,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:12:03,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:12:03,011 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:12:03,011 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:12:03,011 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:12:03,061 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:12:03,062 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:03,062 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:12:03,062 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:12:03,062 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:12:03,063 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:03,063 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:12:03,063 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:12:03,063 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:03,064 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:03,096 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:12:03,097 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 00:12:03,098 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3321/3530 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2989 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:12:03,101 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:03,101 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:12:03,274 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:12:03,274 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 212 [2022-12-06 00:12:03,274 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:12:03,274 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:12:03,274 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:12:03,274 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:12:03,275 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1070 [2022-12-06 00:12:03,275 INFO L420 AbstractCegarLoop]: === Iteration 1072 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:12:03,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:12:03,275 INFO L85 PathProgramCache]: Analyzing trace with hash -1529494515, now seen corresponding path program 1 times [2022-12-06 00:12:03,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:12:03,275 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605354600] [2022-12-06 00:12:03,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:12:03,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:12:03,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:12:03,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:12:03,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:12:03,368 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605354600] [2022-12-06 00:12:03,368 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [605354600] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:12:03,368 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:12:03,369 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:12:03,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798344817] [2022-12-06 00:12:03,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:12:03,369 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:12:03,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:12:03,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:12:03,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:12:03,369 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:12:03,369 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:12:03,369 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:12:03,369 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:12:03,370 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:12:03,844 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:12:03,845 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:12:03,851 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13561 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:12:03,860 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:12:03,861 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:12:03,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:12:03,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:12:03,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:12:03,862 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:12:03,862 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:12:03,862 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:12:03,906 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:12:03,907 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:03,908 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:12:03,908 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:12:03,908 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:12:03,908 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:03,908 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:12:03,909 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:12:03,909 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:03,909 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:03,942 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:12:03,942 INFO L131 PetriNetUnfolder]: For 3310/3519 co-relation queries the response was YES. [2022-12-06 00:12:03,943 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3310/3519 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2981 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:12:03,946 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:03,946 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:12:04,382 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:12:04,383 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 475 [2022-12-06 00:12:04,383 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:12:04,383 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:12:04,383 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:12:04,383 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:12:04,383 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1071 [2022-12-06 00:12:04,383 INFO L420 AbstractCegarLoop]: === Iteration 1073 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:12:04,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:12:04,384 INFO L85 PathProgramCache]: Analyzing trace with hash 213315820, now seen corresponding path program 1 times [2022-12-06 00:12:04,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:12:04,384 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371294163] [2022-12-06 00:12:04,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:12:04,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:12:04,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:12:04,477 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-06 00:12:04,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:12:04,478 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371294163] [2022-12-06 00:12:04,478 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1371294163] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:12:04,478 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:12:04,478 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:12:04,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963515683] [2022-12-06 00:12:04,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:12:04,478 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:12:04,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:12:04,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:12:04,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:12:04,479 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:12:04,479 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:12:04,479 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:12:04,479 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:12:04,479 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:12:04,838 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:12:04,838 INFO L131 PetriNetUnfolder]: For 27136/27181 co-relation queries the response was YES. [2022-12-06 00:12:04,847 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27136/27181 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13521 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:12:04,857 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:12:04,857 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:12:04,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:12:04,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:12:04,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:12:04,858 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:12:04,858 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:12:04,858 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:12:04,905 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:12:04,907 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:04,907 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:12:04,907 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:12:04,907 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:12:04,907 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:04,908 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:12:04,908 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:12:04,908 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:04,909 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:04,945 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:12:04,945 INFO L131 PetriNetUnfolder]: For 3185/3328 co-relation queries the response was YES. [2022-12-06 00:12:04,947 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3185/3328 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2987 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:12:04,950 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:04,950 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:12:05,140 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:12:05,141 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 234 [2022-12-06 00:12:05,141 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:12:05,141 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:12:05,141 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:12:05,141 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:12:05,141 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1072 [2022-12-06 00:12:05,141 INFO L420 AbstractCegarLoop]: === Iteration 1074 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:12:05,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:12:05,142 INFO L85 PathProgramCache]: Analyzing trace with hash 1956126155, now seen corresponding path program 1 times [2022-12-06 00:12:05,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:12:05,142 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488090060] [2022-12-06 00:12:05,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:12:05,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:12:05,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:12:05,216 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-06 00:12:05,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:12:05,217 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488090060] [2022-12-06 00:12:05,217 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1488090060] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:12:05,217 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:12:05,217 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:12:05,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834799716] [2022-12-06 00:12:05,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:12:05,217 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:12:05,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:12:05,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:12:05,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:12:05,218 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:12:05,218 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:12:05,218 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:12:05,218 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:12:05,218 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:12:05,595 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:12:05,596 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:12:05,606 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13571 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:12:05,617 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:12:05,618 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:12:05,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:12:05,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:12:05,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:12:05,619 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:12:05,619 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:12:05,619 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:12:05,674 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:12:05,676 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:05,676 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:12:05,676 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:12:05,676 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:12:05,676 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:05,677 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:12:05,677 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:12:05,677 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:05,677 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:05,714 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:12:05,714 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 00:12:05,716 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3312/3520 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 3002 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:12:05,719 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:05,719 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:12:05,918 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:12:05,919 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 243 [2022-12-06 00:12:05,919 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:12:05,919 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:12:05,919 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:12:05,919 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:12:05,919 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1073 [2022-12-06 00:12:05,919 INFO L420 AbstractCegarLoop]: === Iteration 1075 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:12:05,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:12:05,920 INFO L85 PathProgramCache]: Analyzing trace with hash -596030806, now seen corresponding path program 1 times [2022-12-06 00:12:05,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:12:05,920 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949914548] [2022-12-06 00:12:05,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:12:05,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:12:05,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:12:06,003 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-06 00:12:06,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:12:06,004 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949914548] [2022-12-06 00:12:06,004 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [949914548] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:12:06,004 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:12:06,004 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:12:06,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382166981] [2022-12-06 00:12:06,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:12:06,004 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:12:06,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:12:06,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:12:06,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:12:06,005 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:12:06,005 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:12:06,005 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:12:06,005 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:12:06,005 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:12:06,420 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:12:06,420 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 00:12:06,426 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26965/27010 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13537 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:12:06,434 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:12:06,434 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:12:06,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:12:06,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:12:06,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:12:06,435 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:12:06,435 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:12:06,435 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:12:06,480 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:12:06,481 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:06,481 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:12:06,482 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:12:06,482 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:12:06,482 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:06,482 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:12:06,482 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:12:06,482 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:06,483 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:06,520 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:12:06,520 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 00:12:06,521 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3133/3273 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2971 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:12:06,524 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:06,524 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:12:06,708 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:12:06,709 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 227 [2022-12-06 00:12:06,709 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:12:06,709 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:12:06,709 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:12:06,709 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:12:06,709 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1074 [2022-12-06 00:12:06,709 INFO L420 AbstractCegarLoop]: === Iteration 1076 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:12:06,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:12:06,709 INFO L85 PathProgramCache]: Analyzing trace with hash 1146779529, now seen corresponding path program 1 times [2022-12-06 00:12:06,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:12:06,710 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901946247] [2022-12-06 00:12:06,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:12:06,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:12:06,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:12:06,820 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-06 00:12:06,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:12:06,820 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901946247] [2022-12-06 00:12:06,820 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [901946247] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:12:06,820 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:12:06,820 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:12:06,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250568283] [2022-12-06 00:12:06,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:12:06,821 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:12:06,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:12:06,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:12:06,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:12:06,822 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:12:06,822 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:12:06,823 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:12:06,823 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:12:06,823 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:12:07,217 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:12:07,217 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 00:12:07,226 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26965/27010 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13506 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:12:07,236 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:12:07,237 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:12:07,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:12:07,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:12:07,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:12:07,237 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:12:07,237 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:12:07,238 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:12:07,290 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:12:07,291 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:07,291 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:12:07,292 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:12:07,292 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:12:07,292 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:07,292 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:12:07,292 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:12:07,293 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:07,293 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:07,327 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:12:07,327 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 00:12:07,329 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3133/3273 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2977 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:12:07,332 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:07,332 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:12:07,515 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:12:07,515 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 223 [2022-12-06 00:12:07,516 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:12:07,516 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:12:07,516 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:12:07,516 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:12:07,516 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1075 [2022-12-06 00:12:07,516 INFO L420 AbstractCegarLoop]: === Iteration 1077 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:12:07,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:12:07,516 INFO L85 PathProgramCache]: Analyzing trace with hash -1405377432, now seen corresponding path program 1 times [2022-12-06 00:12:07,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:12:07,516 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447141871] [2022-12-06 00:12:07,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:12:07,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:12:07,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:12:07,600 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-06 00:12:07,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:12:07,601 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447141871] [2022-12-06 00:12:07,601 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [447141871] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:12:07,601 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:12:07,601 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:12:07,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134688116] [2022-12-06 00:12:07,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:12:07,601 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:12:07,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:12:07,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:12:07,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:12:07,602 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:12:07,602 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:12:07,602 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:12:07,602 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:12:07,602 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:12:07,970 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:12:07,970 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:12:07,978 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13566 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:12:07,989 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:12:07,989 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:12:07,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:12:07,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:12:07,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:12:07,990 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:12:07,990 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:12:07,990 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:12:08,041 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:12:08,043 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:08,043 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:12:08,043 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:12:08,043 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:12:08,043 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:08,044 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:12:08,044 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:12:08,044 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:08,045 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:08,080 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:12:08,081 INFO L131 PetriNetUnfolder]: For 3349/3561 co-relation queries the response was YES. [2022-12-06 00:12:08,082 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3349/3561 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2977 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:12:08,085 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:08,086 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:12:08,259 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:12:08,259 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 216 [2022-12-06 00:12:08,259 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:12:08,260 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:12:08,260 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:12:08,260 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:12:08,260 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1076 [2022-12-06 00:12:08,260 INFO L420 AbstractCegarLoop]: === Iteration 1078 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:12:08,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:12:08,260 INFO L85 PathProgramCache]: Analyzing trace with hash 337432903, now seen corresponding path program 1 times [2022-12-06 00:12:08,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:12:08,260 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063242344] [2022-12-06 00:12:08,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:12:08,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:12:08,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:12:08,353 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-06 00:12:08,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:12:08,353 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063242344] [2022-12-06 00:12:08,353 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1063242344] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:12:08,353 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:12:08,354 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:12:08,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773076402] [2022-12-06 00:12:08,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:12:08,354 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:12:08,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:12:08,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:12:08,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:12:08,354 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:12:08,354 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:12:08,354 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:12:08,354 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:12:08,355 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:12:08,796 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:12:08,796 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 00:12:08,803 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26965/27010 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13539 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:12:08,812 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:12:08,813 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:12:08,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:12:08,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:12:08,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:12:08,814 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:12:08,814 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:12:08,814 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:12:08,859 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:12:08,861 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:08,861 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:12:08,861 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:12:08,861 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:12:08,861 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:08,862 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:12:08,862 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:12:08,862 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:08,863 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:08,895 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:12:08,895 INFO L131 PetriNetUnfolder]: For 3134/3275 co-relation queries the response was YES. [2022-12-06 00:12:08,897 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3134/3275 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2974 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:12:08,899 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:08,899 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:12:09,198 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:12:09,199 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 338 [2022-12-06 00:12:09,199 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:12:09,200 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:12:09,200 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:12:09,200 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:12:09,200 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1077 [2022-12-06 00:12:09,200 INFO L420 AbstractCegarLoop]: === Iteration 1079 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:12:09,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:12:09,200 INFO L85 PathProgramCache]: Analyzing trace with hash 2080243238, now seen corresponding path program 1 times [2022-12-06 00:12:09,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:12:09,200 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935794614] [2022-12-06 00:12:09,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:12:09,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:12:09,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:12:09,290 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-06 00:12:09,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:12:09,291 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935794614] [2022-12-06 00:12:09,291 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [935794614] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:12:09,291 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:12:09,291 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:12:09,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832828967] [2022-12-06 00:12:09,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:12:09,291 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:12:09,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:12:09,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:12:09,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:12:09,292 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:12:09,292 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:12:09,292 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:12:09,292 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:12:09,292 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:12:09,665 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:12:09,666 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 00:12:09,675 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26965/27010 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13530 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:12:09,687 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:12:09,687 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:12:09,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:12:09,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:12:09,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:12:09,688 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:12:09,688 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:12:09,688 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:12:09,742 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:12:09,744 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:09,744 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:12:09,744 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:12:09,744 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:12:09,744 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:09,745 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:12:09,745 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:12:09,745 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:09,746 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:09,778 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:12:09,778 INFO L131 PetriNetUnfolder]: For 3122/3262 co-relation queries the response was YES. [2022-12-06 00:12:09,780 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3122/3262 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2971 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:12:09,783 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:09,783 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:12:09,963 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:12:09,964 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 220 [2022-12-06 00:12:09,964 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:12:09,964 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:12:09,964 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:12:09,964 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:12:09,964 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1078 [2022-12-06 00:12:09,964 INFO L420 AbstractCegarLoop]: === Iteration 1080 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:12:09,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:12:09,965 INFO L85 PathProgramCache]: Analyzing trace with hash -471913723, now seen corresponding path program 1 times [2022-12-06 00:12:09,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:12:09,965 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500973467] [2022-12-06 00:12:09,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:12:09,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:12:09,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:12:10,055 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-06 00:12:10,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:12:10,055 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500973467] [2022-12-06 00:12:10,055 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [500973467] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:12:10,055 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:12:10,055 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:12:10,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719981582] [2022-12-06 00:12:10,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:12:10,055 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:12:10,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:12:10,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:12:10,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:12:10,056 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:12:10,056 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:12:10,056 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:12:10,056 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:12:10,056 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:12:10,493 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:12:10,493 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:12:10,501 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13567 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:12:10,513 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:12:10,513 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:12:10,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:12:10,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:12:10,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:12:10,514 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:12:10,515 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:12:10,515 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:12:10,565 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:12:10,567 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:10,567 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:12:10,568 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:12:10,568 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:12:10,568 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:10,568 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:12:10,569 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:12:10,569 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:10,570 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:10,604 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:12:10,605 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 00:12:10,606 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3312/3520 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2979 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:12:10,610 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:10,610 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:12:10,789 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:12:10,790 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 222 [2022-12-06 00:12:10,790 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:12:10,790 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:12:10,790 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:12:10,790 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:12:10,790 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1079 [2022-12-06 00:12:10,790 INFO L420 AbstractCegarLoop]: === Iteration 1081 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:12:10,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:12:10,791 INFO L85 PathProgramCache]: Analyzing trace with hash 1270896612, now seen corresponding path program 1 times [2022-12-06 00:12:10,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:12:10,791 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776398280] [2022-12-06 00:12:10,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:12:10,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:12:10,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:12:10,876 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-06 00:12:10,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:12:10,877 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776398280] [2022-12-06 00:12:10,877 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [776398280] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:12:10,877 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:12:10,877 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:12:10,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653633255] [2022-12-06 00:12:10,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:12:10,877 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:12:10,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:12:10,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:12:10,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:12:10,877 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:12:10,878 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:12:10,878 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:12:10,878 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:12:10,878 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:12:11,287 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:12:11,287 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:12:11,294 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13556 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:12:11,303 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:12:11,303 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:12:11,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:12:11,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:12:11,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:12:11,304 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:12:11,304 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:12:11,304 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:12:11,344 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:12:11,345 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:11,346 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:12:11,346 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:12:11,346 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:12:11,346 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:11,346 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:12:11,347 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:12:11,347 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:11,347 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:11,380 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:12:11,380 INFO L131 PetriNetUnfolder]: For 3338/3550 co-relation queries the response was YES. [2022-12-06 00:12:11,381 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3338/3550 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2984 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:12:11,384 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:11,384 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:12:11,579 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:12:11,579 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 233 [2022-12-06 00:12:11,579 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:12:11,579 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:12:11,580 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:12:11,580 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:12:11,580 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1080 [2022-12-06 00:12:11,580 INFO L420 AbstractCegarLoop]: === Iteration 1082 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:12:11,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:12:11,580 INFO L85 PathProgramCache]: Analyzing trace with hash -1281260349, now seen corresponding path program 1 times [2022-12-06 00:12:11,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:12:11,580 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175909047] [2022-12-06 00:12:11,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:12:11,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:12:11,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:12:11,674 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-06 00:12:11,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:12:11,674 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175909047] [2022-12-06 00:12:11,674 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [175909047] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:12:11,674 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:12:11,674 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:12:11,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008767301] [2022-12-06 00:12:11,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:12:11,683 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:12:11,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:12:11,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:12:11,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:12:11,684 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:12:11,684 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:12:11,684 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:12:11,684 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:12:11,684 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:12:12,123 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:12:12,123 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:12:12,133 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13538 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:12:12,143 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:12:12,143 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:12:12,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:12:12,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:12:12,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:12:12,144 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:12:12,144 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:12:12,144 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:12:12,195 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:12:12,196 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:12,196 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:12:12,196 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:12:12,197 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:12:12,197 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:12,197 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:12:12,197 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:12:12,197 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:12,198 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:12,232 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:12:12,232 INFO L131 PetriNetUnfolder]: For 3293/3500 co-relation queries the response was YES. [2022-12-06 00:12:12,235 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3293/3500 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2977 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:12:12,237 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:12,238 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:12:12,442 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:12:12,443 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 246 [2022-12-06 00:12:12,443 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:12:12,443 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:12:12,443 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:12:12,443 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:12:12,443 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1081 [2022-12-06 00:12:12,443 INFO L420 AbstractCegarLoop]: === Iteration 1083 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:12:12,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:12:12,444 INFO L85 PathProgramCache]: Analyzing trace with hash 461549986, now seen corresponding path program 1 times [2022-12-06 00:12:12,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:12:12,444 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184009131] [2022-12-06 00:12:12,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:12:12,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:12:12,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:12:12,681 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-06 00:12:12,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:12:12,681 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184009131] [2022-12-06 00:12:12,681 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1184009131] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:12:12,681 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:12:12,682 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:12:12,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944369381] [2022-12-06 00:12:12,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:12:12,682 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:12:12,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:12:12,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:12:12,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:12:12,682 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:12:12,682 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:12:12,683 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:12:12,683 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:12:12,683 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:12:13,054 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:12:13,055 INFO L131 PetriNetUnfolder]: For 27136/27181 co-relation queries the response was YES. [2022-12-06 00:12:13,063 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27136/27181 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13522 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:12:13,074 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:12:13,074 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:12:13,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:12:13,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:12:13,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:12:13,075 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:12:13,075 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:12:13,075 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:12:13,126 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:12:13,128 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:13,128 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:12:13,128 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:12:13,128 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:12:13,128 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:13,129 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:12:13,129 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:12:13,129 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:13,130 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:13,165 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:12:13,165 INFO L131 PetriNetUnfolder]: For 3167/3307 co-relation queries the response was YES. [2022-12-06 00:12:13,166 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3167/3307 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2981 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:12:13,169 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:13,169 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:12:13,360 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:12:13,361 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 233 [2022-12-06 00:12:13,361 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:12:13,361 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:12:13,361 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:12:13,361 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:12:13,361 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1082 [2022-12-06 00:12:13,361 INFO L420 AbstractCegarLoop]: === Iteration 1084 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:12:13,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:12:13,361 INFO L85 PathProgramCache]: Analyzing trace with hash -2090606975, now seen corresponding path program 1 times [2022-12-06 00:12:13,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:12:13,362 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596286328] [2022-12-06 00:12:13,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:12:13,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:12:13,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:12:13,450 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-06 00:12:13,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:12:13,451 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596286328] [2022-12-06 00:12:13,451 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [596286328] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:12:13,451 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:12:13,451 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:12:13,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589219713] [2022-12-06 00:12:13,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:12:13,451 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:12:13,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:12:13,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:12:13,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:12:13,452 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:12:13,452 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:12:13,452 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:12:13,452 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:12:13,452 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:12:13,872 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:12:13,873 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:12:13,880 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13582 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:12:13,889 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:12:13,890 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:12:13,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:12:13,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:12:13,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:12:13,891 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:12:13,891 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:12:13,891 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:12:13,934 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:12:13,935 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:13,935 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:12:13,936 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:12:13,936 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:12:13,936 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:13,936 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:12:13,936 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:12:13,936 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:13,937 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:13,969 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:12:13,969 INFO L131 PetriNetUnfolder]: For 3307/3517 co-relation queries the response was YES. [2022-12-06 00:12:13,971 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3307/3517 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2993 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:12:13,974 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:13,974 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:12:14,175 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:12:14,176 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 240 [2022-12-06 00:12:14,176 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:12:14,176 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:12:14,176 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:12:14,176 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:12:14,176 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1083 [2022-12-06 00:12:14,176 INFO L420 AbstractCegarLoop]: === Iteration 1085 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:12:14,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:12:14,177 INFO L85 PathProgramCache]: Analyzing trace with hash -347796640, now seen corresponding path program 1 times [2022-12-06 00:12:14,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:12:14,177 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700362273] [2022-12-06 00:12:14,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:12:14,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:12:14,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:12:14,270 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-06 00:12:14,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:12:14,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700362273] [2022-12-06 00:12:14,270 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [700362273] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:12:14,271 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:12:14,271 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:12:14,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71520578] [2022-12-06 00:12:14,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:12:14,271 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:12:14,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:12:14,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:12:14,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:12:14,271 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:12:14,271 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:12:14,271 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:12:14,272 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:12:14,272 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:12:14,653 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:12:14,654 INFO L131 PetriNetUnfolder]: For 27136/27181 co-relation queries the response was YES. [2022-12-06 00:12:14,662 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27136/27181 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13516 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:12:14,672 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:12:14,673 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:12:14,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:12:14,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:12:14,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:12:14,674 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:12:14,674 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:12:14,674 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:12:14,724 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:12:14,725 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:14,725 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:12:14,726 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:12:14,726 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:12:14,726 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:14,726 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:12:14,726 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:12:14,726 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:14,727 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:14,764 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:12:14,764 INFO L131 PetriNetUnfolder]: For 3169/3310 co-relation queries the response was YES. [2022-12-06 00:12:14,766 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3169/3310 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2992 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:12:14,768 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:14,769 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:12:14,958 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:12:14,959 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 233 [2022-12-06 00:12:14,959 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:12:14,959 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:12:14,959 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:12:14,959 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:12:14,959 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1084 [2022-12-06 00:12:14,960 INFO L420 AbstractCegarLoop]: === Iteration 1086 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:12:14,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:12:14,960 INFO L85 PathProgramCache]: Analyzing trace with hash 1395013695, now seen corresponding path program 1 times [2022-12-06 00:12:14,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:12:14,960 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342824137] [2022-12-06 00:12:14,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:12:14,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:12:14,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:12:15,040 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-06 00:12:15,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:12:15,040 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342824137] [2022-12-06 00:12:15,040 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [342824137] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:12:15,040 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:12:15,040 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:12:15,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534041266] [2022-12-06 00:12:15,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:12:15,041 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:12:15,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:12:15,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:12:15,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:12:15,041 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:12:15,041 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:12:15,041 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:12:15,041 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:12:15,041 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:12:15,432 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:12:15,432 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 00:12:15,441 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13549 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:12:15,452 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:12:15,452 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:12:15,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:12:15,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:12:15,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:12:15,453 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:12:15,453 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:12:15,453 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:12:15,503 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:12:15,504 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:15,504 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:12:15,504 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:12:15,505 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:12:15,505 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:15,505 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:12:15,505 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:12:15,505 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:15,506 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:15,538 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:12:15,538 INFO L131 PetriNetUnfolder]: For 3304/3511 co-relation queries the response was YES. [2022-12-06 00:12:15,539 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3304/3511 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2989 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:12:15,542 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:15,542 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:12:15,714 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:12:15,714 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 209 [2022-12-06 00:12:15,714 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:12:15,714 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:12:15,714 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:12:15,714 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:12:15,715 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1085 [2022-12-06 00:12:15,715 INFO L420 AbstractCegarLoop]: === Iteration 1087 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:12:15,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:12:15,715 INFO L85 PathProgramCache]: Analyzing trace with hash -1157143266, now seen corresponding path program 1 times [2022-12-06 00:12:15,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:12:15,715 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262636470] [2022-12-06 00:12:15,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:12:15,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:12:15,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:12:15,810 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-06 00:12:15,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:12:15,810 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262636470] [2022-12-06 00:12:15,810 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1262636470] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:12:15,810 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:12:15,810 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:12:15,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195982612] [2022-12-06 00:12:15,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:12:15,810 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:12:15,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:12:15,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:12:15,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:12:15,811 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:12:15,811 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:12:15,811 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:12:15,811 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:12:15,811 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:12:16,208 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:12:16,209 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:12:16,216 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13558 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:12:16,224 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:12:16,225 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:12:16,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:12:16,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:12:16,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:12:16,226 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:12:16,226 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:12:16,226 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:12:16,270 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:12:16,272 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:16,272 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:12:16,272 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:12:16,272 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:12:16,272 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:16,273 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:12:16,273 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:12:16,273 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:16,274 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:16,306 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:12:16,306 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 00:12:16,307 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3321/3530 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2975 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:12:16,310 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:16,310 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:12:16,482 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:12:16,483 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 211 [2022-12-06 00:12:16,483 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:12:16,483 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:12:16,483 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:12:16,483 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:12:16,483 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1086 [2022-12-06 00:12:16,483 INFO L420 AbstractCegarLoop]: === Iteration 1088 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:12:16,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:12:16,484 INFO L85 PathProgramCache]: Analyzing trace with hash 585667069, now seen corresponding path program 1 times [2022-12-06 00:12:16,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:12:16,484 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450739754] [2022-12-06 00:12:16,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:12:16,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:12:16,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:12:16,563 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-06 00:12:16,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:12:16,563 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1450739754] [2022-12-06 00:12:16,563 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1450739754] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:12:16,564 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:12:16,564 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:12:16,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117971629] [2022-12-06 00:12:16,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:12:16,564 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:12:16,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:12:16,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:12:16,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:12:16,564 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:12:16,565 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:12:16,565 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:12:16,565 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:12:16,565 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:12:16,931 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:12:16,931 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 00:12:16,939 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26965/27010 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13526 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:12:16,949 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:12:16,949 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:12:16,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:12:16,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:12:16,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:12:16,950 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:12:16,950 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:12:16,950 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:12:16,999 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:12:17,000 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:17,000 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:12:17,000 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:12:17,000 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:12:17,000 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:17,001 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:12:17,001 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:12:17,001 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:17,002 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:17,035 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:12:17,035 INFO L131 PetriNetUnfolder]: For 3122/3262 co-relation queries the response was YES. [2022-12-06 00:12:17,036 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3122/3262 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2966 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:12:17,039 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:17,039 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:12:17,228 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:12:17,228 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 228 [2022-12-06 00:12:17,228 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:12:17,228 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:12:17,229 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:12:17,229 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:12:17,229 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1087 [2022-12-06 00:12:17,229 INFO L420 AbstractCegarLoop]: === Iteration 1089 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:12:17,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:12:17,229 INFO L85 PathProgramCache]: Analyzing trace with hash -1966489892, now seen corresponding path program 1 times [2022-12-06 00:12:17,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:12:17,229 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944917273] [2022-12-06 00:12:17,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:12:17,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:12:17,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:12:17,306 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-06 00:12:17,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:12:17,306 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944917273] [2022-12-06 00:12:17,306 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1944917273] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:12:17,306 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:12:17,306 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:12:17,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413873670] [2022-12-06 00:12:17,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:12:17,306 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:12:17,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:12:17,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:12:17,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:12:17,307 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:12:17,307 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:12:17,307 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:12:17,307 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:12:17,307 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:12:17,672 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:12:17,672 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:12:17,679 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13571 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:12:17,690 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:12:17,690 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:12:17,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:12:17,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:12:17,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:12:17,691 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:12:17,691 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:12:17,691 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:12:17,742 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:12:17,743 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:17,743 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:12:17,743 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:12:17,743 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:12:17,744 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:17,744 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:12:17,744 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:12:17,744 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:17,745 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:17,776 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:12:17,776 INFO L131 PetriNetUnfolder]: For 3349/3561 co-relation queries the response was YES. [2022-12-06 00:12:17,778 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3349/3561 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2994 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:12:17,780 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:17,780 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:12:17,954 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:12:17,955 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 212 [2022-12-06 00:12:17,955 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:12:17,955 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:12:17,955 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:12:17,955 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:12:17,955 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1088 [2022-12-06 00:12:17,955 INFO L420 AbstractCegarLoop]: === Iteration 1090 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:12:17,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:12:17,956 INFO L85 PathProgramCache]: Analyzing trace with hash -223679557, now seen corresponding path program 1 times [2022-12-06 00:12:17,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:12:17,956 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582875723] [2022-12-06 00:12:17,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:12:17,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:12:17,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:12:18,031 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-06 00:12:18,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:12:18,031 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582875723] [2022-12-06 00:12:18,031 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [582875723] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:12:18,031 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:12:18,032 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:12:18,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866789076] [2022-12-06 00:12:18,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:12:18,032 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:12:18,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:12:18,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:12:18,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:12:18,032 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:12:18,032 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:12:18,032 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:12:18,032 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:12:18,033 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:12:18,496 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:12:18,496 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:12:18,502 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13566 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:12:18,512 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:12:18,512 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:12:18,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:12:18,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:12:18,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:12:18,513 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:12:18,513 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:12:18,513 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:12:18,562 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:12:18,564 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:18,564 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:12:18,564 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:12:18,564 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:12:18,564 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:18,565 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:12:18,565 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:12:18,565 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:18,565 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:18,599 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:12:18,599 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 00:12:18,600 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3312/3520 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2975 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:12:18,603 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:18,603 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:12:18,773 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:12:18,774 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 210 [2022-12-06 00:12:18,774 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:12:18,774 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:12:18,774 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:12:18,774 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:12:18,774 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1089 [2022-12-06 00:12:18,774 INFO L420 AbstractCegarLoop]: === Iteration 1091 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:12:18,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:12:18,775 INFO L85 PathProgramCache]: Analyzing trace with hash 1519130778, now seen corresponding path program 1 times [2022-12-06 00:12:18,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:12:18,775 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944925400] [2022-12-06 00:12:18,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:12:18,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:12:18,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:12:18,851 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-06 00:12:18,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:12:18,851 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944925400] [2022-12-06 00:12:18,851 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [944925400] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:12:18,851 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:12:18,851 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:12:18,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208985031] [2022-12-06 00:12:18,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:12:18,852 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:12:18,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:12:18,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:12:18,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:12:18,852 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:12:18,852 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:12:18,852 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:12:18,852 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:12:18,852 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:12:19,210 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:12:19,210 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:12:19,219 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13561 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:12:19,230 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:12:19,231 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:12:19,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:12:19,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:12:19,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:12:19,232 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:12:19,232 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:12:19,232 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:12:19,280 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:12:19,282 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:19,282 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:12:19,282 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:12:19,282 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:12:19,282 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:19,283 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:12:19,283 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:12:19,283 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:19,284 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:19,316 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:12:19,317 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 00:12:19,318 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3312/3520 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2976 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:12:19,321 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:19,321 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:12:19,510 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:12:19,511 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 229 [2022-12-06 00:12:19,511 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:12:19,511 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:12:19,511 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:12:19,511 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:12:19,511 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1090 [2022-12-06 00:12:19,511 INFO L420 AbstractCegarLoop]: === Iteration 1092 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:12:19,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:12:19,512 INFO L85 PathProgramCache]: Analyzing trace with hash -1033026183, now seen corresponding path program 1 times [2022-12-06 00:12:19,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:12:19,512 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668374151] [2022-12-06 00:12:19,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:12:19,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:12:19,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:12:19,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-06 00:12:19,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:12:19,601 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668374151] [2022-12-06 00:12:19,601 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1668374151] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:12:19,601 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:12:19,601 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:12:19,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878039183] [2022-12-06 00:12:19,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:12:19,602 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:12:19,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:12:19,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:12:19,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:12:19,602 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:12:19,602 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:12:19,602 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:12:19,602 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:12:19,602 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:12:19,975 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:12:19,975 INFO L131 PetriNetUnfolder]: For 27150/27195 co-relation queries the response was YES. [2022-12-06 00:12:19,983 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27150/27195 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13520 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:12:19,993 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:12:19,993 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:12:19,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:12:19,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:12:19,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:12:19,994 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:12:19,994 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:12:19,994 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:12:20,041 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:12:20,043 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:20,043 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:12:20,043 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:12:20,043 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:12:20,044 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:20,044 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:12:20,044 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:12:20,044 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:20,045 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:20,079 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:12:20,079 INFO L131 PetriNetUnfolder]: For 3167/3307 co-relation queries the response was YES. [2022-12-06 00:12:20,080 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3167/3307 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2987 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:12:20,083 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:20,083 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:12:20,262 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:12:20,263 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 220 [2022-12-06 00:12:20,263 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:12:20,263 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:12:20,263 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:12:20,263 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:12:20,263 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1091 [2022-12-06 00:12:20,263 INFO L420 AbstractCegarLoop]: === Iteration 1093 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:12:20,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:12:20,264 INFO L85 PathProgramCache]: Analyzing trace with hash 709784152, now seen corresponding path program 1 times [2022-12-06 00:12:20,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:12:20,264 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843874615] [2022-12-06 00:12:20,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:12:20,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:12:20,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:12:20,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-06 00:12:20,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:12:20,358 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843874615] [2022-12-06 00:12:20,358 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1843874615] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:12:20,358 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:12:20,358 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:12:20,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203908816] [2022-12-06 00:12:20,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:12:20,359 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:12:20,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:12:20,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:12:20,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:12:20,359 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:12:20,359 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:12:20,359 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:12:20,359 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:12:20,359 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:12:20,772 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:12:20,772 INFO L131 PetriNetUnfolder]: For 27146/27191 co-relation queries the response was YES. [2022-12-06 00:12:20,782 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27146/27191 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13520 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:12:20,790 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:12:20,790 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:12:20,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:12:20,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:12:20,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:12:20,791 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:12:20,791 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:12:20,791 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:12:20,833 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:12:20,835 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:20,835 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:12:20,836 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:12:20,836 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:12:20,836 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:20,836 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:12:20,836 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:12:20,836 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:20,837 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:20,872 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:12:20,872 INFO L131 PetriNetUnfolder]: For 3169/3310 co-relation queries the response was YES. [2022-12-06 00:12:20,873 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3169/3310 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2987 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:12:20,876 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:20,876 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:12:21,063 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:12:21,063 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 227 [2022-12-06 00:12:21,063 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:12:21,063 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:12:21,063 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:12:21,064 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:12:21,064 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1092 [2022-12-06 00:12:21,064 INFO L420 AbstractCegarLoop]: === Iteration 1094 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:12:21,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:12:21,064 INFO L85 PathProgramCache]: Analyzing trace with hash -1842372809, now seen corresponding path program 1 times [2022-12-06 00:12:21,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:12:21,064 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780453272] [2022-12-06 00:12:21,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:12:21,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:12:21,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:12:21,141 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-06 00:12:21,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:12:21,141 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780453272] [2022-12-06 00:12:21,141 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1780453272] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:12:21,141 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:12:21,141 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:12:21,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005137641] [2022-12-06 00:12:21,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:12:21,142 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:12:21,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:12:21,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:12:21,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:12:21,142 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:12:21,142 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:12:21,142 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:12:21,142 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:12:21,143 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:12:21,498 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:12:21,499 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 00:12:21,507 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13563 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:12:21,517 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:12:21,517 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:12:21,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:12:21,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:12:21,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:12:21,518 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:12:21,518 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:12:21,518 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:12:21,565 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:12:21,567 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:21,567 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:12:21,567 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:12:21,567 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:12:21,567 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:21,568 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:12:21,568 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:12:21,568 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:21,568 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:21,600 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:12:21,600 INFO L131 PetriNetUnfolder]: For 3304/3511 co-relation queries the response was YES. [2022-12-06 00:12:21,602 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3304/3511 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2989 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:12:21,604 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:21,604 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:12:21,788 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:12:21,788 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 221 [2022-12-06 00:12:21,789 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:12:21,789 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:12:21,789 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:12:21,789 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:12:21,789 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1093 [2022-12-06 00:12:21,789 INFO L420 AbstractCegarLoop]: === Iteration 1095 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:12:21,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:12:21,789 INFO L85 PathProgramCache]: Analyzing trace with hash -99562474, now seen corresponding path program 1 times [2022-12-06 00:12:21,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:12:21,789 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876420762] [2022-12-06 00:12:21,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:12:21,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:12:21,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:12:21,881 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-06 00:12:21,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:12:21,881 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876420762] [2022-12-06 00:12:21,881 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [876420762] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:12:21,881 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:12:21,881 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:12:21,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322751519] [2022-12-06 00:12:21,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:12:21,882 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:12:21,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:12:21,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:12:21,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:12:21,882 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:12:21,882 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:12:21,882 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:12:21,882 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:12:21,882 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:12:22,256 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:12:22,256 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 00:12:22,264 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26969/27014 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13522 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:12:22,275 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:12:22,275 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:12:22,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:12:22,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:12:22,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:12:22,276 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:12:22,276 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:12:22,276 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:12:22,328 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:12:22,329 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:22,329 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:12:22,330 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:12:22,330 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:12:22,330 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:22,330 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:12:22,330 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:12:22,331 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:22,331 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:22,367 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:12:22,367 INFO L131 PetriNetUnfolder]: For 3122/3262 co-relation queries the response was YES. [2022-12-06 00:12:22,368 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3122/3262 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2965 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:12:22,371 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:22,371 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:12:22,639 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:12:22,640 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 310 [2022-12-06 00:12:22,640 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:12:22,640 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:12:22,640 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:12:22,640 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:12:22,640 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1094 [2022-12-06 00:12:22,640 INFO L420 AbstractCegarLoop]: === Iteration 1096 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:12:22,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:12:22,640 INFO L85 PathProgramCache]: Analyzing trace with hash 1643247861, now seen corresponding path program 1 times [2022-12-06 00:12:22,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:12:22,641 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058786401] [2022-12-06 00:12:22,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:12:22,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:12:22,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:12:22,720 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-06 00:12:22,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:12:22,720 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058786401] [2022-12-06 00:12:22,720 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1058786401] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:12:22,720 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:12:22,720 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:12:22,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046153967] [2022-12-06 00:12:22,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:12:22,721 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:12:22,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:12:22,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:12:22,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:12:22,721 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:12:22,721 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:12:22,721 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:12:22,721 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:12:22,721 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:12:23,116 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:12:23,116 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:12:23,123 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13571 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:12:23,132 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:12:23,132 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:12:23,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:12:23,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:12:23,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:12:23,133 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:12:23,133 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:12:23,133 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:12:23,178 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:12:23,180 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:23,180 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:12:23,180 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:12:23,180 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:12:23,180 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:23,181 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:12:23,181 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:12:23,181 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:23,182 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:23,218 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:12:23,219 INFO L131 PetriNetUnfolder]: For 3301/3509 co-relation queries the response was YES. [2022-12-06 00:12:23,220 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3301/3509 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2984 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:12:23,223 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:23,223 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:12:23,406 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:12:23,406 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 226 [2022-12-06 00:12:23,406 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:12:23,406 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:12:23,407 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:12:23,407 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:12:23,407 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1095 [2022-12-06 00:12:23,407 INFO L420 AbstractCegarLoop]: === Iteration 1097 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:12:23,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:12:23,407 INFO L85 PathProgramCache]: Analyzing trace with hash -908909100, now seen corresponding path program 1 times [2022-12-06 00:12:23,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:12:23,407 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639269517] [2022-12-06 00:12:23,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:12:23,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:12:23,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:12:23,504 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-06 00:12:23,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:12:23,505 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639269517] [2022-12-06 00:12:23,505 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [639269517] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:12:23,505 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:12:23,505 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:12:23,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406157352] [2022-12-06 00:12:23,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:12:23,505 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:12:23,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:12:23,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:12:23,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:12:23,505 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:12:23,506 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:12:23,506 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:12:23,506 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:12:23,506 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:12:23,879 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:12:23,879 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 00:12:23,889 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13571 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:12:23,900 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:12:23,900 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:12:23,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:12:23,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:12:23,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:12:23,901 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:12:23,901 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:12:23,901 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:12:23,953 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:12:23,955 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:23,955 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:12:23,955 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:12:23,955 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:12:23,955 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:23,956 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:12:23,956 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:12:23,956 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:23,957 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:23,992 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:12:23,992 INFO L131 PetriNetUnfolder]: For 3338/3547 co-relation queries the response was YES. [2022-12-06 00:12:23,994 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3338/3547 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2997 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:12:23,997 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:23,997 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:12:24,164 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:12:24,165 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 210 [2022-12-06 00:12:24,165 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:12:24,165 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:12:24,165 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:12:24,165 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:12:24,165 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1096 [2022-12-06 00:12:24,165 INFO L420 AbstractCegarLoop]: === Iteration 1098 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:12:24,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:12:24,165 INFO L85 PathProgramCache]: Analyzing trace with hash 833901235, now seen corresponding path program 1 times [2022-12-06 00:12:24,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:12:24,165 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585035625] [2022-12-06 00:12:24,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:12:24,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:12:24,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:12:24,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:12:24,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:12:24,239 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585035625] [2022-12-06 00:12:24,239 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [585035625] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:12:24,240 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:12:24,240 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:12:24,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361322736] [2022-12-06 00:12:24,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:12:24,240 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:12:24,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:12:24,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:12:24,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:12:24,240 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:12:24,240 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:12:24,240 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:12:24,240 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:12:24,241 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:12:24,602 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:12:24,602 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:12:24,610 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13558 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:12:24,620 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:12:24,620 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:12:24,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:12:24,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:12:24,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:12:24,621 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:12:24,621 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:12:24,621 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:12:24,667 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:12:24,668 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:24,668 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:12:24,669 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:12:24,669 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:12:24,669 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:24,669 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:12:24,669 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:12:24,669 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:24,670 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:24,704 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:12:24,704 INFO L131 PetriNetUnfolder]: For 3293/3500 co-relation queries the response was YES. [2022-12-06 00:12:24,705 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3293/3500 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2985 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:12:24,708 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:24,708 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:12:24,892 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:12:24,892 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 223 [2022-12-06 00:12:24,892 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:12:24,892 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:12:24,893 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:12:24,893 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:12:24,893 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1097 [2022-12-06 00:12:24,893 INFO L420 AbstractCegarLoop]: === Iteration 1099 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:12:24,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:12:24,893 INFO L85 PathProgramCache]: Analyzing trace with hash -1718255726, now seen corresponding path program 1 times [2022-12-06 00:12:24,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:12:24,893 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15805340] [2022-12-06 00:12:24,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:12:24,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:12:24,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:12:24,998 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-06 00:12:24,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:12:24,998 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15805340] [2022-12-06 00:12:24,998 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [15805340] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:12:24,998 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:12:24,998 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:12:24,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469324530] [2022-12-06 00:12:24,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:12:24,998 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:12:24,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:12:24,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:12:24,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:12:24,999 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:12:24,999 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:12:24,999 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:12:24,999 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:12:24,999 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:12:25,426 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:12:25,426 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:12:25,434 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13554 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:12:25,444 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:12:25,444 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:12:25,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:12:25,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:12:25,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:12:25,445 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:12:25,445 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:12:25,445 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:12:25,489 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:12:25,491 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:25,491 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:12:25,491 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:12:25,491 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:12:25,491 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:25,492 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:12:25,492 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:12:25,492 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:25,493 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:25,526 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:12:25,526 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 00:12:25,527 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3312/3520 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2983 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:12:25,530 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:25,530 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:12:25,722 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:12:25,723 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 232 [2022-12-06 00:12:25,723 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:12:25,723 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:12:25,723 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:12:25,723 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:12:25,723 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1098 [2022-12-06 00:12:25,723 INFO L420 AbstractCegarLoop]: === Iteration 1100 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:12:25,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:12:25,724 INFO L85 PathProgramCache]: Analyzing trace with hash 24554609, now seen corresponding path program 1 times [2022-12-06 00:12:25,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:12:25,724 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287676799] [2022-12-06 00:12:25,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:12:25,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:12:25,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:12:25,800 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-06 00:12:25,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:12:25,801 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287676799] [2022-12-06 00:12:25,801 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [287676799] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:12:25,801 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:12:25,801 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:12:25,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113121540] [2022-12-06 00:12:25,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:12:25,801 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:12:25,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:12:25,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:12:25,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:12:25,802 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:12:25,802 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:12:25,802 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:12:25,802 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:12:25,802 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:12:26,170 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:12:26,171 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 00:12:26,180 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26965/27010 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13520 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:12:26,191 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:12:26,191 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:12:26,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:12:26,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:12:26,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:12:26,192 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:12:26,192 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:12:26,192 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:12:26,241 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:12:26,242 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:26,243 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:12:26,243 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:12:26,243 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:12:26,243 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:26,243 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:12:26,244 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:12:26,244 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:26,244 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:26,275 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:12:26,275 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 00:12:26,277 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3133/3273 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2972 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:12:26,280 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:26,280 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:12:26,463 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:12:26,464 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 221 [2022-12-06 00:12:26,464 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:12:26,464 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:12:26,464 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:12:26,464 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:12:26,464 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1099 [2022-12-06 00:12:26,464 INFO L420 AbstractCegarLoop]: === Iteration 1101 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:12:26,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:12:26,464 INFO L85 PathProgramCache]: Analyzing trace with hash 1767364944, now seen corresponding path program 1 times [2022-12-06 00:12:26,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:12:26,464 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546894903] [2022-12-06 00:12:26,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:12:26,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:12:26,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:12:26,560 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-06 00:12:26,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:12:26,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546894903] [2022-12-06 00:12:26,561 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1546894903] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:12:26,561 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:12:26,561 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:12:26,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891479311] [2022-12-06 00:12:26,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:12:26,561 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:12:26,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:12:26,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:12:26,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:12:26,562 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:12:26,562 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:12:26,562 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:12:26,562 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:12:26,562 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:12:26,961 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:12:26,961 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 00:12:26,969 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26969/27014 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13535 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:12:26,979 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:12:26,979 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:12:26,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:12:26,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:12:26,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:12:26,980 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:12:26,980 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:12:26,980 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:12:27,030 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:12:27,032 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:27,032 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:12:27,032 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:12:27,032 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:12:27,032 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:27,033 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:12:27,033 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:12:27,033 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:27,033 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:27,066 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:12:27,066 INFO L131 PetriNetUnfolder]: For 3146/3287 co-relation queries the response was YES. [2022-12-06 00:12:27,068 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3146/3287 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2990 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:12:27,071 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:27,071 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:12:27,254 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:12:27,254 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 222 [2022-12-06 00:12:27,254 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:12:27,255 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:12:27,255 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:12:27,255 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:12:27,255 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1100 [2022-12-06 00:12:27,255 INFO L420 AbstractCegarLoop]: === Iteration 1102 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:12:27,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:12:27,255 INFO L85 PathProgramCache]: Analyzing trace with hash -784792017, now seen corresponding path program 1 times [2022-12-06 00:12:27,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:12:27,255 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889554852] [2022-12-06 00:12:27,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:12:27,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:12:27,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:12:27,335 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-06 00:12:27,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:12:27,336 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889554852] [2022-12-06 00:12:27,336 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1889554852] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:12:27,336 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:12:27,336 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:12:27,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673423277] [2022-12-06 00:12:27,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:12:27,336 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:12:27,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:12:27,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:12:27,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:12:27,337 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:12:27,337 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:12:27,337 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:12:27,337 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:12:27,337 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:12:27,741 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:12:27,741 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:12:27,748 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13542 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:12:27,757 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:12:27,757 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:12:27,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:12:27,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:12:27,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:12:27,758 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:12:27,758 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:12:27,758 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:12:27,802 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:12:27,803 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:27,803 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:12:27,804 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:12:27,804 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:12:27,804 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:27,804 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:12:27,804 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:12:27,804 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:27,805 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:27,837 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:12:27,837 INFO L131 PetriNetUnfolder]: For 3301/3509 co-relation queries the response was YES. [2022-12-06 00:12:27,838 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3301/3509 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2997 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:12:27,841 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:27,841 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:12:28,051 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:12:28,051 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 247 [2022-12-06 00:12:28,052 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:12:28,052 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:12:28,052 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:12:28,052 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:12:28,052 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1101 [2022-12-06 00:12:28,052 INFO L420 AbstractCegarLoop]: === Iteration 1103 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:12:28,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:12:28,052 INFO L85 PathProgramCache]: Analyzing trace with hash 958018318, now seen corresponding path program 1 times [2022-12-06 00:12:28,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:12:28,052 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740115967] [2022-12-06 00:12:28,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:12:28,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:12:28,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:12:28,130 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-06 00:12:28,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:12:28,130 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740115967] [2022-12-06 00:12:28,130 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1740115967] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:12:28,130 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:12:28,130 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:12:28,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13998724] [2022-12-06 00:12:28,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:12:28,130 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:12:28,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:12:28,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:12:28,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:12:28,131 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:12:28,131 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:12:28,131 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:12:28,131 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:12:28,131 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:12:28,502 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:12:28,502 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 00:12:28,511 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13566 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:12:28,523 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:12:28,523 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:12:28,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:12:28,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:12:28,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:12:28,524 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:12:28,524 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:12:28,524 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:12:28,576 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:12:28,578 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:28,578 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:12:28,578 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:12:28,578 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:12:28,578 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:28,579 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:12:28,579 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:12:28,579 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:28,580 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:28,611 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:12:28,611 INFO L131 PetriNetUnfolder]: For 3308/3518 co-relation queries the response was YES. [2022-12-06 00:12:28,613 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3308/3518 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2973 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:12:28,615 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:28,616 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:12:28,800 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:12:28,801 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 223 [2022-12-06 00:12:28,801 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:12:28,801 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:12:28,801 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:12:28,801 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:12:28,801 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1102 [2022-12-06 00:12:28,801 INFO L420 AbstractCegarLoop]: === Iteration 1104 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:12:28,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:12:28,801 INFO L85 PathProgramCache]: Analyzing trace with hash -1594138643, now seen corresponding path program 1 times [2022-12-06 00:12:28,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:12:28,802 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605846188] [2022-12-06 00:12:28,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:12:28,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:12:28,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:12:28,880 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-06 00:12:28,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:12:28,880 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605846188] [2022-12-06 00:12:28,881 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [605846188] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:12:28,881 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:12:28,881 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:12:28,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580066932] [2022-12-06 00:12:28,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:12:28,881 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:12:28,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:12:28,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:12:28,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:12:28,881 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:12:28,881 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:12:28,882 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:12:28,882 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:12:28,882 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:12:29,238 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:12:29,238 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:12:29,247 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13552 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:12:29,257 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:12:29,258 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:12:29,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:12:29,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:12:29,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:12:29,259 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:12:29,259 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:12:29,259 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:12:29,310 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:12:29,312 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:29,312 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:12:29,312 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:12:29,312 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:12:29,312 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:29,313 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:12:29,313 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:12:29,313 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:29,313 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:29,345 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:12:29,346 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 00:12:29,347 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3312/3520 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2990 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:12:29,350 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:29,350 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:12:29,562 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:12:29,563 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 251 [2022-12-06 00:12:29,563 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:12:29,563 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:12:29,563 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:12:29,563 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:12:29,563 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1103 [2022-12-06 00:12:29,563 INFO L420 AbstractCegarLoop]: === Iteration 1105 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:12:29,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:12:29,563 INFO L85 PathProgramCache]: Analyzing trace with hash 148671692, now seen corresponding path program 1 times [2022-12-06 00:12:29,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:12:29,563 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835370253] [2022-12-06 00:12:29,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:12:29,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:12:29,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:12:29,643 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-06 00:12:29,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:12:29,643 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835370253] [2022-12-06 00:12:29,644 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1835370253] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:12:29,644 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:12:29,644 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:12:29,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945644738] [2022-12-06 00:12:29,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:12:29,644 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:12:29,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:12:29,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:12:29,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:12:29,644 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:12:29,644 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:12:29,644 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:12:29,644 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:12:29,644 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:12:30,021 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:12:30,021 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 00:12:30,028 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26965/27010 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13534 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:12:30,037 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:12:30,037 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:12:30,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:12:30,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:12:30,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:12:30,038 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:12:30,038 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:12:30,038 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:12:30,079 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:12:30,081 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:30,081 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:12:30,081 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:12:30,081 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:12:30,081 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:30,082 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:12:30,082 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:12:30,082 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:30,083 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:30,116 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:12:30,116 INFO L131 PetriNetUnfolder]: For 3146/3287 co-relation queries the response was YES. [2022-12-06 00:12:30,117 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3146/3287 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2956 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:12:30,119 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:30,119 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:12:30,315 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:12:30,316 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 235 [2022-12-06 00:12:30,316 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:12:30,316 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:12:30,316 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:12:30,316 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:12:30,316 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1104 [2022-12-06 00:12:30,316 INFO L420 AbstractCegarLoop]: === Iteration 1106 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:12:30,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:12:30,316 INFO L85 PathProgramCache]: Analyzing trace with hash 1891482027, now seen corresponding path program 1 times [2022-12-06 00:12:30,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:12:30,317 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733603928] [2022-12-06 00:12:30,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:12:30,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:12:30,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:12:30,395 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-06 00:12:30,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:12:30,395 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733603928] [2022-12-06 00:12:30,395 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1733603928] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:12:30,395 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:12:30,395 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:12:30,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702591138] [2022-12-06 00:12:30,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:12:30,396 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:12:30,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:12:30,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:12:30,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:12:30,396 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:12:30,396 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:12:30,396 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:12:30,396 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:12:30,396 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:12:30,760 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:12:30,760 INFO L131 PetriNetUnfolder]: For 27150/27195 co-relation queries the response was YES. [2022-12-06 00:12:30,768 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27150/27195 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13519 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:12:30,779 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:12:30,779 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:12:30,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:12:30,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:12:30,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:12:30,780 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:12:30,780 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:12:30,780 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:12:30,829 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:12:30,830 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:30,830 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:12:30,831 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:12:30,831 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:12:30,831 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:30,831 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:12:30,831 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:12:30,831 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:30,832 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:30,863 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:12:30,863 INFO L131 PetriNetUnfolder]: For 3167/3307 co-relation queries the response was YES. [2022-12-06 00:12:30,865 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3167/3307 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 3000 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:12:30,868 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:30,868 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:12:31,033 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:12:31,033 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 202 [2022-12-06 00:12:31,033 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:12:31,033 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:12:31,033 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:12:31,033 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:12:31,033 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1105 [2022-12-06 00:12:31,033 INFO L420 AbstractCegarLoop]: === Iteration 1107 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:12:31,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:12:31,034 INFO L85 PathProgramCache]: Analyzing trace with hash -660674934, now seen corresponding path program 1 times [2022-12-06 00:12:31,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:12:31,034 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137436508] [2022-12-06 00:12:31,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:12:31,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:12:31,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:12:31,100 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-06 00:12:31,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:12:31,100 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137436508] [2022-12-06 00:12:31,100 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1137436508] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:12:31,100 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:12:31,100 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:12:31,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084591125] [2022-12-06 00:12:31,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:12:31,101 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:12:31,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:12:31,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:12:31,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:12:31,101 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:12:31,101 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:12:31,101 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:12:31,101 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:12:31,101 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:12:31,469 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:12:31,469 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 00:12:31,477 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26965/27010 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13537 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:12:31,487 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:12:31,487 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:12:31,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:12:31,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:12:31,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:12:31,488 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:12:31,488 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:12:31,488 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:12:31,527 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:12:31,528 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:31,528 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:12:31,529 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:12:31,529 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:12:31,529 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:31,529 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:12:31,529 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:12:31,529 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:31,530 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:31,561 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:12:31,561 INFO L131 PetriNetUnfolder]: For 3122/3262 co-relation queries the response was YES. [2022-12-06 00:12:31,563 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3122/3262 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2977 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:12:31,566 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:31,566 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:12:31,735 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:12:31,736 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 207 [2022-12-06 00:12:31,736 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:12:31,736 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:12:31,736 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:12:31,736 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:12:31,736 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1106 [2022-12-06 00:12:31,736 INFO L420 AbstractCegarLoop]: === Iteration 1108 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:12:31,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:12:31,737 INFO L85 PathProgramCache]: Analyzing trace with hash 1082135401, now seen corresponding path program 1 times [2022-12-06 00:12:31,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:12:31,737 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584751433] [2022-12-06 00:12:31,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:12:31,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:12:31,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:12:31,814 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-06 00:12:31,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:12:31,814 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584751433] [2022-12-06 00:12:31,814 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1584751433] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:12:31,814 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:12:31,815 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:12:31,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414472404] [2022-12-06 00:12:31,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:12:31,815 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:12:31,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:12:31,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:12:31,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:12:31,815 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:12:31,815 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:12:31,815 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:12:31,815 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:12:31,815 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:12:32,212 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:12:32,212 INFO L131 PetriNetUnfolder]: For 27136/27181 co-relation queries the response was YES. [2022-12-06 00:12:32,219 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27136/27181 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13523 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:12:32,228 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:12:32,228 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:12:32,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:12:32,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:12:32,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:12:32,229 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:12:32,229 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:12:32,229 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:12:32,272 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:12:32,274 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:32,274 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:12:32,274 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:12:32,274 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:12:32,274 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:32,275 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:12:32,275 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:12:32,275 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:32,276 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:32,309 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:12:32,309 INFO L131 PetriNetUnfolder]: For 3156/3296 co-relation queries the response was YES. [2022-12-06 00:12:32,310 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3156/3296 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 3002 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:12:32,313 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:32,313 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:12:32,498 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:12:32,499 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 225 [2022-12-06 00:12:32,499 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:12:32,499 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:12:32,499 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:12:32,499 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:12:32,499 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1107 [2022-12-06 00:12:32,499 INFO L420 AbstractCegarLoop]: === Iteration 1109 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:12:32,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:12:32,500 INFO L85 PathProgramCache]: Analyzing trace with hash -1470021560, now seen corresponding path program 1 times [2022-12-06 00:12:32,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:12:32,500 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708303984] [2022-12-06 00:12:32,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:12:32,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:12:32,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:12:32,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-06 00:12:32,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:12:32,590 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708303984] [2022-12-06 00:12:32,591 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [708303984] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:12:32,591 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:12:32,591 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:12:32,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510811067] [2022-12-06 00:12:32,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:12:32,591 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:12:32,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:12:32,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:12:32,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:12:32,591 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:12:32,591 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:12:32,592 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:12:32,592 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:12:32,592 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:12:32,918 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:12:32,918 INFO L131 PetriNetUnfolder]: For 26955/27000 co-relation queries the response was YES. [2022-12-06 00:12:32,924 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26955/27000 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13518 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:12:32,932 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:12:32,932 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:12:32,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:12:32,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:12:32,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:12:32,933 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:12:32,933 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:12:32,933 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:12:32,976 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:12:32,978 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:32,978 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:12:32,978 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:12:32,978 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:12:32,978 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:32,979 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:12:32,979 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:12:32,979 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:32,980 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:33,006 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:12:33,006 INFO L131 PetriNetUnfolder]: For 3140/3283 co-relation queries the response was YES. [2022-12-06 00:12:33,008 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3140/3283 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2980 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:12:33,010 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:33,010 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:12:33,176 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:12:33,176 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 198 [2022-12-06 00:12:33,176 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:12:33,176 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:12:33,176 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:12:33,176 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:12:33,177 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1108 [2022-12-06 00:12:33,177 INFO L420 AbstractCegarLoop]: === Iteration 1110 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:12:33,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:12:33,177 INFO L85 PathProgramCache]: Analyzing trace with hash 272788775, now seen corresponding path program 1 times [2022-12-06 00:12:33,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:12:33,177 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662010868] [2022-12-06 00:12:33,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:12:33,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:12:33,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:12:33,271 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-06 00:12:33,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:12:33,271 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662010868] [2022-12-06 00:12:33,271 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1662010868] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:12:33,271 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:12:33,271 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:12:33,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252273179] [2022-12-06 00:12:33,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:12:33,271 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:12:33,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:12:33,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:12:33,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:12:33,272 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:12:33,272 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:12:33,272 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:12:33,272 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:12:33,272 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:12:33,557 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:12:33,557 INFO L131 PetriNetUnfolder]: For 26955/27000 co-relation queries the response was YES. [2022-12-06 00:12:33,562 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26955/27000 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13517 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:12:33,569 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:12:33,569 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:12:33,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:12:33,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:12:33,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:12:33,570 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:12:33,570 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:12:33,570 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:12:33,606 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:12:33,607 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:33,607 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:12:33,607 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:12:33,607 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:12:33,607 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:33,608 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:12:33,608 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:12:33,608 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:33,608 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:33,633 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:12:33,633 INFO L131 PetriNetUnfolder]: For 3123/3264 co-relation queries the response was YES. [2022-12-06 00:12:33,634 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3123/3264 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2975 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:12:33,636 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:33,636 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:12:33,802 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:12:33,802 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 195 [2022-12-06 00:12:33,802 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:12:33,802 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:12:33,803 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:12:33,803 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:12:33,803 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1109 [2022-12-06 00:12:33,803 INFO L420 AbstractCegarLoop]: === Iteration 1111 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:12:33,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:12:33,803 INFO L85 PathProgramCache]: Analyzing trace with hash 2015599110, now seen corresponding path program 1 times [2022-12-06 00:12:33,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:12:33,803 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585545890] [2022-12-06 00:12:33,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:12:33,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:12:33,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:12:33,870 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-06 00:12:33,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:12:33,870 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585545890] [2022-12-06 00:12:33,870 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [585545890] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:12:33,870 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:12:33,870 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:12:33,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793248909] [2022-12-06 00:12:33,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:12:33,870 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:12:33,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:12:33,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:12:33,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:12:33,871 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:12:33,871 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:12:33,871 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:12:33,871 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:12:33,871 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:12:34,163 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:12:34,164 INFO L131 PetriNetUnfolder]: For 27136/27181 co-relation queries the response was YES. [2022-12-06 00:12:34,168 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27136/27181 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13523 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:12:34,174 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:12:34,174 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:12:34,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:12:34,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:12:34,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:12:34,175 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:12:34,175 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:12:34,175 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:12:34,205 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:12:34,206 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:34,206 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:12:34,206 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:12:34,206 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:12:34,206 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:34,207 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:12:34,207 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:12:34,207 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:34,207 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:34,231 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:12:34,231 INFO L131 PetriNetUnfolder]: For 3167/3307 co-relation queries the response was YES. [2022-12-06 00:12:34,232 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3167/3307 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2982 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:12:34,234 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:34,234 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:12:34,382 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:12:34,383 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 177 [2022-12-06 00:12:34,383 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:12:34,383 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:12:34,383 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:12:34,383 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:12:34,383 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1110 [2022-12-06 00:12:34,383 INFO L420 AbstractCegarLoop]: === Iteration 1112 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:12:34,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:12:34,383 INFO L85 PathProgramCache]: Analyzing trace with hash -536557851, now seen corresponding path program 1 times [2022-12-06 00:12:34,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:12:34,384 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399227985] [2022-12-06 00:12:34,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:12:34,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:12:34,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:12:34,453 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-06 00:12:34,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:12:34,453 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399227985] [2022-12-06 00:12:34,453 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1399227985] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:12:34,453 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:12:34,453 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:12:34,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668323822] [2022-12-06 00:12:34,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:12:34,454 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:12:34,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:12:34,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:12:34,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:12:34,454 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:12:34,454 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:12:34,454 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:12:34,454 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:12:34,454 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:12:34,737 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:12:34,737 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:12:34,743 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13557 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:12:34,751 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:12:34,751 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:12:34,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:12:34,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:12:34,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:12:34,752 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:12:34,752 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:12:34,752 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:12:34,788 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:12:34,789 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:34,789 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:12:34,790 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:12:34,790 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:12:34,790 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:34,790 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:12:34,790 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:12:34,790 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:34,791 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:34,817 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:12:34,817 INFO L131 PetriNetUnfolder]: For 3301/3509 co-relation queries the response was YES. [2022-12-06 00:12:34,818 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3301/3509 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 3001 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:12:34,820 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:34,820 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:12:34,972 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:12:34,972 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 182 [2022-12-06 00:12:34,973 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:12:34,973 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:12:34,973 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:12:34,973 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:12:34,973 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1111 [2022-12-06 00:12:34,973 INFO L420 AbstractCegarLoop]: === Iteration 1113 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:12:34,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:12:34,973 INFO L85 PathProgramCache]: Analyzing trace with hash 1206252484, now seen corresponding path program 1 times [2022-12-06 00:12:34,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:12:34,973 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417584031] [2022-12-06 00:12:34,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:12:34,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:12:34,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:12:35,030 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-06 00:12:35,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:12:35,030 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417584031] [2022-12-06 00:12:35,031 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1417584031] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:12:35,031 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:12:35,031 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:12:35,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558378163] [2022-12-06 00:12:35,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:12:35,031 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:12:35,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:12:35,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:12:35,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:12:35,031 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:12:35,031 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:12:35,031 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:12:35,031 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:12:35,031 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:12:35,318 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:12:35,318 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 00:12:35,324 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13550 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:12:35,332 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:12:35,332 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:12:35,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:12:35,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:12:35,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:12:35,333 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:12:35,333 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:12:35,333 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:12:35,367 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:12:35,369 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:35,369 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:12:35,369 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:12:35,369 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:12:35,369 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:35,369 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:12:35,369 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:12:35,369 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:35,370 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:35,394 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:12:35,394 INFO L131 PetriNetUnfolder]: For 3338/3547 co-relation queries the response was YES. [2022-12-06 00:12:35,395 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3338/3547 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2975 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:12:35,397 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:35,397 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:12:35,554 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:12:35,554 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 185 [2022-12-06 00:12:35,554 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:12:35,554 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:12:35,554 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:12:35,554 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:12:35,554 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1112 [2022-12-06 00:12:35,554 INFO L420 AbstractCegarLoop]: === Iteration 1114 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:12:35,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:12:35,555 INFO L85 PathProgramCache]: Analyzing trace with hash -1345904477, now seen corresponding path program 1 times [2022-12-06 00:12:35,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:12:35,555 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980684744] [2022-12-06 00:12:35,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:12:35,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:12:35,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:12:35,617 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-06 00:12:35,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:12:35,618 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980684744] [2022-12-06 00:12:35,618 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1980684744] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:12:35,618 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:12:35,618 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:12:35,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654950533] [2022-12-06 00:12:35,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:12:35,618 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:12:35,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:12:35,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:12:35,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:12:35,618 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:12:35,619 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:12:35,619 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:12:35,619 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:12:35,619 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:12:35,926 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:12:35,926 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 00:12:35,931 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26965/27010 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13528 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:12:35,937 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:12:35,937 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:12:35,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:12:35,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:12:35,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:12:35,938 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:12:35,938 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:12:35,938 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:12:35,970 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:12:35,971 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:35,971 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:12:35,971 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:12:35,971 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:12:35,971 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:35,971 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:12:35,972 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:12:35,972 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:35,972 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:35,996 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:12:35,996 INFO L131 PetriNetUnfolder]: For 3123/3264 co-relation queries the response was YES. [2022-12-06 00:12:35,997 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3123/3264 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2966 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:12:35,998 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:35,998 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:12:36,150 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:12:36,151 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 180 [2022-12-06 00:12:36,151 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:12:36,151 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:12:36,151 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:12:36,151 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:12:36,151 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1113 [2022-12-06 00:12:36,151 INFO L420 AbstractCegarLoop]: === Iteration 1115 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:12:36,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:12:36,151 INFO L85 PathProgramCache]: Analyzing trace with hash 396905858, now seen corresponding path program 1 times [2022-12-06 00:12:36,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:12:36,151 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246133891] [2022-12-06 00:12:36,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:12:36,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:12:36,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:12:36,213 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-06 00:12:36,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:12:36,214 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246133891] [2022-12-06 00:12:36,214 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1246133891] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:12:36,214 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:12:36,214 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:12:36,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665610349] [2022-12-06 00:12:36,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:12:36,214 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:12:36,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:12:36,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:12:36,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:12:36,215 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:12:36,215 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:12:36,215 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:12:36,215 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:12:36,215 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:12:36,500 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:12:36,500 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:12:36,505 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13569 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:12:36,513 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:12:36,513 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:12:36,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:12:36,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:12:36,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:12:36,514 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:12:36,514 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:12:36,514 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:12:36,548 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:12:36,549 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:36,549 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:12:36,549 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:12:36,549 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:12:36,549 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:36,550 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:12:36,550 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:12:36,550 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:36,550 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:36,574 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:12:36,574 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 00:12:36,575 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3321/3530 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2977 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:12:36,577 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:36,577 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:12:36,733 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:12:36,734 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 185 [2022-12-06 00:12:36,734 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:12:36,734 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:12:36,734 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:12:36,734 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:12:36,734 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1114 [2022-12-06 00:12:36,734 INFO L420 AbstractCegarLoop]: === Iteration 1116 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:12:36,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:12:36,734 INFO L85 PathProgramCache]: Analyzing trace with hash 2139716193, now seen corresponding path program 1 times [2022-12-06 00:12:36,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:12:36,735 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120488424] [2022-12-06 00:12:36,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:12:36,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:12:36,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:12:36,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-06 00:12:36,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:12:36,802 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120488424] [2022-12-06 00:12:36,802 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [120488424] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:12:36,802 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:12:36,802 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:12:36,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374531671] [2022-12-06 00:12:36,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:12:36,802 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:12:36,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:12:36,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:12:36,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:12:36,803 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:12:36,803 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:12:36,803 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:12:36,803 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:12:36,803 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:12:37,086 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:12:37,086 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 00:12:37,092 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26965/27010 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13522 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:12:37,099 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:12:37,099 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:12:37,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:12:37,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:12:37,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:12:37,099 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:12:37,099 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:12:37,099 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:12:37,133 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:12:37,134 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:37,135 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:12:37,135 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:12:37,135 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:12:37,135 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:37,135 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:12:37,135 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:12:37,135 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:37,136 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:37,159 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:12:37,159 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 00:12:37,160 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3133/3273 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2982 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:12:37,162 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:37,162 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:12:37,304 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:12:37,304 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 169 [2022-12-06 00:12:37,304 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:12:37,304 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:12:37,304 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:12:37,304 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:12:37,304 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1115 [2022-12-06 00:12:37,304 INFO L420 AbstractCegarLoop]: === Iteration 1117 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:12:37,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:12:37,305 INFO L85 PathProgramCache]: Analyzing trace with hash -412440768, now seen corresponding path program 1 times [2022-12-06 00:12:37,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:12:37,305 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582859416] [2022-12-06 00:12:37,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:12:37,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:12:37,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:12:37,375 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-06 00:12:37,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:12:37,375 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582859416] [2022-12-06 00:12:37,375 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1582859416] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:12:37,375 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:12:37,375 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:12:37,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497019873] [2022-12-06 00:12:37,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:12:37,375 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:12:37,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:12:37,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:12:37,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:12:37,376 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:12:37,376 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:12:37,376 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:12:37,376 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:12:37,376 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:12:37,676 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:12:37,676 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 00:12:37,681 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26965/27010 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13533 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:12:37,686 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:12:37,687 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:12:37,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:12:37,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:12:37,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:12:37,687 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:12:37,687 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:12:37,687 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:12:37,720 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:12:37,721 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:37,721 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:12:37,722 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:12:37,722 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:12:37,722 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:37,722 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:12:37,722 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:12:37,722 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:37,723 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:37,746 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:12:37,746 INFO L131 PetriNetUnfolder]: For 3146/3287 co-relation queries the response was YES. [2022-12-06 00:12:37,747 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3146/3287 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2971 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:12:37,749 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:37,749 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:12:37,909 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:12:37,909 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 187 [2022-12-06 00:12:37,910 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:12:37,910 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:12:37,910 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:12:37,910 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:12:37,910 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1116 [2022-12-06 00:12:37,910 INFO L420 AbstractCegarLoop]: === Iteration 1118 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:12:37,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:12:37,910 INFO L85 PathProgramCache]: Analyzing trace with hash 1330369567, now seen corresponding path program 1 times [2022-12-06 00:12:37,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:12:37,910 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348182282] [2022-12-06 00:12:37,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:12:37,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:12:37,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:12:37,983 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-06 00:12:37,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:12:37,984 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348182282] [2022-12-06 00:12:37,984 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1348182282] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:12:37,984 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:12:37,984 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:12:37,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568236248] [2022-12-06 00:12:37,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:12:37,984 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:12:37,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:12:37,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:12:37,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:12:37,984 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:12:37,984 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:12:37,984 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:12:37,984 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:12:37,984 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:12:38,254 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:12:38,254 INFO L131 PetriNetUnfolder]: For 27229/27274 co-relation queries the response was YES. [2022-12-06 00:12:38,259 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27229/27274 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13558 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:12:38,266 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:12:38,266 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:12:38,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:12:38,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:12:38,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:12:38,267 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:12:38,267 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:12:38,267 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:12:38,301 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:12:38,302 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:38,302 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:12:38,302 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:12:38,302 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:12:38,302 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:38,303 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:12:38,303 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:12:38,303 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:38,303 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:38,327 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:12:38,328 INFO L131 PetriNetUnfolder]: For 3288/3497 co-relation queries the response was YES. [2022-12-06 00:12:38,328 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3288/3497 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2995 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:12:38,330 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:38,330 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:12:38,505 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:12:38,505 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 203 [2022-12-06 00:12:38,505 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:12:38,506 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:12:38,506 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:12:38,506 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:12:38,506 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1117 [2022-12-06 00:12:38,506 INFO L420 AbstractCegarLoop]: === Iteration 1119 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:12:38,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:12:38,506 INFO L85 PathProgramCache]: Analyzing trace with hash -1221787394, now seen corresponding path program 1 times [2022-12-06 00:12:38,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:12:38,506 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971318429] [2022-12-06 00:12:38,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:12:38,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:12:38,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:12:38,566 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-06 00:12:38,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:12:38,566 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971318429] [2022-12-06 00:12:38,566 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1971318429] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:12:38,566 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:12:38,566 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:12:38,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856159623] [2022-12-06 00:12:38,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:12:38,566 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:12:38,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:12:38,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:12:38,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:12:38,567 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:12:38,567 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:12:38,567 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:12:38,567 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:12:38,567 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:12:38,832 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:12:38,832 INFO L131 PetriNetUnfolder]: For 26955/27000 co-relation queries the response was YES. [2022-12-06 00:12:38,837 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26955/27000 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13511 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:12:38,844 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:12:38,844 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:12:38,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:12:38,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:12:38,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:12:38,845 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:12:38,845 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:12:38,845 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:12:38,879 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:12:38,880 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:38,881 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:12:38,881 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:12:38,881 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:12:38,881 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:38,881 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:12:38,881 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:12:38,881 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:38,882 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:38,905 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:12:38,905 INFO L131 PetriNetUnfolder]: For 3122/3262 co-relation queries the response was YES. [2022-12-06 00:12:38,906 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3122/3262 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2984 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:12:38,908 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:38,908 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:12:39,073 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:12:39,074 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 193 [2022-12-06 00:12:39,074 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:12:39,074 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:12:39,074 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:12:39,074 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:12:39,074 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1118 [2022-12-06 00:12:39,074 INFO L420 AbstractCegarLoop]: === Iteration 1120 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:12:39,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:12:39,074 INFO L85 PathProgramCache]: Analyzing trace with hash 521022941, now seen corresponding path program 1 times [2022-12-06 00:12:39,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:12:39,075 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981033316] [2022-12-06 00:12:39,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:12:39,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:12:39,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:12:39,143 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-06 00:12:39,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:12:39,143 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981033316] [2022-12-06 00:12:39,143 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1981033316] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:12:39,143 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:12:39,143 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:12:39,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132069546] [2022-12-06 00:12:39,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:12:39,144 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:12:39,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:12:39,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:12:39,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:12:39,144 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:12:39,144 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:12:39,144 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:12:39,144 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:12:39,144 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:12:39,439 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:12:39,439 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 00:12:39,444 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13569 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:12:39,450 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:12:39,450 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:12:39,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:12:39,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:12:39,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:12:39,451 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:12:39,451 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:12:39,451 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:12:39,482 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:12:39,483 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:39,483 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:12:39,483 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:12:39,484 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:12:39,484 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:39,484 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:12:39,484 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:12:39,484 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:39,485 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:39,509 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:12:39,509 INFO L131 PetriNetUnfolder]: For 3301/3509 co-relation queries the response was YES. [2022-12-06 00:12:39,510 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3301/3509 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2991 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:12:39,512 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:39,512 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:12:39,666 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:12:39,667 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 183 [2022-12-06 00:12:39,667 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:12:39,667 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:12:39,667 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:12:39,667 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:12:39,667 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1119 [2022-12-06 00:12:39,667 INFO L420 AbstractCegarLoop]: === Iteration 1121 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:12:39,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:12:39,667 INFO L85 PathProgramCache]: Analyzing trace with hash -2031134020, now seen corresponding path program 1 times [2022-12-06 00:12:39,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:12:39,667 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223298730] [2022-12-06 00:12:39,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:12:39,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:12:39,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:12:39,751 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-06 00:12:39,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:12:39,751 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223298730] [2022-12-06 00:12:39,751 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [223298730] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:12:39,751 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:12:39,751 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:12:39,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22445580] [2022-12-06 00:12:39,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:12:39,752 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:12:39,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:12:39,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:12:39,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:12:39,752 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:12:39,752 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:12:39,752 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:12:39,752 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:12:39,752 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:12:40,166 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:12:40,166 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 00:12:40,174 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26969/27014 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13516 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:12:40,184 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:12:40,184 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:12:40,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:12:40,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:12:40,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:12:40,185 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:12:40,185 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:12:40,185 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:12:40,231 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:12:40,233 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:40,233 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:12:40,233 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:12:40,233 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:12:40,233 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:40,234 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:12:40,234 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:12:40,234 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:40,234 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:40,268 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:12:40,269 INFO L131 PetriNetUnfolder]: For 3135/3276 co-relation queries the response was YES. [2022-12-06 00:12:40,271 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3135/3276 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2953 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:12:40,274 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:40,274 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:12:40,465 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:12:40,465 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 232 [2022-12-06 00:12:40,465 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:12:40,465 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:12:40,465 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:12:40,465 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:12:40,466 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1120 [2022-12-06 00:12:40,466 INFO L420 AbstractCegarLoop]: === Iteration 1122 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:12:40,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:12:40,466 INFO L85 PathProgramCache]: Analyzing trace with hash -288323685, now seen corresponding path program 1 times [2022-12-06 00:12:40,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:12:40,466 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846836948] [2022-12-06 00:12:40,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:12:40,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:12:40,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:12:40,554 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-06 00:12:40,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:12:40,554 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846836948] [2022-12-06 00:12:40,554 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [846836948] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:12:40,554 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:12:40,554 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:12:40,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107856325] [2022-12-06 00:12:40,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:12:40,554 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:12:40,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:12:40,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:12:40,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:12:40,555 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:12:40,555 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:12:40,555 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:12:40,555 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:12:40,555 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:12:40,958 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:12:40,959 INFO L131 PetriNetUnfolder]: For 26955/27000 co-relation queries the response was YES. [2022-12-06 00:12:40,966 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26955/27000 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13555 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:12:40,976 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:12:40,976 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:12:40,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:12:40,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:12:40,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:12:40,977 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:12:40,977 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:12:40,977 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:12:41,026 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:12:41,027 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:41,027 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:12:41,027 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:12:41,027 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:12:41,027 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:41,028 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:12:41,028 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:12:41,028 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:41,029 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:41,061 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:12:41,061 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 00:12:41,062 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3133/3273 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2975 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:12:41,065 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:41,065 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:12:41,245 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:12:41,245 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 218 [2022-12-06 00:12:41,245 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:12:41,245 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:12:41,245 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:12:41,245 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:12:41,246 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1121 [2022-12-06 00:12:41,246 INFO L420 AbstractCegarLoop]: === Iteration 1123 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:12:41,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:12:41,246 INFO L85 PathProgramCache]: Analyzing trace with hash 1454486650, now seen corresponding path program 1 times [2022-12-06 00:12:41,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:12:41,246 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267384959] [2022-12-06 00:12:41,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:12:41,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:12:41,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:12:41,432 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-06 00:12:41,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:12:41,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267384959] [2022-12-06 00:12:41,433 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1267384959] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:12:41,433 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:12:41,433 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:12:41,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638142379] [2022-12-06 00:12:41,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:12:41,433 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:12:41,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:12:41,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:12:41,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:12:41,434 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:12:41,434 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:12:41,434 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:12:41,434 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:12:41,434 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:12:41,825 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:12:41,825 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 00:12:41,834 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26969/27014 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13536 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:12:41,843 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:12:41,843 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:12:41,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:12:41,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:12:41,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:12:41,844 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:12:41,844 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:12:41,844 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:12:41,890 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:12:41,891 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:41,891 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:12:41,892 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:12:41,892 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:12:41,892 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:41,892 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:12:41,892 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:12:41,893 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:41,893 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:41,925 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:12:41,926 INFO L131 PetriNetUnfolder]: For 3134/3275 co-relation queries the response was YES. [2022-12-06 00:12:41,927 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3134/3275 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2961 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:12:41,930 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:41,930 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:12:42,117 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:12:42,118 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 226 [2022-12-06 00:12:42,118 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:12:42,118 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:12:42,118 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:12:42,118 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:12:42,118 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1122 [2022-12-06 00:12:42,118 INFO L420 AbstractCegarLoop]: === Iteration 1124 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:12:42,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:12:42,118 INFO L85 PathProgramCache]: Analyzing trace with hash -1097670311, now seen corresponding path program 1 times [2022-12-06 00:12:42,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:12:42,119 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112118318] [2022-12-06 00:12:42,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:12:42,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:12:42,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:12:42,213 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-06 00:12:42,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:12:42,214 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112118318] [2022-12-06 00:12:42,214 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [112118318] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:12:42,214 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:12:42,214 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:12:42,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420662681] [2022-12-06 00:12:42,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:12:42,214 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:12:42,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:12:42,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:12:42,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:12:42,215 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:12:42,215 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:12:42,215 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:12:42,215 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:12:42,215 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:12:42,582 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:12:42,583 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:12:42,590 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13537 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:12:42,601 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:12:42,601 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:12:42,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:12:42,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:12:42,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:12:42,602 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:12:42,602 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:12:42,602 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:12:42,652 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:12:42,653 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:42,653 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:12:42,654 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:12:42,654 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:12:42,654 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:42,654 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:12:42,654 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:12:42,654 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:42,655 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:42,687 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:12:42,688 INFO L131 PetriNetUnfolder]: For 3301/3509 co-relation queries the response was YES. [2022-12-06 00:12:42,689 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3301/3509 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 3003 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:12:42,692 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:42,692 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:12:42,889 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:12:42,890 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 236 [2022-12-06 00:12:42,890 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:12:42,890 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:12:42,890 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:12:42,890 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:12:42,890 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1123 [2022-12-06 00:12:42,890 INFO L420 AbstractCegarLoop]: === Iteration 1125 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:12:42,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:12:42,891 INFO L85 PathProgramCache]: Analyzing trace with hash 645140024, now seen corresponding path program 1 times [2022-12-06 00:12:42,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:12:42,891 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851356230] [2022-12-06 00:12:42,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:12:42,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:12:42,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:12:42,983 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-06 00:12:42,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:12:42,983 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851356230] [2022-12-06 00:12:42,983 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1851356230] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:12:42,984 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:12:42,984 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:12:42,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967160710] [2022-12-06 00:12:42,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:12:42,984 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:12:42,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:12:42,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:12:42,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:12:42,984 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:12:42,984 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:12:42,984 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:12:42,984 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:12:42,985 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:12:43,451 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:12:43,451 INFO L131 PetriNetUnfolder]: For 27219/27264 co-relation queries the response was YES. [2022-12-06 00:12:43,459 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27219/27264 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13563 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:12:43,469 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:12:43,469 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:12:43,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:12:43,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:12:43,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:12:43,470 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:12:43,470 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:12:43,470 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:12:43,517 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:12:43,519 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:43,519 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:12:43,519 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:12:43,519 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:12:43,519 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:43,520 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:12:43,520 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:12:43,520 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:43,521 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:43,553 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:12:43,553 INFO L131 PetriNetUnfolder]: For 3338/3547 co-relation queries the response was YES. [2022-12-06 00:12:43,554 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3338/3547 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2979 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:12:43,557 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:43,557 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:12:43,772 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:12:43,772 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 253 [2022-12-06 00:12:43,772 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:12:43,772 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:12:43,773 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:12:43,773 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:12:43,773 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1124 [2022-12-06 00:12:43,773 INFO L420 AbstractCegarLoop]: === Iteration 1126 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:12:43,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:12:43,773 INFO L85 PathProgramCache]: Analyzing trace with hash -1907016937, now seen corresponding path program 1 times [2022-12-06 00:12:43,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:12:43,773 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453724864] [2022-12-06 00:12:43,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:12:43,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:12:43,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:12:43,863 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-06 00:12:43,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:12:43,863 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453724864] [2022-12-06 00:12:43,863 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1453724864] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:12:43,863 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:12:43,863 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:12:43,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656041692] [2022-12-06 00:12:43,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:12:43,864 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:12:43,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:12:43,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:12:43,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:12:43,864 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:12:43,864 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:12:43,864 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:12:43,864 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:12:43,864 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:12:44,273 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:12:44,273 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:12:44,281 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13567 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:12:44,290 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:12:44,290 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:12:44,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:12:44,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:12:44,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:12:44,291 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:12:44,291 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:12:44,291 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:12:44,337 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:12:44,339 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:44,339 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:12:44,339 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:12:44,339 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:12:44,339 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:44,340 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:12:44,340 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:12:44,340 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:44,341 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:44,375 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:12:44,376 INFO L131 PetriNetUnfolder]: For 3298/3507 co-relation queries the response was YES. [2022-12-06 00:12:44,377 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3298/3507 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2996 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:12:44,380 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:44,380 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:12:44,556 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:12:44,556 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 217 [2022-12-06 00:12:44,556 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:12:44,556 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:12:44,556 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:12:44,556 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:12:44,557 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1125 [2022-12-06 00:12:44,557 INFO L420 AbstractCegarLoop]: === Iteration 1127 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:12:44,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:12:44,557 INFO L85 PathProgramCache]: Analyzing trace with hash -164206602, now seen corresponding path program 1 times [2022-12-06 00:12:44,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:12:44,557 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29252165] [2022-12-06 00:12:44,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:12:44,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:12:44,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:12:44,649 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-06 00:12:44,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:12:44,650 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29252165] [2022-12-06 00:12:44,650 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [29252165] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:12:44,650 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:12:44,650 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:12:44,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932416792] [2022-12-06 00:12:44,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:12:44,650 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:12:44,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:12:44,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:12:44,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:12:44,651 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:12:44,651 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:12:44,651 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:12:44,651 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:12:44,651 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:12:45,022 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:12:45,023 INFO L131 PetriNetUnfolder]: For 26955/27000 co-relation queries the response was YES. [2022-12-06 00:12:45,035 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26955/27000 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13522 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:12:45,046 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:12:45,046 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:12:45,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:12:45,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:12:45,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:12:45,047 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:12:45,047 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:12:45,047 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:12:45,099 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:12:45,101 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:45,101 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:12:45,101 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:12:45,101 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:12:45,101 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:45,102 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:12:45,102 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:12:45,102 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:45,103 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:45,134 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:12:45,135 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 00:12:45,136 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3133/3273 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2967 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:12:45,139 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:45,139 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:12:45,325 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:12:45,325 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 224 [2022-12-06 00:12:45,325 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:12:45,325 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:12:45,326 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:12:45,326 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:12:45,326 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1126 [2022-12-06 00:12:45,326 INFO L420 AbstractCegarLoop]: === Iteration 1128 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:12:45,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:12:45,326 INFO L85 PathProgramCache]: Analyzing trace with hash 1578603733, now seen corresponding path program 1 times [2022-12-06 00:12:45,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:12:45,326 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207913870] [2022-12-06 00:12:45,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:12:45,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:12:45,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:12:45,417 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-06 00:12:45,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:12:45,417 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207913870] [2022-12-06 00:12:45,417 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1207913870] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:12:45,417 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:12:45,417 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:12:45,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43997430] [2022-12-06 00:12:45,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:12:45,418 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:12:45,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:12:45,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:12:45,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:12:45,418 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:12:45,418 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:12:45,418 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:12:45,418 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:12:45,418 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:12:45,790 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:12:45,790 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 00:12:45,798 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26969/27014 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13506 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:12:45,808 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:12:45,808 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:12:45,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:12:45,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:12:45,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:12:45,809 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:12:45,809 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:12:45,809 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:12:45,862 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:12:45,863 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:45,864 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:12:45,864 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:12:45,864 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:12:45,864 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:45,864 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:12:45,864 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:12:45,865 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:45,865 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:45,899 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:12:45,899 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 00:12:45,900 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3133/3273 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2964 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:12:45,903 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:45,903 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:12:46,080 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:12:46,081 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 217 [2022-12-06 00:12:46,081 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:12:46,081 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:12:46,081 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:12:46,081 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:12:46,081 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1127 [2022-12-06 00:12:46,081 INFO L420 AbstractCegarLoop]: === Iteration 1129 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:12:46,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:12:46,081 INFO L85 PathProgramCache]: Analyzing trace with hash -973553228, now seen corresponding path program 1 times [2022-12-06 00:12:46,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:12:46,082 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547185251] [2022-12-06 00:12:46,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:12:46,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:12:46,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:12:46,166 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-06 00:12:46,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:12:46,166 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547185251] [2022-12-06 00:12:46,166 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [547185251] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:12:46,167 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:12:46,167 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:12:46,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066928266] [2022-12-06 00:12:46,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:12:46,167 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:12:46,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:12:46,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:12:46,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:12:46,167 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:12:46,167 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:12:46,167 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:12:46,168 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:12:46,168 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:12:46,622 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:12:46,623 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:12:46,630 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13558 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:12:46,640 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:12:46,640 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:12:46,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:12:46,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:12:46,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:12:46,641 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:12:46,641 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:12:46,641 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:12:46,689 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:12:46,690 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:46,690 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:12:46,690 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:12:46,690 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:12:46,691 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:46,691 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:12:46,691 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:12:46,691 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:46,692 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:46,725 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:12:46,725 INFO L131 PetriNetUnfolder]: For 3348/3558 co-relation queries the response was YES. [2022-12-06 00:12:46,726 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3348/3558 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2993 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:12:46,729 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:46,729 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:12:46,918 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:12:46,918 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 228 [2022-12-06 00:12:46,918 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:12:46,918 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:12:46,919 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:12:46,919 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:12:46,919 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1128 [2022-12-06 00:12:46,919 INFO L420 AbstractCegarLoop]: === Iteration 1130 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:12:46,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:12:46,919 INFO L85 PathProgramCache]: Analyzing trace with hash 769257107, now seen corresponding path program 1 times [2022-12-06 00:12:46,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:12:46,919 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639254382] [2022-12-06 00:12:46,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:12:46,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:12:46,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:12:47,000 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-06 00:12:47,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:12:47,000 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639254382] [2022-12-06 00:12:47,001 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1639254382] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:12:47,001 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:12:47,001 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:12:47,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945173256] [2022-12-06 00:12:47,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:12:47,001 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:12:47,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:12:47,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:12:47,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:12:47,001 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:12:47,001 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:12:47,002 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:12:47,002 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:12:47,002 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:12:47,363 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:12:47,363 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:12:47,371 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13568 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:12:47,382 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:12:47,382 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:12:47,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:12:47,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:12:47,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:12:47,383 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:12:47,383 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:12:47,383 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:12:47,432 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:12:47,433 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:47,433 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:12:47,433 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:12:47,433 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:12:47,434 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:47,434 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:12:47,434 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:12:47,434 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:47,435 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:47,467 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:12:47,467 INFO L131 PetriNetUnfolder]: For 3298/3507 co-relation queries the response was YES. [2022-12-06 00:12:47,471 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3298/3507 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2975 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:12:47,474 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:47,474 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:12:47,657 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:12:47,657 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 224 [2022-12-06 00:12:47,657 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:12:47,657 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:12:47,657 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:12:47,657 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:12:47,658 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1129 [2022-12-06 00:12:47,658 INFO L420 AbstractCegarLoop]: === Iteration 1131 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:12:47,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:12:47,658 INFO L85 PathProgramCache]: Analyzing trace with hash -1782899854, now seen corresponding path program 1 times [2022-12-06 00:12:47,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:12:47,658 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883993159] [2022-12-06 00:12:47,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:12:47,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:12:47,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:12:47,744 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-06 00:12:47,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:12:47,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883993159] [2022-12-06 00:12:47,744 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1883993159] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:12:47,744 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:12:47,744 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:12:47,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221016677] [2022-12-06 00:12:47,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:12:47,745 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:12:47,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:12:47,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:12:47,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:12:47,745 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:12:47,745 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:12:47,745 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:12:47,745 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:12:47,745 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:12:48,114 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:12:48,115 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:12:48,123 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13559 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:12:48,133 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:12:48,133 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:12:48,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:12:48,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:12:48,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:12:48,134 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:12:48,134 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:12:48,134 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:12:48,184 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:12:48,186 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:48,186 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:12:48,186 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:12:48,186 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:12:48,186 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:48,187 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:12:48,187 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:12:48,187 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:48,188 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:48,219 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:12:48,219 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 00:12:48,220 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3312/3520 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2988 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:12:48,224 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:48,224 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:12:48,413 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:12:48,413 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 227 [2022-12-06 00:12:48,413 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:12:48,413 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:12:48,413 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:12:48,414 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:12:48,414 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1130 [2022-12-06 00:12:48,414 INFO L420 AbstractCegarLoop]: === Iteration 1132 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:12:48,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:12:48,414 INFO L85 PathProgramCache]: Analyzing trace with hash -40089519, now seen corresponding path program 1 times [2022-12-06 00:12:48,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:12:48,414 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730066056] [2022-12-06 00:12:48,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:12:48,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:12:48,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:12:48,495 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-06 00:12:48,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:12:48,495 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730066056] [2022-12-06 00:12:48,496 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1730066056] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:12:48,496 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:12:48,496 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:12:48,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497614597] [2022-12-06 00:12:48,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:12:48,496 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:12:48,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:12:48,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:12:48,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:12:48,496 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:12:48,496 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:12:48,497 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:12:48,497 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:12:48,497 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:12:48,916 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:12:48,917 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 00:12:48,924 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26969/27014 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13554 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:12:48,933 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:12:48,933 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:12:48,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:12:48,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:12:48,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:12:48,934 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:12:48,934 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:12:48,934 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:12:48,980 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:12:48,981 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:48,982 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:12:48,982 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:12:48,982 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:12:48,982 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:48,982 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:12:48,982 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:12:48,983 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:48,983 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:49,017 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:12:49,018 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 00:12:49,019 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3133/3273 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2986 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:12:49,022 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:49,022 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:12:49,207 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:12:49,208 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 226 [2022-12-06 00:12:49,208 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:12:49,208 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:12:49,208 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:12:49,208 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:12:49,208 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1131 [2022-12-06 00:12:49,208 INFO L420 AbstractCegarLoop]: === Iteration 1133 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:12:49,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:12:49,208 INFO L85 PathProgramCache]: Analyzing trace with hash 1702720816, now seen corresponding path program 1 times [2022-12-06 00:12:49,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:12:49,209 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681291374] [2022-12-06 00:12:49,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:12:49,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:12:49,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:12:49,290 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-06 00:12:49,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:12:49,291 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681291374] [2022-12-06 00:12:49,291 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1681291374] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:12:49,291 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:12:49,291 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:12:49,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337708671] [2022-12-06 00:12:49,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:12:49,291 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:12:49,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:12:49,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:12:49,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:12:49,292 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:12:49,292 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:12:49,292 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:12:49,292 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:12:49,292 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:12:49,659 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:12:49,660 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:12:49,669 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13537 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:12:49,679 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:12:49,679 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:12:49,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:12:49,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:12:49,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:12:49,680 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:12:49,680 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:12:49,680 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:12:49,731 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:12:49,733 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:49,733 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:12:49,733 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:12:49,733 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:12:49,733 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:49,734 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:12:49,734 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:12:49,734 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:49,735 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:49,768 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:12:49,768 INFO L131 PetriNetUnfolder]: For 3327/3536 co-relation queries the response was YES. [2022-12-06 00:12:49,770 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3327/3536 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2991 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:12:49,773 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:49,773 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:12:49,968 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:12:49,969 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 236 [2022-12-06 00:12:49,969 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:12:49,969 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:12:49,969 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:12:49,969 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:12:49,969 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1132 [2022-12-06 00:12:49,969 INFO L420 AbstractCegarLoop]: === Iteration 1134 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:12:49,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:12:49,969 INFO L85 PathProgramCache]: Analyzing trace with hash -849436145, now seen corresponding path program 1 times [2022-12-06 00:12:49,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:12:49,970 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189070557] [2022-12-06 00:12:49,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:12:49,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:12:49,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:12:50,063 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-06 00:12:50,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:12:50,064 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189070557] [2022-12-06 00:12:50,064 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [189070557] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:12:50,064 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:12:50,064 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:12:50,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92355235] [2022-12-06 00:12:50,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:12:50,064 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:12:50,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:12:50,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:12:50,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:12:50,065 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:12:50,065 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:12:50,065 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:12:50,065 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:12:50,065 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:12:50,441 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:12:50,441 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:12:50,452 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13531 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:12:50,462 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:12:50,462 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:12:50,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:12:50,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:12:50,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:12:50,463 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:12:50,463 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:12:50,463 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:12:50,511 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:12:50,513 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:50,513 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:12:50,513 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:12:50,513 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:12:50,513 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:50,514 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:12:50,514 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:12:50,514 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:50,515 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:50,547 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:12:50,547 INFO L131 PetriNetUnfolder]: For 3304/3511 co-relation queries the response was YES. [2022-12-06 00:12:50,548 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3304/3511 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2996 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:12:50,551 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:50,551 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:12:50,726 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:12:50,727 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 214 [2022-12-06 00:12:50,727 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:12:50,727 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:12:50,727 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:12:50,727 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:12:50,727 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1133 [2022-12-06 00:12:50,727 INFO L420 AbstractCegarLoop]: === Iteration 1135 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:12:50,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:12:50,727 INFO L85 PathProgramCache]: Analyzing trace with hash 893374190, now seen corresponding path program 1 times [2022-12-06 00:12:50,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:12:50,728 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857822435] [2022-12-06 00:12:50,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:12:50,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:12:50,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:12:50,821 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-06 00:12:50,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:12:50,822 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857822435] [2022-12-06 00:12:50,822 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1857822435] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:12:50,822 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:12:50,822 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:12:50,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83800258] [2022-12-06 00:12:50,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:12:50,822 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:12:50,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:12:50,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:12:50,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:12:50,823 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:12:50,823 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:12:50,823 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:12:50,823 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:12:50,823 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:12:51,241 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:12:51,241 INFO L131 PetriNetUnfolder]: For 27146/27191 co-relation queries the response was YES. [2022-12-06 00:12:51,249 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27146/27191 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13538 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:12:51,258 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:12:51,258 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:12:51,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:12:51,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:12:51,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:12:51,259 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:12:51,259 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:12:51,259 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:12:51,306 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:12:51,308 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:51,308 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:12:51,308 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:12:51,308 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:12:51,308 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:51,309 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:12:51,309 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:12:51,309 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:51,309 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:51,341 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:12:51,341 INFO L131 PetriNetUnfolder]: For 3168/3309 co-relation queries the response was YES. [2022-12-06 00:12:51,343 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3168/3309 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2998 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:12:51,345 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:51,345 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:12:51,555 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:12:51,555 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 247 [2022-12-06 00:12:51,555 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:12:51,556 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:12:51,556 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:12:51,556 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:12:51,556 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1134 [2022-12-06 00:12:51,556 INFO L420 AbstractCegarLoop]: === Iteration 1136 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:12:51,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:12:51,556 INFO L85 PathProgramCache]: Analyzing trace with hash -1658782771, now seen corresponding path program 1 times [2022-12-06 00:12:51,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:12:51,556 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138726976] [2022-12-06 00:12:51,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:12:51,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:12:51,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:12:51,635 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-06 00:12:51,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:12:51,635 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138726976] [2022-12-06 00:12:51,635 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1138726976] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:12:51,635 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:12:51,635 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:12:51,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114114081] [2022-12-06 00:12:51,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:12:51,636 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:12:51,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:12:51,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:12:51,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:12:51,636 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:12:51,636 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:12:51,636 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:12:51,636 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:12:51,636 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:12:52,009 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:12:52,009 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 00:12:52,018 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26969/27014 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13540 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:12:52,029 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:12:52,029 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:12:52,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:12:52,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:12:52,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:12:52,030 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:12:52,030 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:12:52,030 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:12:52,080 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:12:52,081 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:52,081 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:12:52,082 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:12:52,082 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:12:52,082 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:52,082 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:12:52,082 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:12:52,082 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:52,083 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:52,115 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:12:52,116 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 00:12:52,117 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3133/3273 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2984 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:12:52,120 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:52,120 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:12:52,298 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:12:52,299 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 217 [2022-12-06 00:12:52,299 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:12:52,299 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:12:52,299 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:12:52,299 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:12:52,299 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1135 [2022-12-06 00:12:52,299 INFO L420 AbstractCegarLoop]: === Iteration 1137 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:12:52,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:12:52,299 INFO L85 PathProgramCache]: Analyzing trace with hash 84027564, now seen corresponding path program 1 times [2022-12-06 00:12:52,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:12:52,300 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119212552] [2022-12-06 00:12:52,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:12:52,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:12:52,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:12:52,391 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-06 00:12:52,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:12:52,391 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119212552] [2022-12-06 00:12:52,391 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [119212552] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:12:52,391 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:12:52,391 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:12:52,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865157648] [2022-12-06 00:12:52,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:12:52,392 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:12:52,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:12:52,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:12:52,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:12:52,392 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:12:52,392 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:12:52,392 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:12:52,392 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:12:52,392 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:12:52,753 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:12:52,754 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:12:52,762 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13560 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:12:52,772 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:12:52,772 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:12:52,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:12:52,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:12:52,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:12:52,773 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:12:52,773 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:12:52,773 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:12:52,823 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:12:52,824 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:52,824 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:12:52,824 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:12:52,824 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:12:52,824 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:52,825 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:12:52,825 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:12:52,825 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:52,826 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:52,860 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:12:52,860 INFO L131 PetriNetUnfolder]: For 3348/3558 co-relation queries the response was YES. [2022-12-06 00:12:52,861 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3348/3558 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2990 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:12:52,864 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:52,864 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:12:53,055 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:12:53,056 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 232 [2022-12-06 00:12:53,056 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:12:53,056 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:12:53,056 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:12:53,056 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:12:53,056 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1136 [2022-12-06 00:12:53,056 INFO L420 AbstractCegarLoop]: === Iteration 1138 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:12:53,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:12:53,057 INFO L85 PathProgramCache]: Analyzing trace with hash 1826837899, now seen corresponding path program 1 times [2022-12-06 00:12:53,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:12:53,057 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026752382] [2022-12-06 00:12:53,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:12:53,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:12:53,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:12:53,153 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-06 00:12:53,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:12:53,153 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026752382] [2022-12-06 00:12:53,153 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2026752382] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:12:53,153 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:12:53,153 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:12:53,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078874626] [2022-12-06 00:12:53,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:12:53,154 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:12:53,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:12:53,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:12:53,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:12:53,154 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:12:53,154 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:12:53,154 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:12:53,154 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:12:53,154 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:12:53,564 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:12:53,565 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:12:53,572 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13562 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:12:53,583 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:12:53,583 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:12:53,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:12:53,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:12:53,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:12:53,584 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:12:53,584 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:12:53,584 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:12:53,629 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:12:53,631 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:53,631 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:12:53,631 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:12:53,631 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:12:53,631 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:53,632 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:12:53,632 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:12:53,632 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:53,632 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:53,665 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:12:53,665 INFO L131 PetriNetUnfolder]: For 3301/3509 co-relation queries the response was YES. [2022-12-06 00:12:53,667 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3301/3509 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2986 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:12:53,670 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:53,670 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:12:53,856 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:12:53,857 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 226 [2022-12-06 00:12:53,857 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:12:53,857 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:12:53,857 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:12:53,857 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:12:53,857 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1137 [2022-12-06 00:12:53,857 INFO L420 AbstractCegarLoop]: === Iteration 1139 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:12:53,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:12:53,858 INFO L85 PathProgramCache]: Analyzing trace with hash -725319062, now seen corresponding path program 1 times [2022-12-06 00:12:53,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:12:53,858 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752813174] [2022-12-06 00:12:53,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:12:53,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:12:53,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:12:53,949 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-06 00:12:53,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:12:53,949 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752813174] [2022-12-06 00:12:53,949 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1752813174] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:12:53,949 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:12:53,949 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:12:53,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406069790] [2022-12-06 00:12:53,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:12:53,949 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:12:53,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:12:53,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:12:53,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:12:53,950 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:12:53,950 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:12:53,950 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:12:53,950 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:12:53,950 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:12:54,374 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:12:54,374 INFO L131 PetriNetUnfolder]: For 27136/27181 co-relation queries the response was YES. [2022-12-06 00:12:54,383 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27136/27181 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13535 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:12:54,393 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:12:54,393 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:12:54,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:12:54,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:12:54,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:12:54,394 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:12:54,394 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:12:54,394 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:12:54,442 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:12:54,443 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:54,443 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:12:54,444 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:12:54,444 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:12:54,444 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:54,444 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:12:54,444 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:12:54,444 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:54,445 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:54,480 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:12:54,480 INFO L131 PetriNetUnfolder]: For 3157/3298 co-relation queries the response was YES. [2022-12-06 00:12:54,482 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3157/3298 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 3000 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:12:54,484 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:54,484 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:12:54,665 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:12:54,665 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 221 [2022-12-06 00:12:54,665 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:12:54,665 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:12:54,665 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:12:54,666 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:12:54,666 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1138 [2022-12-06 00:12:54,666 INFO L420 AbstractCegarLoop]: === Iteration 1140 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:12:54,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:12:54,666 INFO L85 PathProgramCache]: Analyzing trace with hash 1017491273, now seen corresponding path program 1 times [2022-12-06 00:12:54,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:12:54,666 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321532161] [2022-12-06 00:12:54,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:12:54,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:12:54,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:12:54,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-06 00:12:54,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:12:54,746 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321532161] [2022-12-06 00:12:54,746 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [321532161] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:12:54,746 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:12:54,746 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:12:54,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430015296] [2022-12-06 00:12:54,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:12:54,746 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:12:54,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:12:54,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:12:54,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:12:54,746 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:12:54,747 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:12:54,747 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:12:54,747 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:12:54,747 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:12:55,107 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:12:55,107 INFO L131 PetriNetUnfolder]: For 27136/27181 co-relation queries the response was YES. [2022-12-06 00:12:55,115 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27136/27181 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13532 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:12:55,126 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:12:55,126 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:12:55,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:12:55,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:12:55,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:12:55,127 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:12:55,127 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:12:55,127 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:12:55,175 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:12:55,176 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:55,176 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:12:55,176 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:12:55,176 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:12:55,176 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:55,177 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:12:55,177 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:12:55,177 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:55,178 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:55,210 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:12:55,210 INFO L131 PetriNetUnfolder]: For 3167/3307 co-relation queries the response was YES. [2022-12-06 00:12:55,212 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3167/3307 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2994 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:12:55,215 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:55,215 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:12:55,398 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:12:55,398 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 222 [2022-12-06 00:12:55,399 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:12:55,399 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:12:55,399 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:12:55,399 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:12:55,399 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1139 [2022-12-06 00:12:55,399 INFO L420 AbstractCegarLoop]: === Iteration 1141 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:12:55,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:12:55,399 INFO L85 PathProgramCache]: Analyzing trace with hash -1534665688, now seen corresponding path program 1 times [2022-12-06 00:12:55,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:12:55,399 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390094748] [2022-12-06 00:12:55,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:12:55,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:12:55,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:12:55,480 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-06 00:12:55,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:12:55,480 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390094748] [2022-12-06 00:12:55,480 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1390094748] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:12:55,480 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:12:55,480 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:12:55,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594114617] [2022-12-06 00:12:55,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:12:55,481 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:12:55,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:12:55,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:12:55,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:12:55,481 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:12:55,481 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:12:55,481 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:12:55,481 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:12:55,481 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:12:55,884 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:12:55,885 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 00:12:55,891 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26965/27010 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13514 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:12:55,902 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:12:55,902 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:12:55,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:12:55,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:12:55,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:12:55,903 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:12:55,903 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:12:55,903 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:12:55,951 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:12:55,952 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:55,953 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:12:55,953 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:12:55,953 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:12:55,953 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:55,953 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:12:55,953 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:12:55,954 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:55,954 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:55,988 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:12:55,988 INFO L131 PetriNetUnfolder]: For 3146/3287 co-relation queries the response was YES. [2022-12-06 00:12:55,990 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3146/3287 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2968 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:12:55,992 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:55,992 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:12:56,183 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:12:56,183 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 230 [2022-12-06 00:12:56,184 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:12:56,184 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:12:56,184 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:12:56,184 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:12:56,184 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1140 [2022-12-06 00:12:56,184 INFO L420 AbstractCegarLoop]: === Iteration 1142 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:12:56,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:12:56,184 INFO L85 PathProgramCache]: Analyzing trace with hash 208144647, now seen corresponding path program 1 times [2022-12-06 00:12:56,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:12:56,184 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087183514] [2022-12-06 00:12:56,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:12:56,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:12:56,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:12:56,270 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-06 00:12:56,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:12:56,271 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087183514] [2022-12-06 00:12:56,271 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2087183514] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:12:56,271 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:12:56,271 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:12:56,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813029969] [2022-12-06 00:12:56,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:12:56,271 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:12:56,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:12:56,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:12:56,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:12:56,272 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:12:56,272 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:12:56,272 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:12:56,272 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:12:56,272 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:12:56,642 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:12:56,642 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:12:56,650 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13569 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:12:56,660 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:12:56,661 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:12:56,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:12:56,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:12:56,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:12:56,661 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:12:56,661 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:12:56,662 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:12:56,711 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:12:56,712 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:56,713 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:12:56,713 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:12:56,713 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:12:56,713 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:56,713 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:12:56,713 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:12:56,714 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:56,714 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:56,746 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:12:56,746 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 00:12:56,748 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3312/3520 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2978 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:12:56,751 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:56,751 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:12:56,946 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:12:56,947 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 234 [2022-12-06 00:12:56,947 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:12:56,947 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:12:56,947 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:12:56,947 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:12:56,947 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1141 [2022-12-06 00:12:56,947 INFO L420 AbstractCegarLoop]: === Iteration 1143 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:12:56,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:12:56,948 INFO L85 PathProgramCache]: Analyzing trace with hash 1950954982, now seen corresponding path program 1 times [2022-12-06 00:12:56,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:12:56,948 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722464010] [2022-12-06 00:12:56,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:12:56,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:12:56,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:12:57,048 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-06 00:12:57,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:12:57,048 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722464010] [2022-12-06 00:12:57,048 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [722464010] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:12:57,048 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:12:57,048 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:12:57,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167770543] [2022-12-06 00:12:57,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:12:57,049 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:12:57,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:12:57,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:12:57,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:12:57,049 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:12:57,049 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:12:57,049 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:12:57,049 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:12:57,049 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:12:57,434 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:12:57,434 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:12:57,442 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13576 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:12:57,453 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:12:57,453 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:12:57,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:12:57,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:12:57,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:12:57,454 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:12:57,454 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:12:57,454 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:12:57,502 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:12:57,504 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:57,504 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:12:57,504 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:12:57,504 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:12:57,504 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:57,505 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:12:57,505 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:12:57,505 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:57,506 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:57,539 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:12:57,539 INFO L131 PetriNetUnfolder]: For 3297/3507 co-relation queries the response was YES. [2022-12-06 00:12:57,540 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3297/3507 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2993 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:12:57,543 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:57,543 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:12:57,723 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:12:57,723 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 219 [2022-12-06 00:12:57,723 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:12:57,724 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:12:57,724 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:12:57,724 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:12:57,724 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1142 [2022-12-06 00:12:57,724 INFO L420 AbstractCegarLoop]: === Iteration 1144 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:12:57,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:12:57,724 INFO L85 PathProgramCache]: Analyzing trace with hash -601201979, now seen corresponding path program 1 times [2022-12-06 00:12:57,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:12:57,724 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3862494] [2022-12-06 00:12:57,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:12:57,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:12:57,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:12:57,814 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-06 00:12:57,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:12:57,815 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3862494] [2022-12-06 00:12:57,815 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [3862494] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:12:57,815 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:12:57,815 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:12:57,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777717986] [2022-12-06 00:12:57,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:12:57,815 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:12:57,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:12:57,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:12:57,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:12:57,816 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:12:57,816 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:12:57,816 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:12:57,816 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:12:57,816 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:12:58,228 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:12:58,228 INFO L131 PetriNetUnfolder]: For 26955/27000 co-relation queries the response was YES. [2022-12-06 00:12:58,235 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26955/27000 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13527 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:12:58,243 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:12:58,244 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:12:58,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:12:58,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:12:58,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:12:58,245 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:12:58,245 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:12:58,245 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:12:58,289 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:12:58,291 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:58,291 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:12:58,291 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:12:58,292 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:12:58,292 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:58,292 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:12:58,292 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:12:58,292 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:58,293 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:58,325 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:12:58,325 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 00:12:58,326 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3133/3273 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2976 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:12:58,329 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:58,329 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:12:58,514 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:12:58,515 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 224 [2022-12-06 00:12:58,515 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:12:58,515 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:12:58,515 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:12:58,515 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:12:58,515 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1143 [2022-12-06 00:12:58,515 INFO L420 AbstractCegarLoop]: === Iteration 1145 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:12:58,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:12:58,515 INFO L85 PathProgramCache]: Analyzing trace with hash 1141608356, now seen corresponding path program 1 times [2022-12-06 00:12:58,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:12:58,515 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335361428] [2022-12-06 00:12:58,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:12:58,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:12:58,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:12:58,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-06 00:12:58,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:12:58,590 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335361428] [2022-12-06 00:12:58,590 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1335361428] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:12:58,590 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:12:58,590 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:12:58,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547915410] [2022-12-06 00:12:58,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:12:58,591 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:12:58,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:12:58,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:12:58,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:12:58,591 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:12:58,591 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:12:58,591 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:12:58,591 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:12:58,591 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:12:58,981 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:12:58,981 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:12:58,989 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13561 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:12:59,000 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:12:59,000 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:12:59,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:12:59,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:12:59,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:12:59,001 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:12:59,001 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:12:59,001 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:12:59,049 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:12:59,051 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:59,051 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:12:59,051 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:12:59,051 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:12:59,051 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:59,052 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:12:59,052 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:12:59,052 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:59,053 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:59,084 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:12:59,085 INFO L131 PetriNetUnfolder]: For 3338/3547 co-relation queries the response was YES. [2022-12-06 00:12:59,087 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3338/3547 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2982 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:12:59,090 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:59,090 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:12:59,307 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:12:59,307 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 256 [2022-12-06 00:12:59,307 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:12:59,307 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:12:59,307 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:12:59,308 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:12:59,308 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1144 [2022-12-06 00:12:59,308 INFO L420 AbstractCegarLoop]: === Iteration 1146 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:12:59,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:12:59,308 INFO L85 PathProgramCache]: Analyzing trace with hash -1410548605, now seen corresponding path program 1 times [2022-12-06 00:12:59,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:12:59,308 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579596078] [2022-12-06 00:12:59,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:12:59,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:12:59,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:12:59,391 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-06 00:12:59,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:12:59,391 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579596078] [2022-12-06 00:12:59,392 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1579596078] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:12:59,392 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:12:59,392 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:12:59,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127360280] [2022-12-06 00:12:59,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:12:59,392 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:12:59,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:12:59,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:12:59,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:12:59,392 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:12:59,392 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:12:59,393 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:12:59,393 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:12:59,393 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:12:59,754 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:12:59,755 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:12:59,762 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13550 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:12:59,773 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:12:59,773 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:12:59,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:12:59,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:12:59,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:12:59,774 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:12:59,774 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:12:59,774 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:12:59,821 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:12:59,823 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:59,823 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:12:59,823 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:12:59,823 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:12:59,823 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:59,824 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:12:59,824 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:12:59,824 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:59,825 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:59,857 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:12:59,857 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 00:12:59,858 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3312/3520 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2987 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:12:59,861 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:12:59,861 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:13:00,047 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:13:00,048 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 225 [2022-12-06 00:13:00,048 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:13:00,048 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:13:00,048 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:13:00,048 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:13:00,048 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1145 [2022-12-06 00:13:00,048 INFO L420 AbstractCegarLoop]: === Iteration 1147 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:13:00,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:13:00,048 INFO L85 PathProgramCache]: Analyzing trace with hash 332261730, now seen corresponding path program 1 times [2022-12-06 00:13:00,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:13:00,048 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049657605] [2022-12-06 00:13:00,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:13:00,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:13:00,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:13:00,130 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-06 00:13:00,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:13:00,130 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049657605] [2022-12-06 00:13:00,130 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2049657605] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:13:00,130 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:13:00,130 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:13:00,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517726416] [2022-12-06 00:13:00,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:13:00,131 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:13:00,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:13:00,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:13:00,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:13:00,131 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:13:00,131 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:13:00,131 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:13:00,131 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:13:00,131 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:13:00,532 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:13:00,533 INFO L131 PetriNetUnfolder]: For 27150/27195 co-relation queries the response was YES. [2022-12-06 00:13:00,539 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27150/27195 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13526 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:13:00,549 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:13:00,549 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:13:00,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:13:00,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:13:00,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:13:00,550 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:13:00,550 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:13:00,550 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:13:00,593 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:13:00,595 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:13:00,595 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:13:00,595 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:13:00,595 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:13:00,595 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:13:00,596 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:13:00,596 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:13:00,596 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:13:00,597 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:13:00,629 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:13:00,630 INFO L131 PetriNetUnfolder]: For 3167/3307 co-relation queries the response was YES. [2022-12-06 00:13:00,631 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3167/3307 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2990 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:13:00,634 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:13:00,634 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:13:00,826 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:13:00,827 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 232 [2022-12-06 00:13:00,827 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:13:00,827 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:13:00,827 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:13:00,827 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:13:00,827 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1146 [2022-12-06 00:13:00,827 INFO L420 AbstractCegarLoop]: === Iteration 1148 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:13:00,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:13:00,828 INFO L85 PathProgramCache]: Analyzing trace with hash 2075072065, now seen corresponding path program 1 times [2022-12-06 00:13:00,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:13:00,828 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748498993] [2022-12-06 00:13:00,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:13:00,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:13:00,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:13:00,934 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-06 00:13:00,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:13:00,935 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748498993] [2022-12-06 00:13:00,935 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1748498993] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:13:00,935 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:13:00,935 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:13:00,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970148603] [2022-12-06 00:13:00,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:13:00,935 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:13:00,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:13:00,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:13:00,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:13:00,935 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:13:00,936 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:13:00,936 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:13:00,936 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:13:00,936 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:13:01,354 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:13:01,355 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:13:01,365 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13556 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:13:01,375 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:13:01,375 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:13:01,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:13:01,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:13:01,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:13:01,376 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:13:01,376 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:13:01,376 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:13:01,422 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:13:01,424 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:13:01,424 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:13:01,424 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:13:01,424 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:13:01,424 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:13:01,425 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:13:01,425 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:13:01,425 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:13:01,426 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:13:01,459 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:13:01,460 INFO L131 PetriNetUnfolder]: For 3310/3519 co-relation queries the response was YES. [2022-12-06 00:13:01,461 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3310/3519 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2983 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:13:01,464 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:13:01,465 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:13:01,652 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:13:01,653 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 229 [2022-12-06 00:13:01,653 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:13:01,653 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:13:01,653 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:13:01,653 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:13:01,653 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1147 [2022-12-06 00:13:01,653 INFO L420 AbstractCegarLoop]: === Iteration 1149 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:13:01,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:13:01,654 INFO L85 PathProgramCache]: Analyzing trace with hash -477084896, now seen corresponding path program 1 times [2022-12-06 00:13:01,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:13:01,654 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459833503] [2022-12-06 00:13:01,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:13:01,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:13:01,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:13:01,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-06 00:13:01,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:13:01,736 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459833503] [2022-12-06 00:13:01,736 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1459833503] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:13:01,737 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:13:01,737 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:13:01,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119405544] [2022-12-06 00:13:01,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:13:01,737 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:13:01,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:13:01,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:13:01,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:13:01,737 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:13:01,737 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:13:01,737 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:13:01,738 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:13:01,738 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:13:02,097 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:13:02,097 INFO L131 PetriNetUnfolder]: For 27136/27181 co-relation queries the response was YES. [2022-12-06 00:13:02,107 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27136/27181 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13529 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:13:02,118 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:13:02,118 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:13:02,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:13:02,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:13:02,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:13:02,119 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:13:02,119 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:13:02,119 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:13:02,165 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:13:02,167 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:13:02,167 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:13:02,167 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:13:02,167 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:13:02,167 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:13:02,168 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:13:02,168 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:13:02,168 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:13:02,168 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:13:02,200 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:13:02,200 INFO L131 PetriNetUnfolder]: For 3169/3310 co-relation queries the response was YES. [2022-12-06 00:13:02,202 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3169/3310 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 3016 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:13:02,204 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:13:02,204 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:13:02,382 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:13:02,383 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 216 [2022-12-06 00:13:02,383 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:13:02,383 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:13:02,383 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:13:02,383 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:13:02,383 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1148 [2022-12-06 00:13:02,383 INFO L420 AbstractCegarLoop]: === Iteration 1150 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:13:02,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:13:02,384 INFO L85 PathProgramCache]: Analyzing trace with hash 1265725439, now seen corresponding path program 1 times [2022-12-06 00:13:02,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:13:02,384 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239923630] [2022-12-06 00:13:02,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:13:02,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:13:02,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:13:02,483 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-06 00:13:02,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:13:02,484 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239923630] [2022-12-06 00:13:02,484 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1239923630] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:13:02,484 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:13:02,484 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:13:02,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615441388] [2022-12-06 00:13:02,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:13:02,485 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:13:02,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:13:02,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:13:02,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:13:02,485 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:13:02,485 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:13:02,485 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:13:02,485 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:13:02,485 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:13:02,893 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:13:02,893 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:13:02,900 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13563 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:13:02,908 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:13:02,908 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:13:02,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:13:02,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:13:02,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:13:02,909 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:13:02,909 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:13:02,909 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:13:02,952 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:13:02,954 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:13:02,954 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:13:02,954 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:13:02,954 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:13:02,954 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:13:02,955 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:13:02,955 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:13:02,955 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:13:02,956 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:13:02,987 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:13:02,987 INFO L131 PetriNetUnfolder]: For 3304/3511 co-relation queries the response was YES. [2022-12-06 00:13:02,989 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3304/3511 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2987 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:13:02,991 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:13:02,992 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:13:03,161 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:13:03,162 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 208 [2022-12-06 00:13:03,162 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:13:03,162 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:13:03,162 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:13:03,162 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:13:03,162 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1149 [2022-12-06 00:13:03,162 INFO L420 AbstractCegarLoop]: === Iteration 1151 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:13:03,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:13:03,162 INFO L85 PathProgramCache]: Analyzing trace with hash -1286431522, now seen corresponding path program 1 times [2022-12-06 00:13:03,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:13:03,163 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861565772] [2022-12-06 00:13:03,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:13:03,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:13:03,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:13:03,253 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-06 00:13:03,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:13:03,253 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861565772] [2022-12-06 00:13:03,253 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [861565772] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:13:03,253 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:13:03,254 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:13:03,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136161100] [2022-12-06 00:13:03,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:13:03,254 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:13:03,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:13:03,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:13:03,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:13:03,254 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:13:03,254 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:13:03,254 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:13:03,254 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:13:03,254 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:13:03,679 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:13:03,679 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 00:13:03,688 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26969/27014 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13524 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:13:03,699 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:13:03,699 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:13:03,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:13:03,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:13:03,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:13:03,700 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:13:03,700 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:13:03,700 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:13:03,749 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:13:03,750 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:13:03,750 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:13:03,751 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:13:03,751 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:13:03,751 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:13:03,751 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:13:03,751 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:13:03,751 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:13:03,752 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:13:03,783 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:13:03,783 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 00:13:03,785 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3133/3273 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2984 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:13:03,787 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:13:03,787 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:13:04,043 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:13:04,043 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 292 [2022-12-06 00:13:04,043 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:13:04,043 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:13:04,043 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:13:04,043 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:13:04,044 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1150 [2022-12-06 00:13:04,044 INFO L420 AbstractCegarLoop]: === Iteration 1152 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:13:04,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:13:04,044 INFO L85 PathProgramCache]: Analyzing trace with hash 456378813, now seen corresponding path program 1 times [2022-12-06 00:13:04,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:13:04,044 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448655109] [2022-12-06 00:13:04,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:13:04,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:13:04,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:13:04,152 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-06 00:13:04,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:13:04,152 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448655109] [2022-12-06 00:13:04,152 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1448655109] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:13:04,153 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:13:04,153 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:13:04,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744221981] [2022-12-06 00:13:04,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:13:04,153 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:13:04,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:13:04,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:13:04,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:13:04,153 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:13:04,153 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:13:04,153 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:13:04,154 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:13:04,154 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:13:04,509 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:13:04,509 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:13:04,517 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13562 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:13:04,528 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:13:04,528 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:13:04,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:13:04,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:13:04,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:13:04,529 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:13:04,529 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:13:04,529 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:13:04,575 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:13:04,577 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:13:04,577 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:13:04,577 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:13:04,577 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:13:04,577 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:13:04,578 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:13:04,578 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:13:04,578 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:13:04,578 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:13:04,611 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:13:04,611 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 00:13:04,613 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3321/3530 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2988 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:13:04,615 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:13:04,616 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:13:04,782 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:13:04,782 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 205 [2022-12-06 00:13:04,782 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:13:04,783 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:13:04,783 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:13:04,783 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:13:04,783 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1151 [2022-12-06 00:13:04,783 INFO L420 AbstractCegarLoop]: === Iteration 1153 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:13:04,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:13:04,783 INFO L85 PathProgramCache]: Analyzing trace with hash -2095778148, now seen corresponding path program 1 times [2022-12-06 00:13:04,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:13:04,783 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747666531] [2022-12-06 00:13:04,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:13:04,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:13:04,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:13:04,863 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-06 00:13:04,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:13:04,863 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747666531] [2022-12-06 00:13:04,863 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1747666531] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:13:04,863 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:13:04,863 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:13:04,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160836526] [2022-12-06 00:13:04,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:13:04,864 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:13:04,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:13:04,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:13:04,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:13:04,864 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:13:04,864 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:13:04,864 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:13:04,864 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:13:04,864 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:13:05,275 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:13:05,275 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 00:13:05,282 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26965/27010 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13531 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:13:05,292 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:13:05,293 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:13:05,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:13:05,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:13:05,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:13:05,294 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:13:05,294 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:13:05,294 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:13:05,336 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:13:05,338 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:13:05,338 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:13:05,338 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:13:05,339 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:13:05,339 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:13:05,339 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:13:05,339 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:13:05,339 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:13:05,340 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:13:05,373 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:13:05,373 INFO L131 PetriNetUnfolder]: For 3135/3276 co-relation queries the response was YES. [2022-12-06 00:13:05,374 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3135/3276 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2984 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:13:05,377 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:13:05,377 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:13:05,566 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:13:05,567 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 228 [2022-12-06 00:13:05,567 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:13:05,567 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:13:05,567 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:13:05,567 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:13:05,567 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1152 [2022-12-06 00:13:05,568 INFO L420 AbstractCegarLoop]: === Iteration 1154 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:13:05,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:13:05,568 INFO L85 PathProgramCache]: Analyzing trace with hash -352967813, now seen corresponding path program 1 times [2022-12-06 00:13:05,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:13:05,568 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085420977] [2022-12-06 00:13:05,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:13:05,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:13:05,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:13:05,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-06 00:13:05,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:13:05,662 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085420977] [2022-12-06 00:13:05,662 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1085420977] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:13:05,662 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:13:05,662 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:13:05,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22357424] [2022-12-06 00:13:05,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:13:05,662 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:13:05,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:13:05,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:13:05,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:13:05,663 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:13:05,663 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:13:05,663 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:13:05,663 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:13:05,663 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:13:06,029 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:13:06,029 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:13:06,037 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13568 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:13:06,047 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:13:06,047 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:13:06,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:13:06,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:13:06,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:13:06,048 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:13:06,048 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:13:06,048 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:13:06,096 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:13:06,097 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:13:06,097 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:13:06,097 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:13:06,097 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:13:06,097 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:13:06,098 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:13:06,098 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:13:06,098 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:13:06,099 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:13:06,130 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:13:06,130 INFO L131 PetriNetUnfolder]: For 3301/3509 co-relation queries the response was YES. [2022-12-06 00:13:06,131 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3301/3509 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2988 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:13:06,134 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:13:06,134 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:13:06,301 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:13:06,302 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 205 [2022-12-06 00:13:06,302 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:13:06,302 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:13:06,302 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:13:06,302 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:13:06,302 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1153 [2022-12-06 00:13:06,302 INFO L420 AbstractCegarLoop]: === Iteration 1155 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:13:06,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:13:06,302 INFO L85 PathProgramCache]: Analyzing trace with hash 1389842522, now seen corresponding path program 1 times [2022-12-06 00:13:06,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:13:06,302 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323384162] [2022-12-06 00:13:06,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:13:06,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:13:06,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:13:06,413 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-06 00:13:06,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:13:06,413 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323384162] [2022-12-06 00:13:06,413 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [323384162] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:13:06,413 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:13:06,413 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:13:06,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726764447] [2022-12-06 00:13:06,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:13:06,413 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:13:06,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:13:06,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:13:06,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:13:06,414 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:13:06,414 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:13:06,414 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:13:06,414 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:13:06,414 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:13:06,771 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:13:06,771 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:13:06,780 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13542 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:13:06,790 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:13:06,790 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:13:06,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:13:06,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:13:06,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:13:06,791 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:13:06,791 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:13:06,791 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:13:06,839 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:13:06,841 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:13:06,841 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:13:06,841 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:13:06,841 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:13:06,841 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:13:06,842 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:13:06,842 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:13:06,842 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:13:06,842 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:13:06,873 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:13:06,874 INFO L131 PetriNetUnfolder]: For 3318/3528 co-relation queries the response was YES. [2022-12-06 00:13:06,875 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3318/3528 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2997 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:13:06,878 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:13:06,878 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:13:07,069 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:13:07,070 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 229 [2022-12-06 00:13:07,070 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:13:07,070 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:13:07,070 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:13:07,070 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:13:07,070 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1154 [2022-12-06 00:13:07,070 INFO L420 AbstractCegarLoop]: === Iteration 1156 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:13:07,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:13:07,070 INFO L85 PathProgramCache]: Analyzing trace with hash -1162314439, now seen corresponding path program 1 times [2022-12-06 00:13:07,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:13:07,071 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279101150] [2022-12-06 00:13:07,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:13:07,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:13:07,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:13:07,159 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-06 00:13:07,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:13:07,160 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279101150] [2022-12-06 00:13:07,160 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1279101150] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:13:07,160 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:13:07,160 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:13:07,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415063369] [2022-12-06 00:13:07,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:13:07,160 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:13:07,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:13:07,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:13:07,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:13:07,161 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:13:07,161 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:13:07,161 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:13:07,161 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:13:07,161 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:13:07,577 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:13:07,577 INFO L131 PetriNetUnfolder]: For 26965/27010 co-relation queries the response was YES. [2022-12-06 00:13:07,584 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26965/27010 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13540 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:13:07,592 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:13:07,593 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:13:07,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:13:07,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:13:07,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:13:07,593 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:13:07,594 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:13:07,594 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:13:07,637 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:13:07,639 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:13:07,639 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:13:07,639 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:13:07,639 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:13:07,639 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:13:07,640 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:13:07,640 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:13:07,640 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:13:07,641 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:13:07,673 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:13:07,673 INFO L131 PetriNetUnfolder]: For 3134/3275 co-relation queries the response was YES. [2022-12-06 00:13:07,674 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3134/3275 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2996 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:13:07,677 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:13:07,677 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:13:07,850 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:13:07,851 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 212 [2022-12-06 00:13:07,851 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:13:07,851 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:13:07,851 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:13:07,851 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:13:07,851 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1155 [2022-12-06 00:13:07,851 INFO L420 AbstractCegarLoop]: === Iteration 1157 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:13:07,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:13:07,852 INFO L85 PathProgramCache]: Analyzing trace with hash 580495896, now seen corresponding path program 1 times [2022-12-06 00:13:07,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:13:07,852 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113445870] [2022-12-06 00:13:07,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:13:07,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:13:07,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:13:07,943 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-06 00:13:07,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:13:07,943 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113445870] [2022-12-06 00:13:07,943 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [113445870] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:13:07,944 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:13:07,944 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:13:07,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892939349] [2022-12-06 00:13:07,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:13:07,944 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:13:07,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:13:07,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:13:07,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:13:07,944 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:13:07,944 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:13:07,944 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:13:07,945 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:13:07,945 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:13:08,318 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:13:08,319 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:13:08,326 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13552 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:13:08,337 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:13:08,337 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:13:08,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:13:08,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:13:08,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:13:08,338 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:13:08,338 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:13:08,338 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:13:08,386 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:13:08,388 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:13:08,388 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:13:08,388 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:13:08,389 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:13:08,389 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:13:08,389 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:13:08,389 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:13:08,389 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:13:08,390 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:13:08,423 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:13:08,423 INFO L131 PetriNetUnfolder]: For 3338/3547 co-relation queries the response was YES. [2022-12-06 00:13:08,425 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3338/3547 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 3012 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:13:08,427 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:13:08,427 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:13:08,602 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:13:08,602 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 213 [2022-12-06 00:13:08,602 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:13:08,602 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:13:08,602 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:13:08,603 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:13:08,603 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1156 [2022-12-06 00:13:08,603 INFO L420 AbstractCegarLoop]: === Iteration 1158 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:13:08,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:13:08,603 INFO L85 PathProgramCache]: Analyzing trace with hash -1971661065, now seen corresponding path program 1 times [2022-12-06 00:13:08,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:13:08,603 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32880340] [2022-12-06 00:13:08,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:13:08,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:13:08,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:13:08,677 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-06 00:13:08,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:13:08,678 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32880340] [2022-12-06 00:13:08,678 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [32880340] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:13:08,678 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:13:08,678 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:13:08,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210025970] [2022-12-06 00:13:08,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:13:08,678 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:13:08,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:13:08,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:13:08,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:13:08,679 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:13:08,679 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:13:08,679 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:13:08,679 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:13:08,679 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:13:09,054 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:13:09,054 INFO L131 PetriNetUnfolder]: For 27229/27274 co-relation queries the response was YES. [2022-12-06 00:13:09,062 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27229/27274 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13542 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:13:09,071 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:13:09,071 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:13:09,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:13:09,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:13:09,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:13:09,072 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:13:09,072 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:13:09,072 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:13:09,118 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:13:09,119 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:13:09,119 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:13:09,120 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:13:09,120 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:13:09,120 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:13:09,120 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:13:09,120 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:13:09,120 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:13:09,121 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:13:09,153 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:13:09,153 INFO L131 PetriNetUnfolder]: For 3304/3511 co-relation queries the response was YES. [2022-12-06 00:13:09,154 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3304/3511 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 3011 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:13:09,156 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:13:09,157 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:13:09,334 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:13:09,334 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 214 [2022-12-06 00:13:09,335 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:13:09,335 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:13:09,335 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:13:09,335 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:13:09,335 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1157 [2022-12-06 00:13:09,335 INFO L420 AbstractCegarLoop]: === Iteration 1159 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:13:09,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:13:09,335 INFO L85 PathProgramCache]: Analyzing trace with hash -228850730, now seen corresponding path program 1 times [2022-12-06 00:13:09,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:13:09,335 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279118461] [2022-12-06 00:13:09,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:13:09,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:13:09,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:13:09,409 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-06 00:13:09,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:13:09,409 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279118461] [2022-12-06 00:13:09,409 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1279118461] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:13:09,409 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:13:09,409 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:13:09,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789993302] [2022-12-06 00:13:09,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:13:09,409 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:13:09,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:13:09,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:13:09,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:13:09,410 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:13:09,410 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:13:09,410 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:13:09,410 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:13:09,410 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:13:09,808 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:13:09,808 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:13:09,815 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13559 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:13:09,824 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:13:09,824 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:13:09,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:13:09,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:13:09,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:13:09,825 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:13:09,825 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:13:09,825 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:13:09,868 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:13:09,870 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:13:09,870 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:13:09,870 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:13:09,870 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:13:09,870 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:13:09,871 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:13:09,871 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:13:09,871 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:13:09,872 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:13:09,904 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:13:09,904 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 00:13:09,906 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3312/3520 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2977 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:13:09,909 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:13:09,909 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:13:10,108 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:13:10,109 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 239 [2022-12-06 00:13:10,109 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:13:10,109 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:13:10,109 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:13:10,109 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:13:10,109 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1158 [2022-12-06 00:13:10,109 INFO L420 AbstractCegarLoop]: === Iteration 1160 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:13:10,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:13:10,109 INFO L85 PathProgramCache]: Analyzing trace with hash 1513959605, now seen corresponding path program 1 times [2022-12-06 00:13:10,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:13:10,109 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5574688] [2022-12-06 00:13:10,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:13:10,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:13:10,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:13:10,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-06 00:13:10,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:13:10,191 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5574688] [2022-12-06 00:13:10,191 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [5574688] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:13:10,191 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:13:10,191 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:13:10,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294124634] [2022-12-06 00:13:10,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:13:10,192 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:13:10,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:13:10,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:13:10,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:13:10,192 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:13:10,192 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:13:10,192 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:13:10,192 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:13:10,192 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:13:10,571 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:13:10,572 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:13:10,579 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13566 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:13:10,590 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:13:10,590 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:13:10,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:13:10,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:13:10,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:13:10,591 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:13:10,591 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:13:10,591 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:13:10,641 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:13:10,643 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:13:10,643 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:13:10,643 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:13:10,643 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:13:10,643 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:13:10,644 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:13:10,644 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:13:10,644 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:13:10,645 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:13:10,676 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:13:10,676 INFO L131 PetriNetUnfolder]: For 3321/3530 co-relation queries the response was YES. [2022-12-06 00:13:10,677 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3321/3530 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2985 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:13:10,680 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:13:10,680 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:13:10,857 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:13:10,857 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 214 [2022-12-06 00:13:10,857 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:13:10,857 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:13:10,857 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:13:10,858 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:13:10,858 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1159 [2022-12-06 00:13:10,858 INFO L420 AbstractCegarLoop]: === Iteration 1161 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:13:10,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:13:10,858 INFO L85 PathProgramCache]: Analyzing trace with hash -1038197356, now seen corresponding path program 1 times [2022-12-06 00:13:10,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:13:10,858 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926293802] [2022-12-06 00:13:10,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:13:10,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:13:10,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:13:10,947 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-06 00:13:10,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:13:10,948 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926293802] [2022-12-06 00:13:10,948 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [926293802] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:13:10,948 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:13:10,948 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:13:10,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912414200] [2022-12-06 00:13:10,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:13:10,948 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:13:10,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:13:10,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:13:10,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:13:10,949 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:13:10,949 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:13:10,949 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:13:10,949 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:13:10,949 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:13:11,308 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:13:11,308 INFO L131 PetriNetUnfolder]: For 27229/27274 co-relation queries the response was YES. [2022-12-06 00:13:11,315 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27229/27274 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13566 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:13:11,325 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:13:11,325 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:13:11,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:13:11,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:13:11,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:13:11,326 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:13:11,326 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:13:11,326 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:13:11,371 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:13:11,373 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:13:11,373 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:13:11,373 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:13:11,373 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:13:11,373 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:13:11,374 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:13:11,374 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:13:11,374 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:13:11,374 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:13:11,407 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:13:11,407 INFO L131 PetriNetUnfolder]: For 3338/3550 co-relation queries the response was YES. [2022-12-06 00:13:11,409 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3338/3550 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2977 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:13:11,412 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:13:11,412 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:13:11,620 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:13:11,621 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 248 [2022-12-06 00:13:11,621 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:13:11,621 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:13:11,621 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:13:11,621 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:13:11,621 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1160 [2022-12-06 00:13:11,621 INFO L420 AbstractCegarLoop]: === Iteration 1162 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:13:11,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:13:11,621 INFO L85 PathProgramCache]: Analyzing trace with hash 704612979, now seen corresponding path program 1 times [2022-12-06 00:13:11,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:13:11,621 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172215207] [2022-12-06 00:13:11,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:13:11,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:13:11,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:13:11,713 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-06 00:13:11,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:13:11,713 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172215207] [2022-12-06 00:13:11,713 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [172215207] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:13:11,713 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:13:11,714 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:13:11,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305719335] [2022-12-06 00:13:11,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:13:11,714 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:13:11,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:13:11,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:13:11,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:13:11,714 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:13:11,714 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:13:11,714 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:13:11,714 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:13:11,714 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:13:12,134 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:13:12,134 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:13:12,141 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 13540 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:13:12,152 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:13:12,153 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:13:12,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:13:12,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:13:12,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:13:12,154 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:13:12,154 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:13:12,154 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:13:12,198 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:13:12,200 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:13:12,200 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:13:12,200 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:13:12,200 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:13:12,200 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:13:12,201 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:13:12,201 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:13:12,201 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:13:12,201 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:13:12,233 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:13:12,233 INFO L131 PetriNetUnfolder]: For 3309/3518 co-relation queries the response was YES. [2022-12-06 00:13:12,234 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3309/3518 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2978 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:13:12,237 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:13:12,237 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:13:12,433 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:13:12,433 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 233 [2022-12-06 00:13:12,434 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:13:12,434 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:13:12,434 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:13:12,434 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:13:12,434 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1161 [2022-12-06 00:13:12,434 INFO L420 AbstractCegarLoop]: === Iteration 1163 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:13:12,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:13:12,434 INFO L85 PathProgramCache]: Analyzing trace with hash -1847543982, now seen corresponding path program 1 times [2022-12-06 00:13:12,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:13:12,434 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563378093] [2022-12-06 00:13:12,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:13:12,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:13:12,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:13:12,522 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-06 00:13:12,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:13:12,522 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563378093] [2022-12-06 00:13:12,522 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [563378093] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:13:12,522 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:13:12,523 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:13:12,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444799569] [2022-12-06 00:13:12,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:13:12,523 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:13:12,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:13:12,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:13:12,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:13:12,523 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:13:12,523 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:13:12,523 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:13:12,523 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:13:12,523 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:13:12,884 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:13:12,884 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:13:12,893 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13545 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:13:12,904 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:13:12,904 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:13:12,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:13:12,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:13:12,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:13:12,905 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:13:12,905 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:13:12,905 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:13:12,951 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:13:12,953 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:13:12,953 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:13:12,953 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:13:12,953 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:13:12,953 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:13:12,954 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:13:12,954 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:13:12,954 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:13:12,955 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:13:12,986 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:13:12,986 INFO L131 PetriNetUnfolder]: For 3310/3519 co-relation queries the response was YES. [2022-12-06 00:13:12,987 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3310/3519 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2976 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:13:12,989 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:13:12,990 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:13:13,160 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:13:13,161 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 208 [2022-12-06 00:13:13,161 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:13:13,161 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:13:13,161 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:13:13,161 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:13:13,161 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1162 [2022-12-06 00:13:13,161 INFO L420 AbstractCegarLoop]: === Iteration 1164 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:13:13,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:13:13,162 INFO L85 PathProgramCache]: Analyzing trace with hash -104733647, now seen corresponding path program 1 times [2022-12-06 00:13:13,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:13:13,162 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293833823] [2022-12-06 00:13:13,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:13:13,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:13:13,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:13:13,253 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-06 00:13:13,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:13:13,253 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293833823] [2022-12-06 00:13:13,253 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1293833823] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:13:13,253 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:13:13,253 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:13:13,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432798617] [2022-12-06 00:13:13,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:13:13,254 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:13:13,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:13:13,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:13:13,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:13:13,254 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:13:13,254 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:13:13,254 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:13:13,254 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:13:13,255 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:13:13,620 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:13:13,620 INFO L131 PetriNetUnfolder]: For 27136/27181 co-relation queries the response was YES. [2022-12-06 00:13:13,627 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27136/27181 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13521 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:13:13,637 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:13:13,637 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:13:13,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:13:13,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:13:13,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:13:13,638 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:13:13,638 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:13:13,638 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:13:13,684 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:13:13,685 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:13:13,685 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:13:13,685 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:13:13,685 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:13:13,685 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:13:13,686 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:13:13,686 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:13:13,686 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:13:13,687 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:13:13,717 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:13:13,717 INFO L131 PetriNetUnfolder]: For 3168/3309 co-relation queries the response was YES. [2022-12-06 00:13:13,719 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3168/3309 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 3007 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:13:13,721 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:13:13,721 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:13:13,905 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:13:13,905 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 220 [2022-12-06 00:13:13,905 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:13:13,905 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:13:13,905 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:13:13,906 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:13:13,906 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1163 [2022-12-06 00:13:13,906 INFO L420 AbstractCegarLoop]: === Iteration 1165 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:13:13,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:13:13,906 INFO L85 PathProgramCache]: Analyzing trace with hash 1638076688, now seen corresponding path program 1 times [2022-12-06 00:13:13,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:13:13,906 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405371465] [2022-12-06 00:13:13,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:13:13,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:13:13,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:13:13,982 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-06 00:13:13,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:13:13,982 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405371465] [2022-12-06 00:13:13,982 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1405371465] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:13:13,982 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:13:13,982 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:13:13,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820479442] [2022-12-06 00:13:13,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:13:13,983 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:13:13,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:13:13,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:13:13,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:13:13,983 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:13:13,983 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:13:13,983 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:13:13,983 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:13:13,983 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:13:14,368 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:13:14,369 INFO L131 PetriNetUnfolder]: For 27150/27195 co-relation queries the response was YES. [2022-12-06 00:13:14,375 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27150/27195 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13519 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:13:14,384 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:13:14,384 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:13:14,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:13:14,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:13:14,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:13:14,385 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:13:14,385 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:13:14,385 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:13:14,419 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:13:14,420 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:13:14,420 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:13:14,420 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:13:14,420 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:13:14,420 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:13:14,421 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:13:14,421 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:13:14,421 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:13:14,421 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:13:14,446 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:13:14,446 INFO L131 PetriNetUnfolder]: For 3180/3321 co-relation queries the response was YES. [2022-12-06 00:13:14,447 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3180/3321 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 3006 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:13:14,449 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:13:14,449 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:13:14,606 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:13:14,607 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 187 [2022-12-06 00:13:14,607 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:13:14,607 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:13:14,607 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:13:14,607 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:13:14,607 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1164 [2022-12-06 00:13:14,607 INFO L420 AbstractCegarLoop]: === Iteration 1166 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:13:14,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:13:14,607 INFO L85 PathProgramCache]: Analyzing trace with hash -914080273, now seen corresponding path program 1 times [2022-12-06 00:13:14,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:13:14,607 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721832200] [2022-12-06 00:13:14,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:13:14,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:13:14,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:13:14,678 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-06 00:13:14,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:13:14,678 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721832200] [2022-12-06 00:13:14,678 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1721832200] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:13:14,678 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:13:14,678 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:13:14,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651713189] [2022-12-06 00:13:14,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:13:14,678 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:13:14,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:13:14,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:13:14,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:13:14,679 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:13:14,679 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:13:14,679 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:13:14,679 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:13:14,679 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:13:14,955 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:13:14,955 INFO L131 PetriNetUnfolder]: For 27229/27274 co-relation queries the response was YES. [2022-12-06 00:13:14,960 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27229/27274 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13570 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:13:14,966 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:13:14,967 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:13:14,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:13:14,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:13:14,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:13:14,967 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:13:14,967 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:13:14,967 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:13:15,000 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:13:15,002 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:13:15,002 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:13:15,002 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:13:15,002 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:13:15,002 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:13:15,002 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:13:15,002 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:13:15,002 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:13:15,003 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:13:15,028 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:13:15,028 INFO L131 PetriNetUnfolder]: For 3304/3511 co-relation queries the response was YES. [2022-12-06 00:13:15,029 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3304/3511 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2980 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:13:15,031 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:13:15,031 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:13:15,186 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:13:15,186 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 184 [2022-12-06 00:13:15,186 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:13:15,186 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:13:15,186 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:13:15,186 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:13:15,186 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1165 [2022-12-06 00:13:15,187 INFO L420 AbstractCegarLoop]: === Iteration 1167 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:13:15,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:13:15,187 INFO L85 PathProgramCache]: Analyzing trace with hash 828730062, now seen corresponding path program 1 times [2022-12-06 00:13:15,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:13:15,187 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613526392] [2022-12-06 00:13:15,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:13:15,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:13:15,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:13:15,251 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-06 00:13:15,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:13:15,251 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613526392] [2022-12-06 00:13:15,251 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1613526392] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:13:15,251 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:13:15,251 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:13:15,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400146278] [2022-12-06 00:13:15,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:13:15,252 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:13:15,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:13:15,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:13:15,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:13:15,252 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:13:15,252 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:13:15,252 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:13:15,252 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:13:15,252 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:13:15,538 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:13:15,538 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 00:13:15,544 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26969/27014 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13523 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:13:15,551 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:13:15,551 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:13:15,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:13:15,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:13:15,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:13:15,552 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:13:15,552 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:13:15,552 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:13:15,590 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:13:15,591 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:13:15,591 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:13:15,591 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:13:15,591 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:13:15,592 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:13:15,592 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:13:15,592 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:13:15,592 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:13:15,593 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:13:15,617 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:13:15,617 INFO L131 PetriNetUnfolder]: For 3122/3262 co-relation queries the response was YES. [2022-12-06 00:13:15,618 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3122/3262 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2989 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:13:15,620 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:13:15,620 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:13:15,752 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:13:15,753 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 162 [2022-12-06 00:13:15,753 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:13:15,753 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:13:15,753 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:13:15,753 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:13:15,753 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1166 [2022-12-06 00:13:15,753 INFO L420 AbstractCegarLoop]: === Iteration 1168 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:13:15,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:13:15,753 INFO L85 PathProgramCache]: Analyzing trace with hash -1723426899, now seen corresponding path program 1 times [2022-12-06 00:13:15,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:13:15,753 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650231690] [2022-12-06 00:13:15,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:13:15,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:13:15,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:13:15,818 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-06 00:13:15,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:13:15,818 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650231690] [2022-12-06 00:13:15,818 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1650231690] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:13:15,818 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:13:15,818 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:13:15,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688331507] [2022-12-06 00:13:15,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:13:15,819 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:13:15,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:13:15,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:13:15,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:13:15,819 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:13:15,819 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:13:15,819 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:13:15,819 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:13:15,819 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:13:16,121 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:13:16,121 INFO L131 PetriNetUnfolder]: For 26955/27000 co-relation queries the response was YES. [2022-12-06 00:13:16,126 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26955/27000 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13505 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:13:16,133 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:13:16,133 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:13:16,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:13:16,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:13:16,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:13:16,134 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:13:16,134 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:13:16,134 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:13:16,167 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:13:16,168 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:13:16,168 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:13:16,168 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:13:16,168 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:13:16,168 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:13:16,168 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:13:16,168 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:13:16,169 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:13:16,169 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:13:16,193 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:13:16,193 INFO L131 PetriNetUnfolder]: For 3133/3273 co-relation queries the response was YES. [2022-12-06 00:13:16,194 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3133/3273 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2956 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:13:16,196 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:13:16,196 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:13:16,359 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:13:16,359 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 191 [2022-12-06 00:13:16,359 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:13:16,360 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:13:16,360 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:13:16,360 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:13:16,360 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1167 [2022-12-06 00:13:16,360 INFO L420 AbstractCegarLoop]: === Iteration 1169 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:13:16,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:13:16,360 INFO L85 PathProgramCache]: Analyzing trace with hash 19383436, now seen corresponding path program 1 times [2022-12-06 00:13:16,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:13:16,360 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778434442] [2022-12-06 00:13:16,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:13:16,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:13:16,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:13:16,419 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-06 00:13:16,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:13:16,419 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778434442] [2022-12-06 00:13:16,419 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [778434442] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:13:16,420 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:13:16,420 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:13:16,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958733530] [2022-12-06 00:13:16,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:13:16,420 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:13:16,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:13:16,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:13:16,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:13:16,420 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:13:16,420 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:13:16,420 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:13:16,420 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:13:16,420 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:13:16,695 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:13:16,695 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 00:13:16,702 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26969/27014 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13524 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:13:16,711 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:13:16,711 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:13:16,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:13:16,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:13:16,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:13:16,712 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:13:16,712 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:13:16,712 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:13:16,747 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:13:16,748 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:13:16,748 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:13:16,749 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:13:16,749 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:13:16,749 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:13:16,749 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:13:16,749 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:13:16,749 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:13:16,750 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:13:16,773 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:13:16,774 INFO L131 PetriNetUnfolder]: For 3141/3284 co-relation queries the response was YES. [2022-12-06 00:13:16,774 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3141/3284 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2970 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:13:16,776 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:13:16,776 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:13:16,926 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:13:16,926 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 177 [2022-12-06 00:13:16,926 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:13:16,926 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:13:16,926 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:13:16,926 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:13:16,927 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1168 [2022-12-06 00:13:16,927 INFO L420 AbstractCegarLoop]: === Iteration 1170 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:13:16,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:13:16,927 INFO L85 PathProgramCache]: Analyzing trace with hash 1762193771, now seen corresponding path program 1 times [2022-12-06 00:13:16,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:13:16,927 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737523427] [2022-12-06 00:13:16,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:13:16,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:13:16,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:13:16,996 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-06 00:13:16,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:13:16,996 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737523427] [2022-12-06 00:13:16,996 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1737523427] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:13:16,996 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:13:16,996 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:13:16,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676097126] [2022-12-06 00:13:16,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:13:16,996 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:13:16,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:13:16,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:13:16,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:13:16,997 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:13:16,997 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:13:16,997 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:13:16,997 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:13:16,997 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:13:17,284 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:13:17,284 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:13:17,290 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13558 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:13:17,298 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:13:17,298 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:13:17,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:13:17,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:13:17,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:13:17,298 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:13:17,298 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:13:17,298 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:13:17,337 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:13:17,338 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:13:17,338 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:13:17,338 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:13:17,338 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:13:17,338 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:13:17,339 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:13:17,339 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:13:17,339 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:13:17,339 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:13:17,364 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:13:17,364 INFO L131 PetriNetUnfolder]: For 3301/3509 co-relation queries the response was YES. [2022-12-06 00:13:17,365 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3301/3509 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2982 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:13:17,367 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:13:17,367 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:13:17,511 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:13:17,512 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 174 [2022-12-06 00:13:17,512 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:13:17,512 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:13:17,512 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:13:17,512 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:13:17,512 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1169 [2022-12-06 00:13:17,512 INFO L420 AbstractCegarLoop]: === Iteration 1171 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:13:17,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:13:17,512 INFO L85 PathProgramCache]: Analyzing trace with hash -789963190, now seen corresponding path program 1 times [2022-12-06 00:13:17,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:13:17,512 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518646751] [2022-12-06 00:13:17,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:13:17,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:13:17,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:13:17,582 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-06 00:13:17,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:13:17,582 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518646751] [2022-12-06 00:13:17,582 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [518646751] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:13:17,582 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:13:17,582 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:13:17,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817466718] [2022-12-06 00:13:17,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:13:17,582 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:13:17,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:13:17,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:13:17,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:13:17,583 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:13:17,583 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:13:17,583 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:13:17,583 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:13:17,583 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:13:17,878 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:13:17,879 INFO L131 PetriNetUnfolder]: For 27136/27181 co-relation queries the response was YES. [2022-12-06 00:13:17,883 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27136/27181 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13521 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:13:17,890 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:13:17,890 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:13:17,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:13:17,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:13:17,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:13:17,891 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:13:17,891 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:13:17,891 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:13:17,920 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:13:17,921 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:13:17,921 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:13:17,921 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:13:17,921 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:13:17,922 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:13:17,922 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:13:17,922 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:13:17,922 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:13:17,923 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:13:17,946 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:13:17,947 INFO L131 PetriNetUnfolder]: For 3167/3307 co-relation queries the response was YES. [2022-12-06 00:13:17,947 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3167/3307 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2992 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:13:17,949 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:13:17,949 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:13:18,106 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:13:18,106 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 185 [2022-12-06 00:13:18,106 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:13:18,106 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:13:18,106 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:13:18,106 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:13:18,106 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1170 [2022-12-06 00:13:18,106 INFO L420 AbstractCegarLoop]: === Iteration 1172 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:13:18,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:13:18,107 INFO L85 PathProgramCache]: Analyzing trace with hash 952847145, now seen corresponding path program 1 times [2022-12-06 00:13:18,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:13:18,107 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443267773] [2022-12-06 00:13:18,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:13:18,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:13:18,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:13:18,177 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-06 00:13:18,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:13:18,178 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443267773] [2022-12-06 00:13:18,178 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [443267773] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:13:18,178 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:13:18,178 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:13:18,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432582267] [2022-12-06 00:13:18,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:13:18,178 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:13:18,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:13:18,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:13:18,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:13:18,178 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:13:18,178 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:13:18,179 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:13:18,179 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:13:18,179 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:13:18,457 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:13:18,457 INFO L131 PetriNetUnfolder]: For 27233/27278 co-relation queries the response was YES. [2022-12-06 00:13:18,463 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27233/27278 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13568 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:13:18,470 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:13:18,470 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:13:18,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:13:18,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:13:18,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:13:18,471 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:13:18,471 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:13:18,471 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:13:18,508 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:13:18,509 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:13:18,509 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:13:18,509 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:13:18,509 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:13:18,509 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:13:18,510 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:13:18,510 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:13:18,510 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:13:18,510 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:13:18,534 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:13:18,534 INFO L131 PetriNetUnfolder]: For 3312/3520 co-relation queries the response was YES. [2022-12-06 00:13:18,535 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3312/3520 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2995 event pairs, 3 based on Foata normal form. 21/421 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:13:18,537 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:13:18,537 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:13:18,680 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:13:18,680 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 171 [2022-12-06 00:13:18,680 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:13:18,680 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:13:18,680 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:13:18,680 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:13:18,681 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1171 [2022-12-06 00:13:18,681 INFO L420 AbstractCegarLoop]: === Iteration 1173 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:13:18,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:13:18,681 INFO L85 PathProgramCache]: Analyzing trace with hash -1599309816, now seen corresponding path program 1 times [2022-12-06 00:13:18,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:13:18,681 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699373195] [2022-12-06 00:13:18,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:13:18,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:13:18,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:13:18,743 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-06 00:13:18,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:13:18,743 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699373195] [2022-12-06 00:13:18,743 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [699373195] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:13:18,743 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:13:18,743 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:13:18,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119316697] [2022-12-06 00:13:18,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:13:18,743 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:13:18,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:13:18,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:13:18,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:13:18,743 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:13:18,744 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:13:18,744 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:13:18,744 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:13:18,744 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:13:19,020 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:13:19,021 INFO L131 PetriNetUnfolder]: For 26969/27014 co-relation queries the response was YES. [2022-12-06 00:13:19,027 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 26969/27014 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 13532 event pairs, 773 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:13:19,035 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:13:19,035 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:13:19,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:13:19,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:13:19,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:13:19,035 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:13:19,035 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:13:19,035 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:13:19,071 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:13:19,072 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:13:19,073 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:13:19,073 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:13:19,073 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:13:19,073 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:13:19,073 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:13:19,073 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:13:19,073 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:13:19,074 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:13:19,097 INFO L130 PetriNetUnfolder]: 112/429 cut-off events. [2022-12-06 00:13:19,097 INFO L131 PetriNetUnfolder]: For 3135/3276 co-relation queries the response was YES. [2022-12-06 00:13:19,098 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1885 conditions, 429 events. 112/429 cut-off events. For 3135/3276 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2982 event pairs, 2 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1749. Up to 166 conditions per place. [2022-12-06 00:13:19,100 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:13:19,100 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:13:19,239 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:13:19,239 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 166 [2022-12-06 00:13:19,239 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:13:19,239 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:13:19,240 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:13:19,240 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:13:19,240 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1172 [2022-12-06 00:13:19,240 INFO L420 AbstractCegarLoop]: === Iteration 1174 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:13:19,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:13:19,240 INFO L85 PathProgramCache]: Analyzing trace with hash 143500519, now seen corresponding path program 1 times [2022-12-06 00:13:19,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:13:19,240 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441707020] [2022-12-06 00:13:19,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:13:19,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:13:19,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:13:19,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-06 00:13:19,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:13:19,299 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441707020] [2022-12-06 00:13:19,299 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [441707020] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:13:19,299 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:13:19,299 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:13:19,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876197999] [2022-12-06 00:13:19,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:13:19,300 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:13:19,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:13:19,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:13:19,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:13:19,300 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:13:19,300 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:13:19,300 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:13:19,300 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:13:19,300 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:13:19,592 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:13:19,592 INFO L131 PetriNetUnfolder]: For 27136/27181 co-relation queries the response was YES. [2022-12-06 00:13:19,597 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27136/27181 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13541 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:13:19,603 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:13:19,603 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:13:19,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:13:19,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:13:19,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:13:19,603 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:13:19,603 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:13:19,603 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:13:19,633 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:13:19,634 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:13:19,635 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:13:19,635 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:13:19,635 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:13:19,635 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:13:19,635 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:13:19,635 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:13:19,635 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:13:19,636 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:13:19,659 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:13:19,659 INFO L131 PetriNetUnfolder]: For 3167/3307 co-relation queries the response was YES. [2022-12-06 00:13:19,660 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3167/3307 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 3001 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:13:19,662 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:13:19,662 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 00:13:19,806 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:13:19,807 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 172 [2022-12-06 00:13:19,807 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1189 flow [2022-12-06 00:13:19,807 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:13:19,807 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:13:19,807 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:13:19,807 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1173 [2022-12-06 00:13:19,807 INFO L420 AbstractCegarLoop]: === Iteration 1175 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:13:19,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:13:19,807 INFO L85 PathProgramCache]: Analyzing trace with hash 1886310854, now seen corresponding path program 1 times [2022-12-06 00:13:19,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:13:19,807 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469650403] [2022-12-06 00:13:19,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:13:19,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:13:19,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:13:19,877 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:13:19,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:13:19,878 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469650403] [2022-12-06 00:13:19,878 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [469650403] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:13:19,878 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:13:19,878 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:13:19,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839847842] [2022-12-06 00:13:19,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:13:19,878 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:13:19,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:13:19,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:13:19,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:13:19,878 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 00:13:19,878 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1189 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:13:19,879 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:13:19,879 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 00:13:19,879 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:13:20,160 INFO L130 PetriNetUnfolder]: 1614/2583 cut-off events. [2022-12-06 00:13:20,160 INFO L131 PetriNetUnfolder]: For 27146/27191 co-relation queries the response was YES. [2022-12-06 00:13:20,165 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14630 conditions, 2583 events. 1614/2583 cut-off events. For 27146/27191 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13502 event pairs, 769 based on Foata normal form. 34/2592 useless extension candidates. Maximal degree in co-relation 13796. Up to 1861 conditions per place. [2022-12-06 00:13:20,173 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 93 selfloop transitions, 16 changer transitions 0/112 dead transitions. [2022-12-06 00:13:20,173 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 112 transitions, 1562 flow [2022-12-06 00:13:20,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:13:20,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:13:20,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 00:13:20,173 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011627906976744 [2022-12-06 00:13:20,173 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1189 flow. Second operand 4 states and 69 transitions. [2022-12-06 00:13:20,174 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 112 transitions, 1562 flow [2022-12-06 00:13:20,204 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1520 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:13:20,205 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 1195 flow [2022-12-06 00:13:20,205 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1195, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2022-12-06 00:13:20,205 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2022-12-06 00:13:20,205 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:13:20,206 INFO L89 Accepts]: Start accepts. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:13:20,206 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:13:20,206 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:13:20,206 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:13:20,207 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 1195 flow [2022-12-06 00:13:20,230 INFO L130 PetriNetUnfolder]: 112/430 cut-off events. [2022-12-06 00:13:20,230 INFO L131 PetriNetUnfolder]: For 3156/3296 co-relation queries the response was YES. [2022-12-06 00:13:20,231 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 430 events. 112/430 cut-off events. For 3156/3296 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2982 event pairs, 3 based on Foata normal form. 23/427 useless extension candidates. Maximal degree in co-relation 1745. Up to 165 conditions per place. [2022-12-06 00:13:20,233 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 1195 flow [2022-12-06 00:13:20,233 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 Received shutdown request... [2022-12-06 00:13:20,270 WARN L249 SmtUtils]: Removed 8 from assertion stack [2022-12-06 00:13:20,271 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2022-12-06 00:13:20,272 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1174 [2022-12-06 00:13:20,272 WARN L619 AbstractCegarLoop]: Verification canceled: while TransFormulaUtils was doing sequential composition of 2 TransFormulas,while SimplifyDDAWithTimeout was simplifying term of DAG size 48 for 34ms.. [2022-12-06 00:13:20,273 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2022-12-06 00:13:20,273 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2022-12-06 00:13:20,273 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2022-12-06 00:13:20,274 INFO L458 BasicCegarLoop]: Path program histogram: [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 00:13:20,275 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-06 00:13:20,281 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 00:13:20,282 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 00:13:20,284 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 12:13:20 BasicIcfg [2022-12-06 00:13:20,284 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 00:13:20,284 INFO L158 Benchmark]: Toolchain (without parser) took 800158.15ms. Allocated memory was 174.1MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 150.9MB in the beginning and 878.4MB in the end (delta: -727.5MB). Peak memory consumption was 458.1MB. Max. memory is 8.0GB. [2022-12-06 00:13:20,284 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 127.9MB. Free memory was 106.7MB in the beginning and 106.6MB in the end (delta: 89.5kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 00:13:20,284 INFO L158 Benchmark]: CACSL2BoogieTranslator took 288.84ms. Allocated memory is still 174.1MB. Free memory was 150.6MB in the beginning and 139.7MB in the end (delta: 10.9MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-12-06 00:13:20,284 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.60ms. Allocated memory is still 174.1MB. Free memory was 139.7MB in the beginning and 138.0MB in the end (delta: 1.7MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-06 00:13:20,284 INFO L158 Benchmark]: Boogie Preprocessor took 34.31ms. Allocated memory is still 174.1MB. Free memory was 138.0MB in the beginning and 136.6MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 00:13:20,284 INFO L158 Benchmark]: RCFGBuilder took 424.64ms. Allocated memory is still 174.1MB. Free memory was 136.6MB in the beginning and 123.5MB in the end (delta: 13.0MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-12-06 00:13:20,285 INFO L158 Benchmark]: TraceAbstraction took 799349.71ms. Allocated memory was 174.1MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 152.6MB in the beginning and 878.4MB in the end (delta: -725.9MB). Peak memory consumption was 458.5MB. Max. memory is 8.0GB. [2022-12-06 00:13:20,285 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 127.9MB. Free memory was 106.7MB in the beginning and 106.6MB in the end (delta: 89.5kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 288.84ms. Allocated memory is still 174.1MB. Free memory was 150.6MB in the beginning and 139.7MB in the end (delta: 10.9MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 45.60ms. Allocated memory is still 174.1MB. Free memory was 139.7MB in the beginning and 138.0MB in the end (delta: 1.7MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 34.31ms. Allocated memory is still 174.1MB. Free memory was 138.0MB in the beginning and 136.6MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 424.64ms. Allocated memory is still 174.1MB. Free memory was 136.6MB in the beginning and 123.5MB in the end (delta: 13.0MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * TraceAbstraction took 799349.71ms. Allocated memory was 174.1MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 152.6MB in the beginning and 878.4MB in the end (delta: -725.9MB). Peak memory consumption was 458.5MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.9s, 92 PlacesBefore, 29 PlacesAfterwards, 89 TransitionsBefore, 22 TransitionsAfterwards, 1320 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 33 TrivialYvCompositions, 30 ConcurrentYvCompositions, 4 ChoiceCompositions, 67 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 624, independent: 624, independent conditional: 624, 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: 624, independent: 624, independent conditional: 0, independent unconditional: 624, 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: 624, independent: 624, independent conditional: 0, independent unconditional: 624, 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: 624, independent: 624, independent conditional: 0, independent unconditional: 624, 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: 624, independent: 624, independent conditional: 0, independent unconditional: 624, 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: 624, independent: 624, independent conditional: 0, independent unconditional: 624, 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: 624, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 624, unknown conditional: 0, unknown unconditional: 624] , Statistics on independence cache: Total cache size (in pairs): 1001, Positive cache size: 1001, Positive conditional cache size: 0, Positive unconditional cache size: 1001, 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, 26 PlacesBefore, 26 PlacesAfterwards, 25 TransitionsBefore, 25 TransitionsAfterwards, 192 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, 35 PlacesBefore, 33 PlacesAfterwards, 31 TransitionsBefore, 27 TransitionsAfterwards, 278 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 66, independent: 66, independent conditional: 66, 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: 66, independent: 66, independent conditional: 33, independent unconditional: 33, 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: 66, independent: 66, independent conditional: 15, independent unconditional: 51, 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: 66, independent: 66, independent conditional: 15, independent unconditional: 51, 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: 29, independent: 29, independent conditional: 6, independent unconditional: 23, 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: 29, independent: 29, independent conditional: 0, independent unconditional: 29, 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: 66, independent: 37, independent conditional: 9, independent unconditional: 28, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 29, unknown conditional: 6, unknown unconditional: 23] , Statistics on independence cache: Total cache size (in pairs): 30, Positive cache size: 30, Positive conditional cache size: 6, Positive unconditional cache size: 24, 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: 18, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 41 PlacesBefore, 40 PlacesAfterwards, 37 TransitionsBefore, 35 TransitionsAfterwards, 318 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 33, independent: 33, independent conditional: 33, 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: 33, independent: 33, independent conditional: 33, 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: 33, independent: 33, independent conditional: 10, independent unconditional: 23, 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: 33, independent: 33, independent conditional: 10, independent unconditional: 23, 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: 17, independent: 17, independent conditional: 6, independent unconditional: 11, 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: 17, independent: 17, independent conditional: 0, independent unconditional: 17, 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: 33, independent: 16, independent conditional: 4, independent unconditional: 12, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 17, unknown conditional: 6, unknown unconditional: 11] , Statistics on independence cache: Total cache size (in pairs): 49, Positive cache size: 49, Positive conditional cache size: 12, Positive unconditional cache size: 37, 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: 23, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 48 PlacesBefore, 49 PlacesAfterwards, 45 TransitionsBefore, 45 TransitionsAfterwards, 360 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 19, independent: 19, independent conditional: 19, 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: 19, independent: 19, independent conditional: 19, 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: 19, independent: 19, independent conditional: 5, independent unconditional: 14, 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: 19, independent: 19, independent conditional: 5, independent unconditional: 14, 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: 14, independent: 14, independent conditional: 5, independent unconditional: 9, 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: 14, independent: 14, independent conditional: 0, independent unconditional: 14, 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: 19, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 14, unknown conditional: 5, unknown unconditional: 9] , Statistics on independence cache: Total cache size (in pairs): 64, Positive cache size: 64, Positive conditional cache size: 17, Positive unconditional cache size: 47, 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: 14, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 52 PlacesBefore, 52 PlacesAfterwards, 46 TransitionsBefore, 46 TransitionsAfterwards, 362 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): 64, Positive cache size: 64, Positive conditional cache size: 17, Positive unconditional cache size: 47, 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, 57 PlacesBefore, 57 PlacesAfterwards, 47 TransitionsBefore, 47 TransitionsAfterwards, 360 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 39, independent: 39, independent conditional: 39, 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: 39, independent: 39, independent conditional: 6, independent unconditional: 33, 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: 39, independent: 39, independent conditional: 6, independent unconditional: 33, 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: 39, independent: 39, independent conditional: 6, independent unconditional: 33, 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: 7, independent: 7, independent conditional: 2, independent unconditional: 5, 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: 7, independent: 7, independent conditional: 0, independent unconditional: 7, 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: 39, independent: 32, independent conditional: 4, independent unconditional: 28, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 7, unknown conditional: 2, unknown unconditional: 5] , Statistics on independence cache: Total cache size (in pairs): 73, Positive cache size: 73, Positive conditional cache size: 19, Positive unconditional cache size: 54, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.4s, 63 PlacesBefore, 63 PlacesAfterwards, 49 TransitionsBefore, 50 TransitionsAfterwards, 370 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 59, independent: 59, independent conditional: 59, 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: 59, independent: 59, independent conditional: 26, independent unconditional: 33, 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: 59, independent: 59, independent conditional: 25, independent unconditional: 34, 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: 59, independent: 59, independent conditional: 25, independent unconditional: 34, 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: 12, independent: 12, independent conditional: 11, independent unconditional: 1, 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: 12, independent: 12, independent conditional: 0, independent unconditional: 12, 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: 59, independent: 47, independent conditional: 14, independent unconditional: 33, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 12, unknown conditional: 11, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 96, Positive cache size: 96, Positive conditional cache size: 30, Positive unconditional cache size: 66, 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: 1, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 70 PlacesBefore, 70 PlacesAfterwards, 54 TransitionsBefore, 53 TransitionsAfterwards, 428 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 17, independent: 17, independent conditional: 17, 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: 17, independent: 17, independent conditional: 17, 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: 17, independent: 17, independent conditional: 17, 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: 17, independent: 17, independent conditional: 17, 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: 15, independent: 15, independent conditional: 15, 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: 15, independent: 15, independent conditional: 0, independent unconditional: 15, 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: 17, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 15, unknown conditional: 15, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 111, Positive cache size: 111, Positive conditional cache size: 45, Positive unconditional cache size: 66, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 73 PlacesBefore, 72 PlacesAfterwards, 55 TransitionsBefore, 54 TransitionsAfterwards, 438 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 7, 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: 7, independent: 7, independent conditional: 7, 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: 7, independent: 7, independent conditional: 7, 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: 7, independent: 7, independent conditional: 7, 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: 7, independent: 7, independent conditional: 7, 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: 7, independent: 7, independent conditional: 0, independent unconditional: 7, 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: 7, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 7, unknown conditional: 7, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 120, Positive cache size: 120, Positive conditional cache size: 52, Positive unconditional cache size: 68, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 71 PlacesBefore, 71 PlacesAfterwards, 52 TransitionsBefore, 52 TransitionsAfterwards, 426 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): 120, Positive cache size: 120, Positive conditional cache size: 52, Positive unconditional cache size: 68, 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, 69 PlacesBefore, 68 PlacesAfterwards, 54 TransitionsBefore, 53 TransitionsAfterwards, 440 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 7, 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: 7, independent: 7, independent conditional: 7, 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: 7, independent: 7, independent conditional: 7, 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: 7, independent: 7, independent conditional: 7, 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: 7, independent: 7, independent conditional: 7, 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: 7, independent: 7, independent conditional: 0, independent unconditional: 7, 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: 7, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 7, unknown conditional: 7, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 129, Positive cache size: 129, Positive conditional cache size: 59, Positive unconditional cache size: 70, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 70 PlacesBefore, 69 PlacesAfterwards, 55 TransitionsBefore, 54 TransitionsAfterwards, 452 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 10, independent: 10, independent conditional: 10, 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: 10, independent: 10, independent conditional: 10, 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: 10, independent: 10, independent conditional: 10, 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: 10, independent: 10, independent conditional: 10, 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: 10, independent: 10, independent conditional: 10, 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: 10, independent: 10, independent conditional: 0, independent unconditional: 10, 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: 10, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 10, unknown conditional: 10, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 141, Positive cache size: 141, Positive conditional cache size: 69, Positive unconditional cache size: 72, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.4s, 71 PlacesBefore, 71 PlacesAfterwards, 55 TransitionsBefore, 55 TransitionsAfterwards, 446 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, 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: 4, independent: 4, independent conditional: 4, 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: 4, independent: 4, independent conditional: 4, 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: 4, independent: 4, independent conditional: 4, 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: 4, independent: 4, independent conditional: 4, 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: 4, independent: 4, independent conditional: 0, independent unconditional: 4, 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: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 4, unknown conditional: 4, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 146, Positive cache size: 146, Positive conditional cache size: 73, Positive unconditional cache size: 73, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 74 PlacesBefore, 74 PlacesAfterwards, 58 TransitionsBefore, 58 TransitionsAfterwards, 474 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 9, 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: 9, independent: 9, independent conditional: 9, 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: 9, independent: 9, independent conditional: 9, 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: 9, independent: 9, independent conditional: 9, 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: 9, independent: 9, independent conditional: 9, 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: 9, independent: 9, independent conditional: 0, independent unconditional: 9, 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: 9, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 9, unknown conditional: 9, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 157, Positive cache size: 157, Positive conditional cache size: 82, Positive unconditional cache size: 75, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 75 PlacesBefore, 75 PlacesAfterwards, 59 TransitionsBefore, 59 TransitionsAfterwards, 480 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): 157, Positive cache size: 157, Positive conditional cache size: 82, Positive unconditional cache size: 75, 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, 58 TransitionsBefore, 58 TransitionsAfterwards, 476 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): 157, Positive cache size: 157, Positive conditional cache size: 82, Positive unconditional cache size: 75, 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, 80 PlacesBefore, 79 PlacesAfterwards, 61 TransitionsBefore, 60 TransitionsAfterwards, 480 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 15, independent: 15, independent conditional: 15, 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: 15, independent: 15, independent conditional: 15, 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: 15, independent: 15, independent conditional: 15, 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: 15, independent: 15, independent conditional: 15, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 15, independent: 14, independent conditional: 14, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 162, Positive cache size: 162, Positive conditional cache size: 85, Positive unconditional cache size: 77, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 83 PlacesBefore, 83 PlacesAfterwards, 65 TransitionsBefore, 65 TransitionsAfterwards, 542 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 15, independent: 15, independent conditional: 15, 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: 15, independent: 15, independent conditional: 15, 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: 15, independent: 15, independent conditional: 10, independent unconditional: 5, 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: 15, independent: 15, independent conditional: 10, independent unconditional: 5, 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: 4, independent: 4, independent conditional: 4, 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: 4, independent: 4, independent conditional: 0, independent unconditional: 4, 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: 15, independent: 11, independent conditional: 6, independent unconditional: 5, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 4, unknown conditional: 4, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 168, Positive cache size: 168, Positive conditional cache size: 89, Positive unconditional cache size: 79, 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: 5, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 87 PlacesBefore, 86 PlacesAfterwards, 65 TransitionsBefore, 66 TransitionsAfterwards, 536 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 28, independent: 28, independent conditional: 28, 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: 28, independent: 28, independent conditional: 28, 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: 28, independent: 28, independent conditional: 28, 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: 28, independent: 28, independent conditional: 28, 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: 26, independent: 26, independent conditional: 26, 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: 26, independent: 26, independent conditional: 0, independent unconditional: 26, 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: 28, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 26, unknown conditional: 26, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 200, Positive cache size: 200, Positive conditional cache size: 117, Positive unconditional cache size: 83, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 91 PlacesBefore, 91 PlacesAfterwards, 77 TransitionsBefore, 77 TransitionsAfterwards, 630 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 15, independent: 15, independent conditional: 15, 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: 15, independent: 15, independent conditional: 15, 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: 15, independent: 15, independent conditional: 10, independent unconditional: 5, 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: 15, independent: 15, independent conditional: 10, independent unconditional: 5, 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: 6, independent: 6, independent conditional: 6, 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: 6, independent: 6, independent conditional: 0, independent unconditional: 6, 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: 15, independent: 9, independent conditional: 4, independent unconditional: 5, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 6, unknown conditional: 6, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 208, Positive cache size: 208, Positive conditional cache size: 124, Positive unconditional cache size: 84, 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: 5, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 96 PlacesBefore, 95 PlacesAfterwards, 77 TransitionsBefore, 75 TransitionsAfterwards, 616 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 9, 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: 9, independent: 9, independent conditional: 9, 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: 9, independent: 9, independent conditional: 9, 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: 9, independent: 9, independent conditional: 9, 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: 9, independent: 9, independent conditional: 9, 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: 9, independent: 9, independent conditional: 0, independent unconditional: 9, 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: 9, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 9, unknown conditional: 9, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 222, Positive cache size: 222, Positive conditional cache size: 137, Positive unconditional cache size: 85, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 97 PlacesBefore, 97 PlacesAfterwards, 91 TransitionsBefore, 91 TransitionsAfterwards, 730 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 7, 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: 7, independent: 7, independent conditional: 7, 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: 7, independent: 7, independent conditional: 7, 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: 7, independent: 7, independent conditional: 7, 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: 7, independent: 7, independent conditional: 7, 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: 7, independent: 7, independent conditional: 0, independent unconditional: 7, 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: 7, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 7, unknown conditional: 7, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 235, Positive cache size: 235, Positive conditional cache size: 148, Positive unconditional cache size: 87, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 7, 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: 7, independent: 7, independent conditional: 7, 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: 7, independent: 7, independent conditional: 1, independent unconditional: 6, 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: 7, independent: 7, independent conditional: 1, independent unconditional: 6, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 7, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 237, Positive cache size: 237, Positive conditional cache size: 149, Positive unconditional cache size: 88, 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: 6, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 238, Positive cache size: 238, Positive conditional cache size: 150, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 239, Positive cache size: 239, Positive conditional cache size: 151, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 240, Positive cache size: 240, Positive conditional cache size: 152, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 241, Positive cache size: 241, Positive conditional cache size: 153, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 242, Positive cache size: 242, Positive conditional cache size: 154, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.6s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 243, Positive cache size: 243, Positive conditional cache size: 155, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 244, Positive cache size: 244, Positive conditional cache size: 156, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 245, Positive cache size: 245, Positive conditional cache size: 157, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 246, Positive cache size: 246, Positive conditional cache size: 158, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 247, Positive cache size: 247, Positive conditional cache size: 159, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 248, Positive cache size: 248, Positive conditional cache size: 160, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 249, Positive cache size: 249, Positive conditional cache size: 161, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 250, Positive cache size: 250, Positive conditional cache size: 162, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 251, Positive cache size: 251, Positive conditional cache size: 163, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 252, Positive cache size: 252, Positive conditional cache size: 164, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 253, Positive cache size: 253, Positive conditional cache size: 165, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 254, Positive cache size: 254, Positive conditional cache size: 166, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 255, Positive cache size: 255, Positive conditional cache size: 167, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 256, Positive cache size: 256, Positive conditional cache size: 168, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 257, Positive cache size: 257, Positive conditional cache size: 169, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 258, Positive cache size: 258, Positive conditional cache size: 170, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 259, Positive cache size: 259, Positive conditional cache size: 171, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 260, Positive cache size: 260, Positive conditional cache size: 172, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 261, Positive cache size: 261, Positive conditional cache size: 173, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 262, Positive cache size: 262, Positive conditional cache size: 174, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 263, Positive cache size: 263, Positive conditional cache size: 175, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 264, Positive cache size: 264, Positive conditional cache size: 176, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 265, Positive cache size: 265, Positive conditional cache size: 177, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 266, Positive cache size: 266, Positive conditional cache size: 178, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 267, Positive cache size: 267, Positive conditional cache size: 179, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 268, Positive cache size: 268, Positive conditional cache size: 180, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 269, Positive cache size: 269, Positive conditional cache size: 181, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.4s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 270, Positive cache size: 270, Positive conditional cache size: 182, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 271, Positive cache size: 271, Positive conditional cache size: 183, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 272, Positive cache size: 272, Positive conditional cache size: 184, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 273, Positive cache size: 273, Positive conditional cache size: 185, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 274, Positive cache size: 274, Positive conditional cache size: 186, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 275, Positive cache size: 275, Positive conditional cache size: 187, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 276, Positive cache size: 276, Positive conditional cache size: 188, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 277, Positive cache size: 277, Positive conditional cache size: 189, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 278, Positive cache size: 278, Positive conditional cache size: 190, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 279, Positive cache size: 279, Positive conditional cache size: 191, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 280, Positive cache size: 280, Positive conditional cache size: 192, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 281, Positive cache size: 281, Positive conditional cache size: 193, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 282, Positive cache size: 282, Positive conditional cache size: 194, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 283, Positive cache size: 283, Positive conditional cache size: 195, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.4s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 284, Positive cache size: 284, Positive conditional cache size: 196, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 285, Positive cache size: 285, Positive conditional cache size: 197, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 286, Positive cache size: 286, Positive conditional cache size: 198, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 287, Positive cache size: 287, Positive conditional cache size: 199, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 288, Positive cache size: 288, Positive conditional cache size: 200, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 289, Positive cache size: 289, Positive conditional cache size: 201, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 290, Positive cache size: 290, Positive conditional cache size: 202, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 291, Positive cache size: 291, Positive conditional cache size: 203, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 292, Positive cache size: 292, Positive conditional cache size: 204, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 293, Positive cache size: 293, Positive conditional cache size: 205, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 294, Positive cache size: 294, Positive conditional cache size: 206, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 295, Positive cache size: 295, Positive conditional cache size: 207, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 296, Positive cache size: 296, Positive conditional cache size: 208, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 297, Positive cache size: 297, Positive conditional cache size: 209, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 298, Positive cache size: 298, Positive conditional cache size: 210, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 299, Positive cache size: 299, Positive conditional cache size: 211, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 300, Positive cache size: 300, Positive conditional cache size: 212, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 301, Positive cache size: 301, Positive conditional cache size: 213, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 302, Positive cache size: 302, Positive conditional cache size: 214, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 303, Positive cache size: 303, Positive conditional cache size: 215, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 304, Positive cache size: 304, Positive conditional cache size: 216, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 305, Positive cache size: 305, Positive conditional cache size: 217, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 306, Positive cache size: 306, Positive conditional cache size: 218, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 307, Positive cache size: 307, Positive conditional cache size: 219, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 308, Positive cache size: 308, Positive conditional cache size: 220, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 309, Positive cache size: 309, Positive conditional cache size: 221, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 310, Positive cache size: 310, Positive conditional cache size: 222, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 311, Positive cache size: 311, Positive conditional cache size: 223, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 312, Positive cache size: 312, Positive conditional cache size: 224, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 313, Positive cache size: 313, Positive conditional cache size: 225, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 314, Positive cache size: 314, Positive conditional cache size: 226, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 315, Positive cache size: 315, Positive conditional cache size: 227, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 316, Positive cache size: 316, Positive conditional cache size: 228, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 317, Positive cache size: 317, Positive conditional cache size: 229, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 318, Positive cache size: 318, Positive conditional cache size: 230, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 319, Positive cache size: 319, Positive conditional cache size: 231, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 320, Positive cache size: 320, Positive conditional cache size: 232, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 321, Positive cache size: 321, Positive conditional cache size: 233, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 322, Positive cache size: 322, Positive conditional cache size: 234, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 323, Positive cache size: 323, Positive conditional cache size: 235, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 324, Positive cache size: 324, Positive conditional cache size: 236, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 325, Positive cache size: 325, Positive conditional cache size: 237, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 326, Positive cache size: 326, Positive conditional cache size: 238, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 327, Positive cache size: 327, Positive conditional cache size: 239, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.5s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 328, Positive cache size: 328, Positive conditional cache size: 240, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 329, Positive cache size: 329, Positive conditional cache size: 241, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 330, Positive cache size: 330, Positive conditional cache size: 242, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 331, Positive cache size: 331, Positive conditional cache size: 243, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 332, Positive cache size: 332, Positive conditional cache size: 244, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 333, Positive cache size: 333, Positive conditional cache size: 245, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 334, Positive cache size: 334, Positive conditional cache size: 246, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 335, Positive cache size: 335, Positive conditional cache size: 247, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 336, Positive cache size: 336, Positive conditional cache size: 248, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 337, Positive cache size: 337, Positive conditional cache size: 249, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 338, Positive cache size: 338, Positive conditional cache size: 250, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 339, Positive cache size: 339, Positive conditional cache size: 251, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 340, Positive cache size: 340, Positive conditional cache size: 252, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 341, Positive cache size: 341, Positive conditional cache size: 253, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 342, Positive cache size: 342, Positive conditional cache size: 254, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 343, Positive cache size: 343, Positive conditional cache size: 255, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 344, Positive cache size: 344, Positive conditional cache size: 256, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 345, Positive cache size: 345, Positive conditional cache size: 257, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 346, Positive cache size: 346, Positive conditional cache size: 258, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 347, Positive cache size: 347, Positive conditional cache size: 259, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 348, Positive cache size: 348, Positive conditional cache size: 260, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 349, Positive cache size: 349, Positive conditional cache size: 261, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.5s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 350, Positive cache size: 350, Positive conditional cache size: 262, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 351, Positive cache size: 351, Positive conditional cache size: 263, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 352, Positive cache size: 352, Positive conditional cache size: 264, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 353, Positive cache size: 353, Positive conditional cache size: 265, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 354, Positive cache size: 354, Positive conditional cache size: 266, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 355, Positive cache size: 355, Positive conditional cache size: 267, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 356, Positive cache size: 356, Positive conditional cache size: 268, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 357, Positive cache size: 357, Positive conditional cache size: 269, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 358, Positive cache size: 358, Positive conditional cache size: 270, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.5s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 359, Positive cache size: 359, Positive conditional cache size: 271, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 360, Positive cache size: 360, Positive conditional cache size: 272, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 361, Positive cache size: 361, Positive conditional cache size: 273, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 362, Positive cache size: 362, Positive conditional cache size: 274, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 363, Positive cache size: 363, Positive conditional cache size: 275, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.6s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 364, Positive cache size: 364, Positive conditional cache size: 276, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 365, Positive cache size: 365, Positive conditional cache size: 277, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 366, Positive cache size: 366, Positive conditional cache size: 278, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 367, Positive cache size: 367, Positive conditional cache size: 279, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 368, Positive cache size: 368, Positive conditional cache size: 280, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 369, Positive cache size: 369, Positive conditional cache size: 281, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 370, Positive cache size: 370, Positive conditional cache size: 282, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 371, Positive cache size: 371, Positive conditional cache size: 283, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 372, Positive cache size: 372, Positive conditional cache size: 284, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 373, Positive cache size: 373, Positive conditional cache size: 285, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 374, Positive cache size: 374, Positive conditional cache size: 286, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 375, Positive cache size: 375, Positive conditional cache size: 287, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 376, Positive cache size: 376, Positive conditional cache size: 288, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 377, Positive cache size: 377, Positive conditional cache size: 289, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 378, Positive cache size: 378, Positive conditional cache size: 290, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 379, Positive cache size: 379, Positive conditional cache size: 291, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 380, Positive cache size: 380, Positive conditional cache size: 292, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 381, Positive cache size: 381, Positive conditional cache size: 293, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 382, Positive cache size: 382, Positive conditional cache size: 294, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 383, Positive cache size: 383, Positive conditional cache size: 295, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 384, Positive cache size: 384, Positive conditional cache size: 296, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 385, Positive cache size: 385, Positive conditional cache size: 297, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 386, Positive cache size: 386, Positive conditional cache size: 298, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 387, Positive cache size: 387, Positive conditional cache size: 299, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 388, Positive cache size: 388, Positive conditional cache size: 300, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 389, Positive cache size: 389, Positive conditional cache size: 301, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 390, Positive cache size: 390, Positive conditional cache size: 302, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 391, Positive cache size: 391, Positive conditional cache size: 303, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 392, Positive cache size: 392, Positive conditional cache size: 304, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 393, Positive cache size: 393, Positive conditional cache size: 305, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 394, Positive cache size: 394, Positive conditional cache size: 306, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 395, Positive cache size: 395, Positive conditional cache size: 307, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 396, Positive cache size: 396, Positive conditional cache size: 308, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 397, Positive cache size: 397, Positive conditional cache size: 309, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 398, Positive cache size: 398, Positive conditional cache size: 310, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.4s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 399, Positive cache size: 399, Positive conditional cache size: 311, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 400, Positive cache size: 400, Positive conditional cache size: 312, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 401, Positive cache size: 401, Positive conditional cache size: 313, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 402, Positive cache size: 402, Positive conditional cache size: 314, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 403, Positive cache size: 403, Positive conditional cache size: 315, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 404, Positive cache size: 404, Positive conditional cache size: 316, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 405, Positive cache size: 405, Positive conditional cache size: 317, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 406, Positive cache size: 406, Positive conditional cache size: 318, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 407, Positive cache size: 407, Positive conditional cache size: 319, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 408, Positive cache size: 408, Positive conditional cache size: 320, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 409, Positive cache size: 409, Positive conditional cache size: 321, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 410, Positive cache size: 410, Positive conditional cache size: 322, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 411, Positive cache size: 411, Positive conditional cache size: 323, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 412, Positive cache size: 412, Positive conditional cache size: 324, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 413, Positive cache size: 413, Positive conditional cache size: 325, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 414, Positive cache size: 414, Positive conditional cache size: 326, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 415, Positive cache size: 415, Positive conditional cache size: 327, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 416, Positive cache size: 416, Positive conditional cache size: 328, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 417, Positive cache size: 417, Positive conditional cache size: 329, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 418, Positive cache size: 418, Positive conditional cache size: 330, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 419, Positive cache size: 419, Positive conditional cache size: 331, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 420, Positive cache size: 420, Positive conditional cache size: 332, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 421, Positive cache size: 421, Positive conditional cache size: 333, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 422, Positive cache size: 422, Positive conditional cache size: 334, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 423, Positive cache size: 423, Positive conditional cache size: 335, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 424, Positive cache size: 424, Positive conditional cache size: 336, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 425, Positive cache size: 425, Positive conditional cache size: 337, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 426, Positive cache size: 426, Positive conditional cache size: 338, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 427, Positive cache size: 427, Positive conditional cache size: 339, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 428, Positive cache size: 428, Positive conditional cache size: 340, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 429, Positive cache size: 429, Positive conditional cache size: 341, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 430, Positive cache size: 430, Positive conditional cache size: 342, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 431, Positive cache size: 431, Positive conditional cache size: 343, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 432, Positive cache size: 432, Positive conditional cache size: 344, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 433, Positive cache size: 433, Positive conditional cache size: 345, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 434, Positive cache size: 434, Positive conditional cache size: 346, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 435, Positive cache size: 435, Positive conditional cache size: 347, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 436, Positive cache size: 436, Positive conditional cache size: 348, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 437, Positive cache size: 437, Positive conditional cache size: 349, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 438, Positive cache size: 438, Positive conditional cache size: 350, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 439, Positive cache size: 439, Positive conditional cache size: 351, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 440, Positive cache size: 440, Positive conditional cache size: 352, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 441, Positive cache size: 441, Positive conditional cache size: 353, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 442, Positive cache size: 442, Positive conditional cache size: 354, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 443, Positive cache size: 443, Positive conditional cache size: 355, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 444, Positive cache size: 444, Positive conditional cache size: 356, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 445, Positive cache size: 445, Positive conditional cache size: 357, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 446, Positive cache size: 446, Positive conditional cache size: 358, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 447, Positive cache size: 447, Positive conditional cache size: 359, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 448, Positive cache size: 448, Positive conditional cache size: 360, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 449, Positive cache size: 449, Positive conditional cache size: 361, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 450, Positive cache size: 450, Positive conditional cache size: 362, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 451, Positive cache size: 451, Positive conditional cache size: 363, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 452, Positive cache size: 452, Positive conditional cache size: 364, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 453, Positive cache size: 453, Positive conditional cache size: 365, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 454, Positive cache size: 454, Positive conditional cache size: 366, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 455, Positive cache size: 455, Positive conditional cache size: 367, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 456, Positive cache size: 456, Positive conditional cache size: 368, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 457, Positive cache size: 457, Positive conditional cache size: 369, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 458, Positive cache size: 458, Positive conditional cache size: 370, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 459, Positive cache size: 459, Positive conditional cache size: 371, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 460, Positive cache size: 460, Positive conditional cache size: 372, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 461, Positive cache size: 461, Positive conditional cache size: 373, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 462, Positive cache size: 462, Positive conditional cache size: 374, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 463, Positive cache size: 463, Positive conditional cache size: 375, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 464, Positive cache size: 464, Positive conditional cache size: 376, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 465, Positive cache size: 465, Positive conditional cache size: 377, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 466, Positive cache size: 466, Positive conditional cache size: 378, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 467, Positive cache size: 467, Positive conditional cache size: 379, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 468, Positive cache size: 468, Positive conditional cache size: 380, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 469, Positive cache size: 469, Positive conditional cache size: 381, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 470, Positive cache size: 470, Positive conditional cache size: 382, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 471, Positive cache size: 471, Positive conditional cache size: 383, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 472, Positive cache size: 472, Positive conditional cache size: 384, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 473, Positive cache size: 473, Positive conditional cache size: 385, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 474, Positive cache size: 474, Positive conditional cache size: 386, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 475, Positive cache size: 475, Positive conditional cache size: 387, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 476, Positive cache size: 476, Positive conditional cache size: 388, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 477, Positive cache size: 477, Positive conditional cache size: 389, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 478, Positive cache size: 478, Positive conditional cache size: 390, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 479, Positive cache size: 479, Positive conditional cache size: 391, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 480, Positive cache size: 480, Positive conditional cache size: 392, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 481, Positive cache size: 481, Positive conditional cache size: 393, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 482, Positive cache size: 482, Positive conditional cache size: 394, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 483, Positive cache size: 483, Positive conditional cache size: 395, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 484, Positive cache size: 484, Positive conditional cache size: 396, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 485, Positive cache size: 485, Positive conditional cache size: 397, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 486, Positive cache size: 486, Positive conditional cache size: 398, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 487, Positive cache size: 487, Positive conditional cache size: 399, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 488, Positive cache size: 488, Positive conditional cache size: 400, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 489, Positive cache size: 489, Positive conditional cache size: 401, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 490, Positive cache size: 490, Positive conditional cache size: 402, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 491, Positive cache size: 491, Positive conditional cache size: 403, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 492, Positive cache size: 492, Positive conditional cache size: 404, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 493, Positive cache size: 493, Positive conditional cache size: 405, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 494, Positive cache size: 494, Positive conditional cache size: 406, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 495, Positive cache size: 495, Positive conditional cache size: 407, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 496, Positive cache size: 496, Positive conditional cache size: 408, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 497, Positive cache size: 497, Positive conditional cache size: 409, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 498, Positive cache size: 498, Positive conditional cache size: 410, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 499, Positive cache size: 499, Positive conditional cache size: 411, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 500, Positive cache size: 500, Positive conditional cache size: 412, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 501, Positive cache size: 501, Positive conditional cache size: 413, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 502, Positive cache size: 502, Positive conditional cache size: 414, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 503, Positive cache size: 503, Positive conditional cache size: 415, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 504, Positive cache size: 504, Positive conditional cache size: 416, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 505, Positive cache size: 505, Positive conditional cache size: 417, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 506, Positive cache size: 506, Positive conditional cache size: 418, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 507, Positive cache size: 507, Positive conditional cache size: 419, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 508, Positive cache size: 508, Positive conditional cache size: 420, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 509, Positive cache size: 509, Positive conditional cache size: 421, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 510, Positive cache size: 510, Positive conditional cache size: 422, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 511, Positive cache size: 511, Positive conditional cache size: 423, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 512, Positive cache size: 512, Positive conditional cache size: 424, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 513, Positive cache size: 513, Positive conditional cache size: 425, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 514, Positive cache size: 514, Positive conditional cache size: 426, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 515, Positive cache size: 515, Positive conditional cache size: 427, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 516, Positive cache size: 516, Positive conditional cache size: 428, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 517, Positive cache size: 517, Positive conditional cache size: 429, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 518, Positive cache size: 518, Positive conditional cache size: 430, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 519, Positive cache size: 519, Positive conditional cache size: 431, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 520, Positive cache size: 520, Positive conditional cache size: 432, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 521, Positive cache size: 521, Positive conditional cache size: 433, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 522, Positive cache size: 522, Positive conditional cache size: 434, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 523, Positive cache size: 523, Positive conditional cache size: 435, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 524, Positive cache size: 524, Positive conditional cache size: 436, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 525, Positive cache size: 525, Positive conditional cache size: 437, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 526, Positive cache size: 526, Positive conditional cache size: 438, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 527, Positive cache size: 527, Positive conditional cache size: 439, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 528, Positive cache size: 528, Positive conditional cache size: 440, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 529, Positive cache size: 529, Positive conditional cache size: 441, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 530, Positive cache size: 530, Positive conditional cache size: 442, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 531, Positive cache size: 531, Positive conditional cache size: 443, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 532, Positive cache size: 532, Positive conditional cache size: 444, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 533, Positive cache size: 533, Positive conditional cache size: 445, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 534, Positive cache size: 534, Positive conditional cache size: 446, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.4s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 535, Positive cache size: 535, Positive conditional cache size: 447, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 536, Positive cache size: 536, Positive conditional cache size: 448, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 537, Positive cache size: 537, Positive conditional cache size: 449, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 538, Positive cache size: 538, Positive conditional cache size: 450, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 539, Positive cache size: 539, Positive conditional cache size: 451, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 540, Positive cache size: 540, Positive conditional cache size: 452, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 541, Positive cache size: 541, Positive conditional cache size: 453, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 542, Positive cache size: 542, Positive conditional cache size: 454, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 543, Positive cache size: 543, Positive conditional cache size: 455, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 544, Positive cache size: 544, Positive conditional cache size: 456, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 545, Positive cache size: 545, Positive conditional cache size: 457, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 546, Positive cache size: 546, Positive conditional cache size: 458, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 547, Positive cache size: 547, Positive conditional cache size: 459, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 548, Positive cache size: 548, Positive conditional cache size: 460, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 549, Positive cache size: 549, Positive conditional cache size: 461, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 550, Positive cache size: 550, Positive conditional cache size: 462, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 551, Positive cache size: 551, Positive conditional cache size: 463, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 552, Positive cache size: 552, Positive conditional cache size: 464, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 553, Positive cache size: 553, Positive conditional cache size: 465, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 554, Positive cache size: 554, Positive conditional cache size: 466, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 555, Positive cache size: 555, Positive conditional cache size: 467, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 556, Positive cache size: 556, Positive conditional cache size: 468, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 557, Positive cache size: 557, Positive conditional cache size: 469, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 558, Positive cache size: 558, Positive conditional cache size: 470, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 559, Positive cache size: 559, Positive conditional cache size: 471, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 560, Positive cache size: 560, Positive conditional cache size: 472, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 561, Positive cache size: 561, Positive conditional cache size: 473, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 562, Positive cache size: 562, Positive conditional cache size: 474, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 563, Positive cache size: 563, Positive conditional cache size: 475, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 564, Positive cache size: 564, Positive conditional cache size: 476, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 565, Positive cache size: 565, Positive conditional cache size: 477, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 566, Positive cache size: 566, Positive conditional cache size: 478, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 567, Positive cache size: 567, Positive conditional cache size: 479, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 568, Positive cache size: 568, Positive conditional cache size: 480, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 569, Positive cache size: 569, Positive conditional cache size: 481, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 570, Positive cache size: 570, Positive conditional cache size: 482, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 571, Positive cache size: 571, Positive conditional cache size: 483, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 572, Positive cache size: 572, Positive conditional cache size: 484, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 573, Positive cache size: 573, Positive conditional cache size: 485, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 574, Positive cache size: 574, Positive conditional cache size: 486, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 575, Positive cache size: 575, Positive conditional cache size: 487, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 576, Positive cache size: 576, Positive conditional cache size: 488, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 577, Positive cache size: 577, Positive conditional cache size: 489, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 578, Positive cache size: 578, Positive conditional cache size: 490, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 579, Positive cache size: 579, Positive conditional cache size: 491, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 580, Positive cache size: 580, Positive conditional cache size: 492, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 581, Positive cache size: 581, Positive conditional cache size: 493, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 582, Positive cache size: 582, Positive conditional cache size: 494, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 583, Positive cache size: 583, Positive conditional cache size: 495, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 584, Positive cache size: 584, Positive conditional cache size: 496, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 585, Positive cache size: 585, Positive conditional cache size: 497, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 586, Positive cache size: 586, Positive conditional cache size: 498, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 587, Positive cache size: 587, Positive conditional cache size: 499, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 588, Positive cache size: 588, Positive conditional cache size: 500, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 589, Positive cache size: 589, Positive conditional cache size: 501, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 590, Positive cache size: 590, Positive conditional cache size: 502, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 591, Positive cache size: 591, Positive conditional cache size: 503, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 592, Positive cache size: 592, Positive conditional cache size: 504, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 593, Positive cache size: 593, Positive conditional cache size: 505, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 594, Positive cache size: 594, Positive conditional cache size: 506, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 595, Positive cache size: 595, Positive conditional cache size: 507, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 596, Positive cache size: 596, Positive conditional cache size: 508, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 597, Positive cache size: 597, Positive conditional cache size: 509, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 598, Positive cache size: 598, Positive conditional cache size: 510, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 599, Positive cache size: 599, Positive conditional cache size: 511, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 600, Positive cache size: 600, Positive conditional cache size: 512, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 601, Positive cache size: 601, Positive conditional cache size: 513, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 602, Positive cache size: 602, Positive conditional cache size: 514, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 603, Positive cache size: 603, Positive conditional cache size: 515, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 604, Positive cache size: 604, Positive conditional cache size: 516, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 605, Positive cache size: 605, Positive conditional cache size: 517, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 606, Positive cache size: 606, Positive conditional cache size: 518, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 607, Positive cache size: 607, Positive conditional cache size: 519, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 608, Positive cache size: 608, Positive conditional cache size: 520, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 609, Positive cache size: 609, Positive conditional cache size: 521, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 610, Positive cache size: 610, Positive conditional cache size: 522, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 611, Positive cache size: 611, Positive conditional cache size: 523, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 612, Positive cache size: 612, Positive conditional cache size: 524, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 613, Positive cache size: 613, Positive conditional cache size: 525, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 614, Positive cache size: 614, Positive conditional cache size: 526, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 615, Positive cache size: 615, Positive conditional cache size: 527, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 616, Positive cache size: 616, Positive conditional cache size: 528, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 617, Positive cache size: 617, Positive conditional cache size: 529, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 618, Positive cache size: 618, Positive conditional cache size: 530, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 619, Positive cache size: 619, Positive conditional cache size: 531, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 620, Positive cache size: 620, Positive conditional cache size: 532, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 621, Positive cache size: 621, Positive conditional cache size: 533, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 622, Positive cache size: 622, Positive conditional cache size: 534, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 623, Positive cache size: 623, Positive conditional cache size: 535, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 624, Positive cache size: 624, Positive conditional cache size: 536, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 625, Positive cache size: 625, Positive conditional cache size: 537, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 626, Positive cache size: 626, Positive conditional cache size: 538, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 627, Positive cache size: 627, Positive conditional cache size: 539, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 628, Positive cache size: 628, Positive conditional cache size: 540, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 629, Positive cache size: 629, Positive conditional cache size: 541, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 630, Positive cache size: 630, Positive conditional cache size: 542, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 631, Positive cache size: 631, Positive conditional cache size: 543, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 632, Positive cache size: 632, Positive conditional cache size: 544, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 633, Positive cache size: 633, Positive conditional cache size: 545, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 634, Positive cache size: 634, Positive conditional cache size: 546, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 635, Positive cache size: 635, Positive conditional cache size: 547, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 636, Positive cache size: 636, Positive conditional cache size: 548, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 637, Positive cache size: 637, Positive conditional cache size: 549, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 638, Positive cache size: 638, Positive conditional cache size: 550, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 639, Positive cache size: 639, Positive conditional cache size: 551, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 640, Positive cache size: 640, Positive conditional cache size: 552, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 641, Positive cache size: 641, Positive conditional cache size: 553, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 642, Positive cache size: 642, Positive conditional cache size: 554, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 643, Positive cache size: 643, Positive conditional cache size: 555, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 644, Positive cache size: 644, Positive conditional cache size: 556, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 645, Positive cache size: 645, Positive conditional cache size: 557, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 646, Positive cache size: 646, Positive conditional cache size: 558, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 647, Positive cache size: 647, Positive conditional cache size: 559, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 648, Positive cache size: 648, Positive conditional cache size: 560, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 649, Positive cache size: 649, Positive conditional cache size: 561, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 650, Positive cache size: 650, Positive conditional cache size: 562, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 651, Positive cache size: 651, Positive conditional cache size: 563, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 652, Positive cache size: 652, Positive conditional cache size: 564, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 653, Positive cache size: 653, Positive conditional cache size: 565, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 654, Positive cache size: 654, Positive conditional cache size: 566, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 655, Positive cache size: 655, Positive conditional cache size: 567, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 656, Positive cache size: 656, Positive conditional cache size: 568, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 657, Positive cache size: 657, Positive conditional cache size: 569, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 658, Positive cache size: 658, Positive conditional cache size: 570, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 659, Positive cache size: 659, Positive conditional cache size: 571, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 660, Positive cache size: 660, Positive conditional cache size: 572, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 661, Positive cache size: 661, Positive conditional cache size: 573, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 662, Positive cache size: 662, Positive conditional cache size: 574, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 663, Positive cache size: 663, Positive conditional cache size: 575, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 664, Positive cache size: 664, Positive conditional cache size: 576, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 665, Positive cache size: 665, Positive conditional cache size: 577, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 666, Positive cache size: 666, Positive conditional cache size: 578, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 667, Positive cache size: 667, Positive conditional cache size: 579, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 668, Positive cache size: 668, Positive conditional cache size: 580, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 669, Positive cache size: 669, Positive conditional cache size: 581, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 670, Positive cache size: 670, Positive conditional cache size: 582, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 671, Positive cache size: 671, Positive conditional cache size: 583, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 672, Positive cache size: 672, Positive conditional cache size: 584, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 673, Positive cache size: 673, Positive conditional cache size: 585, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 674, Positive cache size: 674, Positive conditional cache size: 586, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 675, Positive cache size: 675, Positive conditional cache size: 587, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 676, Positive cache size: 676, Positive conditional cache size: 588, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 677, Positive cache size: 677, Positive conditional cache size: 589, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 678, Positive cache size: 678, Positive conditional cache size: 590, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 679, Positive cache size: 679, Positive conditional cache size: 591, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 680, Positive cache size: 680, Positive conditional cache size: 592, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 681, Positive cache size: 681, Positive conditional cache size: 593, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 682, Positive cache size: 682, Positive conditional cache size: 594, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 683, Positive cache size: 683, Positive conditional cache size: 595, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 684, Positive cache size: 684, Positive conditional cache size: 596, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 685, Positive cache size: 685, Positive conditional cache size: 597, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 686, Positive cache size: 686, Positive conditional cache size: 598, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 687, Positive cache size: 687, Positive conditional cache size: 599, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 688, Positive cache size: 688, Positive conditional cache size: 600, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 689, Positive cache size: 689, Positive conditional cache size: 601, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 690, Positive cache size: 690, Positive conditional cache size: 602, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 691, Positive cache size: 691, Positive conditional cache size: 603, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 692, Positive cache size: 692, Positive conditional cache size: 604, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 693, Positive cache size: 693, Positive conditional cache size: 605, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 694, Positive cache size: 694, Positive conditional cache size: 606, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 695, Positive cache size: 695, Positive conditional cache size: 607, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 696, Positive cache size: 696, Positive conditional cache size: 608, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 697, Positive cache size: 697, Positive conditional cache size: 609, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 698, Positive cache size: 698, Positive conditional cache size: 610, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 699, Positive cache size: 699, Positive conditional cache size: 611, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 700, Positive cache size: 700, Positive conditional cache size: 612, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 701, Positive cache size: 701, Positive conditional cache size: 613, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 702, Positive cache size: 702, Positive conditional cache size: 614, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 703, Positive cache size: 703, Positive conditional cache size: 615, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 704, Positive cache size: 704, Positive conditional cache size: 616, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 705, Positive cache size: 705, Positive conditional cache size: 617, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 706, Positive cache size: 706, Positive conditional cache size: 618, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 707, Positive cache size: 707, Positive conditional cache size: 619, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 708, Positive cache size: 708, Positive conditional cache size: 620, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 709, Positive cache size: 709, Positive conditional cache size: 621, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 710, Positive cache size: 710, Positive conditional cache size: 622, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 711, Positive cache size: 711, Positive conditional cache size: 623, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 712, Positive cache size: 712, Positive conditional cache size: 624, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 713, Positive cache size: 713, Positive conditional cache size: 625, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 714, Positive cache size: 714, Positive conditional cache size: 626, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 715, Positive cache size: 715, Positive conditional cache size: 627, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 716, Positive cache size: 716, Positive conditional cache size: 628, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 717, Positive cache size: 717, Positive conditional cache size: 629, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 718, Positive cache size: 718, Positive conditional cache size: 630, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 719, Positive cache size: 719, Positive conditional cache size: 631, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 720, Positive cache size: 720, Positive conditional cache size: 632, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 721, Positive cache size: 721, Positive conditional cache size: 633, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 722, Positive cache size: 722, Positive conditional cache size: 634, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 723, Positive cache size: 723, Positive conditional cache size: 635, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 724, Positive cache size: 724, Positive conditional cache size: 636, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 725, Positive cache size: 725, Positive conditional cache size: 637, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 726, Positive cache size: 726, Positive conditional cache size: 638, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 727, Positive cache size: 727, Positive conditional cache size: 639, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 728, Positive cache size: 728, Positive conditional cache size: 640, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 729, Positive cache size: 729, Positive conditional cache size: 641, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 730, Positive cache size: 730, Positive conditional cache size: 642, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 731, Positive cache size: 731, Positive conditional cache size: 643, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 732, Positive cache size: 732, Positive conditional cache size: 644, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 733, Positive cache size: 733, Positive conditional cache size: 645, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 734, Positive cache size: 734, Positive conditional cache size: 646, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 735, Positive cache size: 735, Positive conditional cache size: 647, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 736, Positive cache size: 736, Positive conditional cache size: 648, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 737, Positive cache size: 737, Positive conditional cache size: 649, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 738, Positive cache size: 738, Positive conditional cache size: 650, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 739, Positive cache size: 739, Positive conditional cache size: 651, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 740, Positive cache size: 740, Positive conditional cache size: 652, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 741, Positive cache size: 741, Positive conditional cache size: 653, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 742, Positive cache size: 742, Positive conditional cache size: 654, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 743, Positive cache size: 743, Positive conditional cache size: 655, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 744, Positive cache size: 744, Positive conditional cache size: 656, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 745, Positive cache size: 745, Positive conditional cache size: 657, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 746, Positive cache size: 746, Positive conditional cache size: 658, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 747, Positive cache size: 747, Positive conditional cache size: 659, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 748, Positive cache size: 748, Positive conditional cache size: 660, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 749, Positive cache size: 749, Positive conditional cache size: 661, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 750, Positive cache size: 750, Positive conditional cache size: 662, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 751, Positive cache size: 751, Positive conditional cache size: 663, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 752, Positive cache size: 752, Positive conditional cache size: 664, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 753, Positive cache size: 753, Positive conditional cache size: 665, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 754, Positive cache size: 754, Positive conditional cache size: 666, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 755, Positive cache size: 755, Positive conditional cache size: 667, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 756, Positive cache size: 756, Positive conditional cache size: 668, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 757, Positive cache size: 757, Positive conditional cache size: 669, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 758, Positive cache size: 758, Positive conditional cache size: 670, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 759, Positive cache size: 759, Positive conditional cache size: 671, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 760, Positive cache size: 760, Positive conditional cache size: 672, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 761, Positive cache size: 761, Positive conditional cache size: 673, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 762, Positive cache size: 762, Positive conditional cache size: 674, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 763, Positive cache size: 763, Positive conditional cache size: 675, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 764, Positive cache size: 764, Positive conditional cache size: 676, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 765, Positive cache size: 765, Positive conditional cache size: 677, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 766, Positive cache size: 766, Positive conditional cache size: 678, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 767, Positive cache size: 767, Positive conditional cache size: 679, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 768, Positive cache size: 768, Positive conditional cache size: 680, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 769, Positive cache size: 769, Positive conditional cache size: 681, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 770, Positive cache size: 770, Positive conditional cache size: 682, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 771, Positive cache size: 771, Positive conditional cache size: 683, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 772, Positive cache size: 772, Positive conditional cache size: 684, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 773, Positive cache size: 773, Positive conditional cache size: 685, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 774, Positive cache size: 774, Positive conditional cache size: 686, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 775, Positive cache size: 775, Positive conditional cache size: 687, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 776, Positive cache size: 776, Positive conditional cache size: 688, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 777, Positive cache size: 777, Positive conditional cache size: 689, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 778, Positive cache size: 778, Positive conditional cache size: 690, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 779, Positive cache size: 779, Positive conditional cache size: 691, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 780, Positive cache size: 780, Positive conditional cache size: 692, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 781, Positive cache size: 781, Positive conditional cache size: 693, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 782, Positive cache size: 782, Positive conditional cache size: 694, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 783, Positive cache size: 783, Positive conditional cache size: 695, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 784, Positive cache size: 784, Positive conditional cache size: 696, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 785, Positive cache size: 785, Positive conditional cache size: 697, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 786, Positive cache size: 786, Positive conditional cache size: 698, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 787, Positive cache size: 787, Positive conditional cache size: 699, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 788, Positive cache size: 788, Positive conditional cache size: 700, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 789, Positive cache size: 789, Positive conditional cache size: 701, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 790, Positive cache size: 790, Positive conditional cache size: 702, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 791, Positive cache size: 791, Positive conditional cache size: 703, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 792, Positive cache size: 792, Positive conditional cache size: 704, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 793, Positive cache size: 793, Positive conditional cache size: 705, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 794, Positive cache size: 794, Positive conditional cache size: 706, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 795, Positive cache size: 795, Positive conditional cache size: 707, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 796, Positive cache size: 796, Positive conditional cache size: 708, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 797, Positive cache size: 797, Positive conditional cache size: 709, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 798, Positive cache size: 798, Positive conditional cache size: 710, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 799, Positive cache size: 799, Positive conditional cache size: 711, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 800, Positive cache size: 800, Positive conditional cache size: 712, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 801, Positive cache size: 801, Positive conditional cache size: 713, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 802, Positive cache size: 802, Positive conditional cache size: 714, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 803, Positive cache size: 803, Positive conditional cache size: 715, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 804, Positive cache size: 804, Positive conditional cache size: 716, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 805, Positive cache size: 805, Positive conditional cache size: 717, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 806, Positive cache size: 806, Positive conditional cache size: 718, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 807, Positive cache size: 807, Positive conditional cache size: 719, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 808, Positive cache size: 808, Positive conditional cache size: 720, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 809, Positive cache size: 809, Positive conditional cache size: 721, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 810, Positive cache size: 810, Positive conditional cache size: 722, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 811, Positive cache size: 811, Positive conditional cache size: 723, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 812, Positive cache size: 812, Positive conditional cache size: 724, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 813, Positive cache size: 813, Positive conditional cache size: 725, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 814, Positive cache size: 814, Positive conditional cache size: 726, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 815, Positive cache size: 815, Positive conditional cache size: 727, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 816, Positive cache size: 816, Positive conditional cache size: 728, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 817, Positive cache size: 817, Positive conditional cache size: 729, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 818, Positive cache size: 818, Positive conditional cache size: 730, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 819, Positive cache size: 819, Positive conditional cache size: 731, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 820, Positive cache size: 820, Positive conditional cache size: 732, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 821, Positive cache size: 821, Positive conditional cache size: 733, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 822, Positive cache size: 822, Positive conditional cache size: 734, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 823, Positive cache size: 823, Positive conditional cache size: 735, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 824, Positive cache size: 824, Positive conditional cache size: 736, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 825, Positive cache size: 825, Positive conditional cache size: 737, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 826, Positive cache size: 826, Positive conditional cache size: 738, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 827, Positive cache size: 827, Positive conditional cache size: 739, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 828, Positive cache size: 828, Positive conditional cache size: 740, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 829, Positive cache size: 829, Positive conditional cache size: 741, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 830, Positive cache size: 830, Positive conditional cache size: 742, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 831, Positive cache size: 831, Positive conditional cache size: 743, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 832, Positive cache size: 832, Positive conditional cache size: 744, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 833, Positive cache size: 833, Positive conditional cache size: 745, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 834, Positive cache size: 834, Positive conditional cache size: 746, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 835, Positive cache size: 835, Positive conditional cache size: 747, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 836, Positive cache size: 836, Positive conditional cache size: 748, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 837, Positive cache size: 837, Positive conditional cache size: 749, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 838, Positive cache size: 838, Positive conditional cache size: 750, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 839, Positive cache size: 839, Positive conditional cache size: 751, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 840, Positive cache size: 840, Positive conditional cache size: 752, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 841, Positive cache size: 841, Positive conditional cache size: 753, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 842, Positive cache size: 842, Positive conditional cache size: 754, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 843, Positive cache size: 843, Positive conditional cache size: 755, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 844, Positive cache size: 844, Positive conditional cache size: 756, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 845, Positive cache size: 845, Positive conditional cache size: 757, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 846, Positive cache size: 846, Positive conditional cache size: 758, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 847, Positive cache size: 847, Positive conditional cache size: 759, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 848, Positive cache size: 848, Positive conditional cache size: 760, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 849, Positive cache size: 849, Positive conditional cache size: 761, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 850, Positive cache size: 850, Positive conditional cache size: 762, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 851, Positive cache size: 851, Positive conditional cache size: 763, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 852, Positive cache size: 852, Positive conditional cache size: 764, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 853, Positive cache size: 853, Positive conditional cache size: 765, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 854, Positive cache size: 854, Positive conditional cache size: 766, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 855, Positive cache size: 855, Positive conditional cache size: 767, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 856, Positive cache size: 856, Positive conditional cache size: 768, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 857, Positive cache size: 857, Positive conditional cache size: 769, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 858, Positive cache size: 858, Positive conditional cache size: 770, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 859, Positive cache size: 859, Positive conditional cache size: 771, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 860, Positive cache size: 860, Positive conditional cache size: 772, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 861, Positive cache size: 861, Positive conditional cache size: 773, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 862, Positive cache size: 862, Positive conditional cache size: 774, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 863, Positive cache size: 863, Positive conditional cache size: 775, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 864, Positive cache size: 864, Positive conditional cache size: 776, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 865, Positive cache size: 865, Positive conditional cache size: 777, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 866, Positive cache size: 866, Positive conditional cache size: 778, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 867, Positive cache size: 867, Positive conditional cache size: 779, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 868, Positive cache size: 868, Positive conditional cache size: 780, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 869, Positive cache size: 869, Positive conditional cache size: 781, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 870, Positive cache size: 870, Positive conditional cache size: 782, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 871, Positive cache size: 871, Positive conditional cache size: 783, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 872, Positive cache size: 872, Positive conditional cache size: 784, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 873, Positive cache size: 873, Positive conditional cache size: 785, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 874, Positive cache size: 874, Positive conditional cache size: 786, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 875, Positive cache size: 875, Positive conditional cache size: 787, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 876, Positive cache size: 876, Positive conditional cache size: 788, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 877, Positive cache size: 877, Positive conditional cache size: 789, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 878, Positive cache size: 878, Positive conditional cache size: 790, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 879, Positive cache size: 879, Positive conditional cache size: 791, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 880, Positive cache size: 880, Positive conditional cache size: 792, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 881, Positive cache size: 881, Positive conditional cache size: 793, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 882, Positive cache size: 882, Positive conditional cache size: 794, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 883, Positive cache size: 883, Positive conditional cache size: 795, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 884, Positive cache size: 884, Positive conditional cache size: 796, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 885, Positive cache size: 885, Positive conditional cache size: 797, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 886, Positive cache size: 886, Positive conditional cache size: 798, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 887, Positive cache size: 887, Positive conditional cache size: 799, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 888, Positive cache size: 888, Positive conditional cache size: 800, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 889, Positive cache size: 889, Positive conditional cache size: 801, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 890, Positive cache size: 890, Positive conditional cache size: 802, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 891, Positive cache size: 891, Positive conditional cache size: 803, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 892, Positive cache size: 892, Positive conditional cache size: 804, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 893, Positive cache size: 893, Positive conditional cache size: 805, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 894, Positive cache size: 894, Positive conditional cache size: 806, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 895, Positive cache size: 895, Positive conditional cache size: 807, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 896, Positive cache size: 896, Positive conditional cache size: 808, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 897, Positive cache size: 897, Positive conditional cache size: 809, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 898, Positive cache size: 898, Positive conditional cache size: 810, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 899, Positive cache size: 899, Positive conditional cache size: 811, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 900, Positive cache size: 900, Positive conditional cache size: 812, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 901, Positive cache size: 901, Positive conditional cache size: 813, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 902, Positive cache size: 902, Positive conditional cache size: 814, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 903, Positive cache size: 903, Positive conditional cache size: 815, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 904, Positive cache size: 904, Positive conditional cache size: 816, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 905, Positive cache size: 905, Positive conditional cache size: 817, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 906, Positive cache size: 906, Positive conditional cache size: 818, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 907, Positive cache size: 907, Positive conditional cache size: 819, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 908, Positive cache size: 908, Positive conditional cache size: 820, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 909, Positive cache size: 909, Positive conditional cache size: 821, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 910, Positive cache size: 910, Positive conditional cache size: 822, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 911, Positive cache size: 911, Positive conditional cache size: 823, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 912, Positive cache size: 912, Positive conditional cache size: 824, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 913, Positive cache size: 913, Positive conditional cache size: 825, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 914, Positive cache size: 914, Positive conditional cache size: 826, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 915, Positive cache size: 915, Positive conditional cache size: 827, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 916, Positive cache size: 916, Positive conditional cache size: 828, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 917, Positive cache size: 917, Positive conditional cache size: 829, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 918, Positive cache size: 918, Positive conditional cache size: 830, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 919, Positive cache size: 919, Positive conditional cache size: 831, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 920, Positive cache size: 920, Positive conditional cache size: 832, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 921, Positive cache size: 921, Positive conditional cache size: 833, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 922, Positive cache size: 922, Positive conditional cache size: 834, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 923, Positive cache size: 923, Positive conditional cache size: 835, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 924, Positive cache size: 924, Positive conditional cache size: 836, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 925, Positive cache size: 925, Positive conditional cache size: 837, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 926, Positive cache size: 926, Positive conditional cache size: 838, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 927, Positive cache size: 927, Positive conditional cache size: 839, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 928, Positive cache size: 928, Positive conditional cache size: 840, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 929, Positive cache size: 929, Positive conditional cache size: 841, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 930, Positive cache size: 930, Positive conditional cache size: 842, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 931, Positive cache size: 931, Positive conditional cache size: 843, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 932, Positive cache size: 932, Positive conditional cache size: 844, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 933, Positive cache size: 933, Positive conditional cache size: 845, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 934, Positive cache size: 934, Positive conditional cache size: 846, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 935, Positive cache size: 935, Positive conditional cache size: 847, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 936, Positive cache size: 936, Positive conditional cache size: 848, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 937, Positive cache size: 937, Positive conditional cache size: 849, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 938, Positive cache size: 938, Positive conditional cache size: 850, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 939, Positive cache size: 939, Positive conditional cache size: 851, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 940, Positive cache size: 940, Positive conditional cache size: 852, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 941, Positive cache size: 941, Positive conditional cache size: 853, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 942, Positive cache size: 942, Positive conditional cache size: 854, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 943, Positive cache size: 943, Positive conditional cache size: 855, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 944, Positive cache size: 944, Positive conditional cache size: 856, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 945, Positive cache size: 945, Positive conditional cache size: 857, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 946, Positive cache size: 946, Positive conditional cache size: 858, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 947, Positive cache size: 947, Positive conditional cache size: 859, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 948, Positive cache size: 948, Positive conditional cache size: 860, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 949, Positive cache size: 949, Positive conditional cache size: 861, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 950, Positive cache size: 950, Positive conditional cache size: 862, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 951, Positive cache size: 951, Positive conditional cache size: 863, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 952, Positive cache size: 952, Positive conditional cache size: 864, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 953, Positive cache size: 953, Positive conditional cache size: 865, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 954, Positive cache size: 954, Positive conditional cache size: 866, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 955, Positive cache size: 955, Positive conditional cache size: 867, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 956, Positive cache size: 956, Positive conditional cache size: 868, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 957, Positive cache size: 957, Positive conditional cache size: 869, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 958, Positive cache size: 958, Positive conditional cache size: 870, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 959, Positive cache size: 959, Positive conditional cache size: 871, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 960, Positive cache size: 960, Positive conditional cache size: 872, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 961, Positive cache size: 961, Positive conditional cache size: 873, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 962, Positive cache size: 962, Positive conditional cache size: 874, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 963, Positive cache size: 963, Positive conditional cache size: 875, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 964, Positive cache size: 964, Positive conditional cache size: 876, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 965, Positive cache size: 965, Positive conditional cache size: 877, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 966, Positive cache size: 966, Positive conditional cache size: 878, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 967, Positive cache size: 967, Positive conditional cache size: 879, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 968, Positive cache size: 968, Positive conditional cache size: 880, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 969, Positive cache size: 969, Positive conditional cache size: 881, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 970, Positive cache size: 970, Positive conditional cache size: 882, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 971, Positive cache size: 971, Positive conditional cache size: 883, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 972, Positive cache size: 972, Positive conditional cache size: 884, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 973, Positive cache size: 973, Positive conditional cache size: 885, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 974, Positive cache size: 974, Positive conditional cache size: 886, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 975, Positive cache size: 975, Positive conditional cache size: 887, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 976, Positive cache size: 976, Positive conditional cache size: 888, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 977, Positive cache size: 977, Positive conditional cache size: 889, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 978, Positive cache size: 978, Positive conditional cache size: 890, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 979, Positive cache size: 979, Positive conditional cache size: 891, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 980, Positive cache size: 980, Positive conditional cache size: 892, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 981, Positive cache size: 981, Positive conditional cache size: 893, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 982, Positive cache size: 982, Positive conditional cache size: 894, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 983, Positive cache size: 983, Positive conditional cache size: 895, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 984, Positive cache size: 984, Positive conditional cache size: 896, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 985, Positive cache size: 985, Positive conditional cache size: 897, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 986, Positive cache size: 986, Positive conditional cache size: 898, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 987, Positive cache size: 987, Positive conditional cache size: 899, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 988, Positive cache size: 988, Positive conditional cache size: 900, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 989, Positive cache size: 989, Positive conditional cache size: 901, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 990, Positive cache size: 990, Positive conditional cache size: 902, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 991, Positive cache size: 991, Positive conditional cache size: 903, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 992, Positive cache size: 992, Positive conditional cache size: 904, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 993, Positive cache size: 993, Positive conditional cache size: 905, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 994, Positive cache size: 994, Positive conditional cache size: 906, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 995, Positive cache size: 995, Positive conditional cache size: 907, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 996, Positive cache size: 996, Positive conditional cache size: 908, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 997, Positive cache size: 997, Positive conditional cache size: 909, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 998, Positive cache size: 998, Positive conditional cache size: 910, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 999, Positive cache size: 999, Positive conditional cache size: 911, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1000, Positive cache size: 1000, Positive conditional cache size: 912, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1001, Positive cache size: 1001, Positive conditional cache size: 913, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1002, Positive cache size: 1002, Positive conditional cache size: 914, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1003, Positive cache size: 1003, Positive conditional cache size: 915, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1004, Positive cache size: 1004, Positive conditional cache size: 916, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1005, Positive cache size: 1005, Positive conditional cache size: 917, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1006, Positive cache size: 1006, Positive conditional cache size: 918, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1007, Positive cache size: 1007, Positive conditional cache size: 919, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1008, Positive cache size: 1008, Positive conditional cache size: 920, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1009, Positive cache size: 1009, Positive conditional cache size: 921, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1010, Positive cache size: 1010, Positive conditional cache size: 922, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1011, Positive cache size: 1011, Positive conditional cache size: 923, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1012, Positive cache size: 1012, Positive conditional cache size: 924, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1013, Positive cache size: 1013, Positive conditional cache size: 925, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1014, Positive cache size: 1014, Positive conditional cache size: 926, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1015, Positive cache size: 1015, Positive conditional cache size: 927, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1016, Positive cache size: 1016, Positive conditional cache size: 928, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1017, Positive cache size: 1017, Positive conditional cache size: 929, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1018, Positive cache size: 1018, Positive conditional cache size: 930, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1019, Positive cache size: 1019, Positive conditional cache size: 931, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1020, Positive cache size: 1020, Positive conditional cache size: 932, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1021, Positive cache size: 1021, Positive conditional cache size: 933, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1022, Positive cache size: 1022, Positive conditional cache size: 934, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1023, Positive cache size: 1023, Positive conditional cache size: 935, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1024, Positive cache size: 1024, Positive conditional cache size: 936, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1025, Positive cache size: 1025, Positive conditional cache size: 937, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1026, Positive cache size: 1026, Positive conditional cache size: 938, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1027, Positive cache size: 1027, Positive conditional cache size: 939, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1028, Positive cache size: 1028, Positive conditional cache size: 940, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1029, Positive cache size: 1029, Positive conditional cache size: 941, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1030, Positive cache size: 1030, Positive conditional cache size: 942, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1031, Positive cache size: 1031, Positive conditional cache size: 943, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1032, Positive cache size: 1032, Positive conditional cache size: 944, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1033, Positive cache size: 1033, Positive conditional cache size: 945, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1034, Positive cache size: 1034, Positive conditional cache size: 946, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1035, Positive cache size: 1035, Positive conditional cache size: 947, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1036, Positive cache size: 1036, Positive conditional cache size: 948, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1037, Positive cache size: 1037, Positive conditional cache size: 949, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1038, Positive cache size: 1038, Positive conditional cache size: 950, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1039, Positive cache size: 1039, Positive conditional cache size: 951, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1040, Positive cache size: 1040, Positive conditional cache size: 952, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1041, Positive cache size: 1041, Positive conditional cache size: 953, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1042, Positive cache size: 1042, Positive conditional cache size: 954, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1043, Positive cache size: 1043, Positive conditional cache size: 955, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1044, Positive cache size: 1044, Positive conditional cache size: 956, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1045, Positive cache size: 1045, Positive conditional cache size: 957, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1046, Positive cache size: 1046, Positive conditional cache size: 958, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1047, Positive cache size: 1047, Positive conditional cache size: 959, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1048, Positive cache size: 1048, Positive conditional cache size: 960, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1049, Positive cache size: 1049, Positive conditional cache size: 961, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1050, Positive cache size: 1050, Positive conditional cache size: 962, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1051, Positive cache size: 1051, Positive conditional cache size: 963, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1052, Positive cache size: 1052, Positive conditional cache size: 964, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1053, Positive cache size: 1053, Positive conditional cache size: 965, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1054, Positive cache size: 1054, Positive conditional cache size: 966, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1055, Positive cache size: 1055, Positive conditional cache size: 967, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1056, Positive cache size: 1056, Positive conditional cache size: 968, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1057, Positive cache size: 1057, Positive conditional cache size: 969, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1058, Positive cache size: 1058, Positive conditional cache size: 970, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1059, Positive cache size: 1059, Positive conditional cache size: 971, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1060, Positive cache size: 1060, Positive conditional cache size: 972, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1061, Positive cache size: 1061, Positive conditional cache size: 973, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1062, Positive cache size: 1062, Positive conditional cache size: 974, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1063, Positive cache size: 1063, Positive conditional cache size: 975, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1064, Positive cache size: 1064, Positive conditional cache size: 976, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1065, Positive cache size: 1065, Positive conditional cache size: 977, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1066, Positive cache size: 1066, Positive conditional cache size: 978, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1067, Positive cache size: 1067, Positive conditional cache size: 979, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1068, Positive cache size: 1068, Positive conditional cache size: 980, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1069, Positive cache size: 1069, Positive conditional cache size: 981, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1070, Positive cache size: 1070, Positive conditional cache size: 982, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1071, Positive cache size: 1071, Positive conditional cache size: 983, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1072, Positive cache size: 1072, Positive conditional cache size: 984, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1073, Positive cache size: 1073, Positive conditional cache size: 985, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1074, Positive cache size: 1074, Positive conditional cache size: 986, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1075, Positive cache size: 1075, Positive conditional cache size: 987, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1076, Positive cache size: 1076, Positive conditional cache size: 988, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1077, Positive cache size: 1077, Positive conditional cache size: 989, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1078, Positive cache size: 1078, Positive conditional cache size: 990, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1079, Positive cache size: 1079, Positive conditional cache size: 991, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1080, Positive cache size: 1080, Positive conditional cache size: 992, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1081, Positive cache size: 1081, Positive conditional cache size: 993, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1082, Positive cache size: 1082, Positive conditional cache size: 994, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1083, Positive cache size: 1083, Positive conditional cache size: 995, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1084, Positive cache size: 1084, Positive conditional cache size: 996, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1085, Positive cache size: 1085, Positive conditional cache size: 997, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1086, Positive cache size: 1086, Positive conditional cache size: 998, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1087, Positive cache size: 1087, Positive conditional cache size: 999, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1088, Positive cache size: 1088, Positive conditional cache size: 1000, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1089, Positive cache size: 1089, Positive conditional cache size: 1001, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1090, Positive cache size: 1090, Positive conditional cache size: 1002, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1091, Positive cache size: 1091, Positive conditional cache size: 1003, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1092, Positive cache size: 1092, Positive conditional cache size: 1004, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1093, Positive cache size: 1093, Positive conditional cache size: 1005, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1094, Positive cache size: 1094, Positive conditional cache size: 1006, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1095, Positive cache size: 1095, Positive conditional cache size: 1007, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1096, Positive cache size: 1096, Positive conditional cache size: 1008, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1097, Positive cache size: 1097, Positive conditional cache size: 1009, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1098, Positive cache size: 1098, Positive conditional cache size: 1010, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1099, Positive cache size: 1099, Positive conditional cache size: 1011, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1100, Positive cache size: 1100, Positive conditional cache size: 1012, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1101, Positive cache size: 1101, Positive conditional cache size: 1013, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1102, Positive cache size: 1102, Positive conditional cache size: 1014, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1103, Positive cache size: 1103, Positive conditional cache size: 1015, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1104, Positive cache size: 1104, Positive conditional cache size: 1016, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1105, Positive cache size: 1105, Positive conditional cache size: 1017, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1106, Positive cache size: 1106, Positive conditional cache size: 1018, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1107, Positive cache size: 1107, Positive conditional cache size: 1019, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1108, Positive cache size: 1108, Positive conditional cache size: 1020, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1109, Positive cache size: 1109, Positive conditional cache size: 1021, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1110, Positive cache size: 1110, Positive conditional cache size: 1022, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1111, Positive cache size: 1111, Positive conditional cache size: 1023, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1112, Positive cache size: 1112, Positive conditional cache size: 1024, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1113, Positive cache size: 1113, Positive conditional cache size: 1025, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1114, Positive cache size: 1114, Positive conditional cache size: 1026, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1115, Positive cache size: 1115, Positive conditional cache size: 1027, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1116, Positive cache size: 1116, Positive conditional cache size: 1028, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1117, Positive cache size: 1117, Positive conditional cache size: 1029, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1118, Positive cache size: 1118, Positive conditional cache size: 1030, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1119, Positive cache size: 1119, Positive conditional cache size: 1031, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1120, Positive cache size: 1120, Positive conditional cache size: 1032, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1121, Positive cache size: 1121, Positive conditional cache size: 1033, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1122, Positive cache size: 1122, Positive conditional cache size: 1034, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1123, Positive cache size: 1123, Positive conditional cache size: 1035, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1124, Positive cache size: 1124, Positive conditional cache size: 1036, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1125, Positive cache size: 1125, Positive conditional cache size: 1037, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1126, Positive cache size: 1126, Positive conditional cache size: 1038, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1127, Positive cache size: 1127, Positive conditional cache size: 1039, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1128, Positive cache size: 1128, Positive conditional cache size: 1040, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1129, Positive cache size: 1129, Positive conditional cache size: 1041, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1130, Positive cache size: 1130, Positive conditional cache size: 1042, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1131, Positive cache size: 1131, Positive conditional cache size: 1043, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1132, Positive cache size: 1132, Positive conditional cache size: 1044, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1133, Positive cache size: 1133, Positive conditional cache size: 1045, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1134, Positive cache size: 1134, Positive conditional cache size: 1046, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1135, Positive cache size: 1135, Positive conditional cache size: 1047, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1136, Positive cache size: 1136, Positive conditional cache size: 1048, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1137, Positive cache size: 1137, Positive conditional cache size: 1049, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1138, Positive cache size: 1138, Positive conditional cache size: 1050, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1139, Positive cache size: 1139, Positive conditional cache size: 1051, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1140, Positive cache size: 1140, Positive conditional cache size: 1052, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1141, Positive cache size: 1141, Positive conditional cache size: 1053, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1142, Positive cache size: 1142, Positive conditional cache size: 1054, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1143, Positive cache size: 1143, Positive conditional cache size: 1055, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1144, Positive cache size: 1144, Positive conditional cache size: 1056, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1145, Positive cache size: 1145, Positive conditional cache size: 1057, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1146, Positive cache size: 1146, Positive conditional cache size: 1058, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1147, Positive cache size: 1147, Positive conditional cache size: 1059, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1148, Positive cache size: 1148, Positive conditional cache size: 1060, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1149, Positive cache size: 1149, Positive conditional cache size: 1061, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1150, Positive cache size: 1150, Positive conditional cache size: 1062, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1151, Positive cache size: 1151, Positive conditional cache size: 1063, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1152, Positive cache size: 1152, Positive conditional cache size: 1064, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1153, Positive cache size: 1153, Positive conditional cache size: 1065, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1154, Positive cache size: 1154, Positive conditional cache size: 1066, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1155, Positive cache size: 1155, Positive conditional cache size: 1067, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1156, Positive cache size: 1156, Positive conditional cache size: 1068, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1157, Positive cache size: 1157, Positive conditional cache size: 1069, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1158, Positive cache size: 1158, Positive conditional cache size: 1070, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1159, Positive cache size: 1159, Positive conditional cache size: 1071, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1160, Positive cache size: 1160, Positive conditional cache size: 1072, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1161, Positive cache size: 1161, Positive conditional cache size: 1073, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1162, Positive cache size: 1162, Positive conditional cache size: 1074, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1163, Positive cache size: 1163, Positive conditional cache size: 1075, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1164, Positive cache size: 1164, Positive conditional cache size: 1076, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1165, Positive cache size: 1165, Positive conditional cache size: 1077, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1166, Positive cache size: 1166, Positive conditional cache size: 1078, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1167, Positive cache size: 1167, Positive conditional cache size: 1079, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1168, Positive cache size: 1168, Positive conditional cache size: 1080, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1169, Positive cache size: 1169, Positive conditional cache size: 1081, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1170, Positive cache size: 1170, Positive conditional cache size: 1082, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1171, Positive cache size: 1171, Positive conditional cache size: 1083, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1172, Positive cache size: 1172, Positive conditional cache size: 1084, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1173, Positive cache size: 1173, Positive conditional cache size: 1085, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1174, Positive cache size: 1174, Positive conditional cache size: 1086, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1175, Positive cache size: 1175, Positive conditional cache size: 1087, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1176, Positive cache size: 1176, Positive conditional cache size: 1088, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1177, Positive cache size: 1177, Positive conditional cache size: 1089, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1178, Positive cache size: 1178, Positive conditional cache size: 1090, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1179, Positive cache size: 1179, Positive conditional cache size: 1091, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1180, Positive cache size: 1180, Positive conditional cache size: 1092, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1181, Positive cache size: 1181, Positive conditional cache size: 1093, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1182, Positive cache size: 1182, Positive conditional cache size: 1094, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1183, Positive cache size: 1183, Positive conditional cache size: 1095, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1184, Positive cache size: 1184, Positive conditional cache size: 1096, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1185, Positive cache size: 1185, Positive conditional cache size: 1097, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1186, Positive cache size: 1186, Positive conditional cache size: 1098, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1187, Positive cache size: 1187, Positive conditional cache size: 1099, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1188, Positive cache size: 1188, Positive conditional cache size: 1100, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1189, Positive cache size: 1189, Positive conditional cache size: 1101, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1190, Positive cache size: 1190, Positive conditional cache size: 1102, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1191, Positive cache size: 1191, Positive conditional cache size: 1103, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1192, Positive cache size: 1192, Positive conditional cache size: 1104, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1193, Positive cache size: 1193, Positive conditional cache size: 1105, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1194, Positive cache size: 1194, Positive conditional cache size: 1106, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1195, Positive cache size: 1195, Positive conditional cache size: 1107, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1196, Positive cache size: 1196, Positive conditional cache size: 1108, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1197, Positive cache size: 1197, Positive conditional cache size: 1109, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1198, Positive cache size: 1198, Positive conditional cache size: 1110, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1199, Positive cache size: 1199, Positive conditional cache size: 1111, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1200, Positive cache size: 1200, Positive conditional cache size: 1112, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1201, Positive cache size: 1201, Positive conditional cache size: 1113, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1202, Positive cache size: 1202, Positive conditional cache size: 1114, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1203, Positive cache size: 1203, Positive conditional cache size: 1115, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1204, Positive cache size: 1204, Positive conditional cache size: 1116, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1205, Positive cache size: 1205, Positive conditional cache size: 1117, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1206, Positive cache size: 1206, Positive conditional cache size: 1118, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1207, Positive cache size: 1207, Positive conditional cache size: 1119, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1208, Positive cache size: 1208, Positive conditional cache size: 1120, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1209, Positive cache size: 1209, Positive conditional cache size: 1121, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1210, Positive cache size: 1210, Positive conditional cache size: 1122, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1211, Positive cache size: 1211, Positive conditional cache size: 1123, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1212, Positive cache size: 1212, Positive conditional cache size: 1124, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1213, Positive cache size: 1213, Positive conditional cache size: 1125, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1214, Positive cache size: 1214, Positive conditional cache size: 1126, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1215, Positive cache size: 1215, Positive conditional cache size: 1127, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1216, Positive cache size: 1216, Positive conditional cache size: 1128, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1217, Positive cache size: 1217, Positive conditional cache size: 1129, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1218, Positive cache size: 1218, Positive conditional cache size: 1130, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1219, Positive cache size: 1219, Positive conditional cache size: 1131, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1220, Positive cache size: 1220, Positive conditional cache size: 1132, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1221, Positive cache size: 1221, Positive conditional cache size: 1133, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1222, Positive cache size: 1222, Positive conditional cache size: 1134, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1223, Positive cache size: 1223, Positive conditional cache size: 1135, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1224, Positive cache size: 1224, Positive conditional cache size: 1136, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1225, Positive cache size: 1225, Positive conditional cache size: 1137, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1226, Positive cache size: 1226, Positive conditional cache size: 1138, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1227, Positive cache size: 1227, Positive conditional cache size: 1139, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1228, Positive cache size: 1228, Positive conditional cache size: 1140, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1229, Positive cache size: 1229, Positive conditional cache size: 1141, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1230, Positive cache size: 1230, Positive conditional cache size: 1142, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1231, Positive cache size: 1231, Positive conditional cache size: 1143, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1232, Positive cache size: 1232, Positive conditional cache size: 1144, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1233, Positive cache size: 1233, Positive conditional cache size: 1145, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1234, Positive cache size: 1234, Positive conditional cache size: 1146, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1235, Positive cache size: 1235, Positive conditional cache size: 1147, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1236, Positive cache size: 1236, Positive conditional cache size: 1148, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1237, Positive cache size: 1237, Positive conditional cache size: 1149, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1238, Positive cache size: 1238, Positive conditional cache size: 1150, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1239, Positive cache size: 1239, Positive conditional cache size: 1151, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1240, Positive cache size: 1240, Positive conditional cache size: 1152, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1241, Positive cache size: 1241, Positive conditional cache size: 1153, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1242, Positive cache size: 1242, Positive conditional cache size: 1154, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1243, Positive cache size: 1243, Positive conditional cache size: 1155, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1244, Positive cache size: 1244, Positive conditional cache size: 1156, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1245, Positive cache size: 1245, Positive conditional cache size: 1157, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1246, Positive cache size: 1246, Positive conditional cache size: 1158, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1247, Positive cache size: 1247, Positive conditional cache size: 1159, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1248, Positive cache size: 1248, Positive conditional cache size: 1160, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1249, Positive cache size: 1249, Positive conditional cache size: 1161, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1250, Positive cache size: 1250, Positive conditional cache size: 1162, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1251, Positive cache size: 1251, Positive conditional cache size: 1163, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1252, Positive cache size: 1252, Positive conditional cache size: 1164, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1253, Positive cache size: 1253, Positive conditional cache size: 1165, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1254, Positive cache size: 1254, Positive conditional cache size: 1166, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1255, Positive cache size: 1255, Positive conditional cache size: 1167, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1256, Positive cache size: 1256, Positive conditional cache size: 1168, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1257, Positive cache size: 1257, Positive conditional cache size: 1169, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1258, Positive cache size: 1258, Positive conditional cache size: 1170, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1259, Positive cache size: 1259, Positive conditional cache size: 1171, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1260, Positive cache size: 1260, Positive conditional cache size: 1172, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1261, Positive cache size: 1261, Positive conditional cache size: 1173, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1262, Positive cache size: 1262, Positive conditional cache size: 1174, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1263, Positive cache size: 1263, Positive conditional cache size: 1175, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1264, Positive cache size: 1264, Positive conditional cache size: 1176, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1265, Positive cache size: 1265, Positive conditional cache size: 1177, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1266, Positive cache size: 1266, Positive conditional cache size: 1178, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1267, Positive cache size: 1267, Positive conditional cache size: 1179, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1268, Positive cache size: 1268, Positive conditional cache size: 1180, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1269, Positive cache size: 1269, Positive conditional cache size: 1181, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1270, Positive cache size: 1270, Positive conditional cache size: 1182, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1271, Positive cache size: 1271, Positive conditional cache size: 1183, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1272, Positive cache size: 1272, Positive conditional cache size: 1184, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1273, Positive cache size: 1273, Positive conditional cache size: 1185, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1274, Positive cache size: 1274, Positive conditional cache size: 1186, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1275, Positive cache size: 1275, Positive conditional cache size: 1187, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1276, Positive cache size: 1276, Positive conditional cache size: 1188, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1277, Positive cache size: 1277, Positive conditional cache size: 1189, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1278, Positive cache size: 1278, Positive conditional cache size: 1190, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1279, Positive cache size: 1279, Positive conditional cache size: 1191, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1280, Positive cache size: 1280, Positive conditional cache size: 1192, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1281, Positive cache size: 1281, Positive conditional cache size: 1193, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1282, Positive cache size: 1282, Positive conditional cache size: 1194, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1283, Positive cache size: 1283, Positive conditional cache size: 1195, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1284, Positive cache size: 1284, Positive conditional cache size: 1196, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1285, Positive cache size: 1285, Positive conditional cache size: 1197, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.4s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1286, Positive cache size: 1286, Positive conditional cache size: 1198, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1287, Positive cache size: 1287, Positive conditional cache size: 1199, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1288, Positive cache size: 1288, Positive conditional cache size: 1200, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1289, Positive cache size: 1289, Positive conditional cache size: 1201, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1290, Positive cache size: 1290, Positive conditional cache size: 1202, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1291, Positive cache size: 1291, Positive conditional cache size: 1203, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1292, Positive cache size: 1292, Positive conditional cache size: 1204, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1293, Positive cache size: 1293, Positive conditional cache size: 1205, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1294, Positive cache size: 1294, Positive conditional cache size: 1206, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1295, Positive cache size: 1295, Positive conditional cache size: 1207, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1296, Positive cache size: 1296, Positive conditional cache size: 1208, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1297, Positive cache size: 1297, Positive conditional cache size: 1209, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1298, Positive cache size: 1298, Positive conditional cache size: 1210, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1299, Positive cache size: 1299, Positive conditional cache size: 1211, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1300, Positive cache size: 1300, Positive conditional cache size: 1212, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1301, Positive cache size: 1301, Positive conditional cache size: 1213, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1302, Positive cache size: 1302, Positive conditional cache size: 1214, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1303, Positive cache size: 1303, Positive conditional cache size: 1215, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1304, Positive cache size: 1304, Positive conditional cache size: 1216, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1305, Positive cache size: 1305, Positive conditional cache size: 1217, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1306, Positive cache size: 1306, Positive conditional cache size: 1218, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1307, Positive cache size: 1307, Positive conditional cache size: 1219, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1308, Positive cache size: 1308, Positive conditional cache size: 1220, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1309, Positive cache size: 1309, Positive conditional cache size: 1221, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1310, Positive cache size: 1310, Positive conditional cache size: 1222, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1311, Positive cache size: 1311, Positive conditional cache size: 1223, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1312, Positive cache size: 1312, Positive conditional cache size: 1224, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1313, Positive cache size: 1313, Positive conditional cache size: 1225, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1314, Positive cache size: 1314, Positive conditional cache size: 1226, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1315, Positive cache size: 1315, Positive conditional cache size: 1227, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1316, Positive cache size: 1316, Positive conditional cache size: 1228, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1317, Positive cache size: 1317, Positive conditional cache size: 1229, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1318, Positive cache size: 1318, Positive conditional cache size: 1230, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1319, Positive cache size: 1319, Positive conditional cache size: 1231, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1320, Positive cache size: 1320, Positive conditional cache size: 1232, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1321, Positive cache size: 1321, Positive conditional cache size: 1233, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1322, Positive cache size: 1322, Positive conditional cache size: 1234, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1323, Positive cache size: 1323, Positive conditional cache size: 1235, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1324, Positive cache size: 1324, Positive conditional cache size: 1236, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1325, Positive cache size: 1325, Positive conditional cache size: 1237, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1326, Positive cache size: 1326, Positive conditional cache size: 1238, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1327, Positive cache size: 1327, Positive conditional cache size: 1239, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1328, Positive cache size: 1328, Positive conditional cache size: 1240, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1329, Positive cache size: 1329, Positive conditional cache size: 1241, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1330, Positive cache size: 1330, Positive conditional cache size: 1242, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1331, Positive cache size: 1331, Positive conditional cache size: 1243, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1332, Positive cache size: 1332, Positive conditional cache size: 1244, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1333, Positive cache size: 1333, Positive conditional cache size: 1245, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1334, Positive cache size: 1334, Positive conditional cache size: 1246, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1335, Positive cache size: 1335, Positive conditional cache size: 1247, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1336, Positive cache size: 1336, Positive conditional cache size: 1248, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1337, Positive cache size: 1337, Positive conditional cache size: 1249, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1338, Positive cache size: 1338, Positive conditional cache size: 1250, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1339, Positive cache size: 1339, Positive conditional cache size: 1251, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1340, Positive cache size: 1340, Positive conditional cache size: 1252, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1341, Positive cache size: 1341, Positive conditional cache size: 1253, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1342, Positive cache size: 1342, Positive conditional cache size: 1254, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1343, Positive cache size: 1343, Positive conditional cache size: 1255, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1344, Positive cache size: 1344, Positive conditional cache size: 1256, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1345, Positive cache size: 1345, Positive conditional cache size: 1257, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1346, Positive cache size: 1346, Positive conditional cache size: 1258, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1347, Positive cache size: 1347, Positive conditional cache size: 1259, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1348, Positive cache size: 1348, Positive conditional cache size: 1260, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1349, Positive cache size: 1349, Positive conditional cache size: 1261, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1350, Positive cache size: 1350, Positive conditional cache size: 1262, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1351, Positive cache size: 1351, Positive conditional cache size: 1263, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1352, Positive cache size: 1352, Positive conditional cache size: 1264, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1353, Positive cache size: 1353, Positive conditional cache size: 1265, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1354, Positive cache size: 1354, Positive conditional cache size: 1266, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1355, Positive cache size: 1355, Positive conditional cache size: 1267, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1356, Positive cache size: 1356, Positive conditional cache size: 1268, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1357, Positive cache size: 1357, Positive conditional cache size: 1269, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1358, Positive cache size: 1358, Positive conditional cache size: 1270, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1359, Positive cache size: 1359, Positive conditional cache size: 1271, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1360, Positive cache size: 1360, Positive conditional cache size: 1272, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1361, Positive cache size: 1361, Positive conditional cache size: 1273, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1362, Positive cache size: 1362, Positive conditional cache size: 1274, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1363, Positive cache size: 1363, Positive conditional cache size: 1275, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1364, Positive cache size: 1364, Positive conditional cache size: 1276, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1365, Positive cache size: 1365, Positive conditional cache size: 1277, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1366, Positive cache size: 1366, Positive conditional cache size: 1278, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1367, Positive cache size: 1367, Positive conditional cache size: 1279, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1368, Positive cache size: 1368, Positive conditional cache size: 1280, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1369, Positive cache size: 1369, Positive conditional cache size: 1281, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1370, Positive cache size: 1370, Positive conditional cache size: 1282, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1371, Positive cache size: 1371, Positive conditional cache size: 1283, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1372, Positive cache size: 1372, Positive conditional cache size: 1284, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1373, Positive cache size: 1373, Positive conditional cache size: 1285, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1374, Positive cache size: 1374, Positive conditional cache size: 1286, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1375, Positive cache size: 1375, Positive conditional cache size: 1287, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1376, Positive cache size: 1376, Positive conditional cache size: 1288, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1377, Positive cache size: 1377, Positive conditional cache size: 1289, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1378, Positive cache size: 1378, Positive conditional cache size: 1290, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1379, Positive cache size: 1379, Positive conditional cache size: 1291, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1380, Positive cache size: 1380, Positive conditional cache size: 1292, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1381, Positive cache size: 1381, Positive conditional cache size: 1293, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1382, Positive cache size: 1382, Positive conditional cache size: 1294, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1383, Positive cache size: 1383, Positive conditional cache size: 1295, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1384, Positive cache size: 1384, Positive conditional cache size: 1296, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1385, Positive cache size: 1385, Positive conditional cache size: 1297, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1386, Positive cache size: 1386, Positive conditional cache size: 1298, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1387, Positive cache size: 1387, Positive conditional cache size: 1299, Positive unconditional cache size: 88, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 100 PlacesBefore, 99 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1388, Positive cache size: 1388, Positive conditional cache size: 1300, Positive unconditional cache size: 88, 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: 0 - TimeoutResultAtElement [Line: 80]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while TransFormulaUtils was doing sequential composition of 2 TransFormulas,while SimplifyDDAWithTimeout was simplifying term of DAG size 48 for 34ms.. - TimeoutResultAtElement [Line: 74]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while TransFormulaUtils was doing sequential composition of 2 TransFormulas,while SimplifyDDAWithTimeout was simplifying term of DAG size 48 for 34ms.. - TimeoutResultAtElement [Line: 72]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while TransFormulaUtils was doing sequential composition of 2 TransFormulas,while SimplifyDDAWithTimeout was simplifying term of DAG size 48 for 34ms.. - TimeoutResultAtElement [Line: 73]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while TransFormulaUtils was doing sequential composition of 2 TransFormulas,while SimplifyDDAWithTimeout was simplifying term of DAG size 48 for 34ms.. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 126 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: 799.2s, OverallIterations: 1175, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 457.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 26142 SdHoareTripleChecker+Valid, 133.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 26142 mSDsluCounter, 2409 SdHoareTripleChecker+Invalid, 111.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1211 mSDsCounter, 3532 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 169556 IncrementalHoareTripleChecker+Invalid, 173088 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3532 mSolverCounterUnsat, 1198 mSDtfsCounter, 169556 mSolverCounterSat, 0.7s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 7164 GetRequests, 3600 SyntacticMatches, 8 SemanticMatches, 3556 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 25.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1200occurred in iteration=22, InterpolantAutomatonStates: 4725, 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: 1.0s SsaConstructionTime, 8.6s SatisfiabilityAnalysisTime, 75.1s InterpolantComputationTime, 18892 NumberOfCodeBlocks, 18892 NumberOfCodeBlocksAsserted, 1179 NumberOfCheckSat, 17765 ConstructedInterpolants, 0 QuantifiedInterpolants, 72252 SizeOfPredicates, 19 NumberOfNonLiveVariables, 477 ConjunctsInSsa, 29 ConjunctsInUnsatCore, 1181 InterpolantComputations, 1175 PerfectInterpolantSequences, 5/11 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